Gérard Boudol
Welcome to my home page. I am a Research Director at
INRIA,
Sophia-Antipolis,
within the
MEIJE
project (see also our web site). My
research interests include theory of concurrency
(process algebras, verification, ``true concurrency''),
lambda-calculus, models of higher-order and mobile distributed
systems. I am also interested in programming languages design and
semantics, type theories, logics.
Address
- INRIA
- 2004, Route des Lucioles
- B.P. 93
- 06902 Sophia Antipolis Cedex
- FRANCE
- Tel: (33) (0)4 92 38 79 40
- Fax: (33) (0)4 92 38 79 98
- Email:
Gerard.Boudol@sophia.inria.fr
Some Links
The page ``the
world outside Meije'' provides some links to the environment of
our research project on the theory of concurrency (see the
theory
page), and in particular
to the page Calculi for
Mobile Processes. I also use very frequently
Hypatia, a directory of
researchers in Computer Science and Pure Mathematics, and the list of
researchers
in Programming Languages and Compilers.
My Most Recent Work
is on ``the
blue calculus''. The papers are:
- Typing the use of resources in a concurrent calculus, ASIAN'97, the
Asian Computing Science Conference, Kathmandu, Nepal,
LNCS
1345 (1997) 239-253.
[Abstract,
PostScript,
.ps.gz]
- The pi-calculus in direct style, POPL'97 (1997), 228-241.
[Abstract,
Preliminary version
PostScript,
.ps.gz]
A slightly extended version of the POPL'97 paper can be found here
(.ps), or there
(.ps.gz).
Some Publications
For the items marked with a square, a PostScript is
available. Please ask me if you wish to have a copy of some item
marked with a circle, where you can only browse an Abstract.
- The discriminating power of multiplicities in the
lambda-calculus, with C. Laneve, in Information and
Computation Vol. 126, No. 1 (1996), 83-102.
[Abstract]
- Full abstraction for a lambda-calculus with resources and
convergence testing, with C. Lavatelli, CAAP'96, LNCS
1059 (1996), 302-316.
[Abstract]
- Termination, deadlock and divergence in the lambda-calculus
with multiplicities, with C. Laneve, MFPS'95,
Electronic Notes in Theoretical Computer Science
(ENTCS
), Vol. 1 (1995).
[Abstract]
- Flow models of distributed computations: three equivalent
semantics for CCS, with I.
Castellani, in Information and
Computation Vol. 114, N0 2 (1994), 247-314.
[Abstract]
- A theory of processes with localities, with I.
Castellani, M. Hennessy and A. Kiehn, in Formal Aspects of
Computing (FAC),
Vol 6 (1994), 165-200.
[Abstract]
- Some chemical abstract machines, in A Decade of
Concurrency - Reflections and Perspectives, Lecture Notes in Computer
Science (LNCS)
Vol 803 (1994), 92-123.
[Abstract,
PostScript,
.ps.gz]
- Observing localities, with I.
Castellani, M. Hennessy and A. Kiehn, in Theoretical Computer
Science (TCS)
Vol. 114 (1993), 31-61.
[Abstract]
- Graphical vs logical specifications, with K.G. Larsen, in
Theoretical Computer
Science (TCS )
Vol. 106 (1992), 3-20.
[Abstract]
- The chemical abstract machine, with G. Berry,
in Theoretical Computer Science
(TCS
) Vol. 96 (1992), 217-248.
[Abstract]
- A non-interleaving semantics for CCS based on proved
transitions, with I.
Castellani, in Fundamentae
Informaticae XI (1988), 433-453.
[Abstract]
- Concurrency and atomicity, with I.
Castellani, in Theoretical Computer
Science (TCS )
Vol. 59 (1988), 25-84.
[Abstract]
- Experiment with AUTO and AutoGraph
on a simple case of a sliding window protocol, with R. De
Simone and D. Vergamini, INRIA Research Report 870 (July 1988).
[Abstract]
- Petri nets and algebraic calculi of processes, with
G. Roucairol and R. De
Simone, in Advances in Petri Nets, Lecture Notes in Computer
Science (LNCS)
Vol 222 (1985), 41-58.
[Abstract]
- Notes on algebraic calculi of processes, in Logics and
Models of Concurrent Systems, NATO ASI Series F-13 (1985), 261-303.
[Abstract]
- Computational semantics of term rewriting systems, in
Algebraic Methods in Semantics (M. Nivat & J.C. Reynolds, Eds), Cambridge University Press
(1985), 169-236.
[Abstract]
- Algèbre de processus et synchronisation, with
D. Austry, in Theoretical Computer
Science (TCS)
Vol. 30 (1984), 91-131.
[Abstract]
- Recursion induction principle revisited, with L.
Kott, in Theoretical Computer
Science (TCS)
Vol. 22 (1983), 135-173.
[Abstract]