| 2009 |
|---|
| 62 | EE | Gérard Boudol,
Gustavo Petri:
Relaxed memory models: an operational approach.
POPL 2009: 392-403 |
| 2008 |
|---|
| 61 | EE | Gérard Boudol,
Ilaria Castellani,
Matthew Hennessy,
Mogens Nielsen,
Glynn Winskel:
Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra.
Concurrency, Graphs and Models 2008: 757-777 |
| 60 | EE | Gérard Boudol:
Typing Safe Deallocation.
ESOP 2008: 116-130 |
| 59 | EE | Gérard Boudol:
Secure Information Flow as a Safety Property.
Formal Aspects in Security and Trust 2008: 20-34 |
| 58 | EE | Gérard Boudol:
On strong normalization and type inference in the intersection type discipline.
Theor. Comput. Sci. 398(1-3): 63-81 (2008) |
| 2007 |
|---|
| 57 | EE | Gérard Boudol:
Fair Cooperative Multithreading.
CONCUR 2007: 272-286 |
| 56 | EE | Ana Almeida Matos,
Gérard Boudol,
Ilaria Castellani:
Typing noninterference for reactive programs.
J. Log. Algebr. Program. 72(2): 124-156 (2007) |
| 2006 |
|---|
| 55 | EE | Gérard Boudol:
Shared-Variable Concurrency: A Proposal.
FSTTCS 2006: 1-3 |
| 54 | EE | Roberto M. Amadio,
Gérard Boudol,
Frédéric Boussinot,
Ilaria Castellani:
Reactive Concurrent Programming Revisited.
Electr. Notes Theor. Comput. Sci. 162: 49-60 (2006) |
| 2005 |
|---|
| 53 | EE | Ana Almeida Matos,
Gérard Boudol:
On Declassification and the Non-Disclosure Policy.
CSFW 2005: 226-240 |
| 52 | EE | Gérard Boudol:
On Typing Information Flow.
ICTAC 2005: 366-380 |
| 51 | EE | Roberto M. Amadio,
Gérard Boudol,
Ilaria Castellani,
Frédéric Boussinot:
Reactive concurrent programming revisited
CoRR abs/cs/0512058: (2005) |
| 50 | EE | Gérard Boudol,
Pascal Zimmer:
On Type Inference in the Intersection Type Discipline.
Electr. Notes Theor. Comput. Sci. 136: 23-42 (2005) |
| 2004 |
|---|
| 49 | EE | Gérard Boudol:
A Reactive Programming Model for Global Computing.
COORDINATION 2004: 1 |
| 48 | EE | Gérard Boudol:
ULM: A Core Programming Model for Global Computing: (Extended Abstract).
ESOP 2004: 234-248 |
| 47 | EE | Gérard Boudol:
A Generic Membrane Model (Note).
Global Computing 2004: 208-222 |
| 46 | EE | Gérard Boudol:
The recursive record semantics of objects revisited.
J. Funct. Program. 14(3): 263-315 (2004) |
| 2003 |
|---|
| 45 | EE | Gérard Boudol:
On Programming Models for Mobility.
ICTCS 2003: 22 |
| 44 | EE | Gérard Boudol:
On Strong Normalization in the Intersection Type Discipline.
TLCA 2003: 60-74 |
| 43 | EE | Roberto M. Amadio,
Gérard Boudol,
Cédric Lhoussaine:
The receptive distributed pi-calculus.
ACM Trans. Program. Lang. Syst. 25(5): 549-577 (2003) |
| 2002 |
|---|
| 42 | | Gérard Boudol,
Pascal Zimmer:
Recursion in the call-by-value lambda-calculus.
FICS 2002: 61-66 |
| 41 | EE | Roberto M. Amadio,
Gérard Boudol,
Cédric Lhoussaine:
On message deliverability and non-uniform receptivity.
Fundam. Inform. 53(2): 105-129 (2002) |
| 40 | EE | Gérard Boudol,
Ilaria Castellani:
Noninterference for concurrent programs and thread systems.
Theor. Comput. Sci. 281(1-2): 109-130 (2002) |
| 2001 |
|---|
| 39 | EE | Gérard Boudol:
The Recursive Record Semantics of Objects Revisited.
ESOP 2001: 269-283 |
| 38 | EE | Gérard Boudol,
Ilaria Castellani:
Noninterference for Concurrent Programs.
ICALP 2001: 382-395 |
| 2000 |
|---|
| 37 | | Gérard Boudol,
Cosimo Laneve:
lambda-calculus, multiplicities, and the pi-calculus.
Proof, Language, and Interaction 2000: 659-690 |
| 36 | EE | Gérard Boudol:
On the semantics of the call-by-name CPS transform.
Theor. Comput. Sci. 234(1-2): 309-321 (2000) |
| 1999 |
|---|
| 35 | EE | Gérard Boudol,
Silvano Dal-Zilio:
An Interpretation of Extensible Objects.
FCT 1999: 148-160 |
| 34 | EE | Roberto M. Amadio,
Gérard Boudol,
Cédric Lhoussaine:
The Receptive Distributed pi-Calculus (Extended Abstract).
FSTTCS 1999: 304-315 |
| 33 | | Gérard Boudol,
Pierre-Louis Curien,
Carolina Lavatelli:
A semantics for lambda calculi with resources.
Mathematical Structures in Computer Science 9(4): 437-482 (1999) |
| 1998 |
|---|
| 32 | | Gérard Boudol:
The p-Calculus in Direct Style.
Higher-Order and Symbolic Computation 11(2): 177-208 (1998) |
| 1997 |
|---|
| 31 | | Gérard Boudol:
Typing the Use of Resources in a Concurrent Calculus (Extended Abstract).
ASIAN 1997: 239-253 |
| 30 | EE | Gérard Boudol:
The Pi-calculus in Direct Style.
POPL 1997: 228-241 |
| 1996 |
|---|
| 29 | | Gérard Boudol,
Carolina Lavatelli:
Full Abstraction for Lambda Calculus with Resources and Convergence Testing.
CAAP 1996: 302-316 |
| 28 | | Gérard Boudol,
Cosimo Laneve:
The Discriminating Power of Multiplicities in the Lambda-Calculus.
Inf. Comput. 126(1): 83-102 (1996) |
| 1995 |
|---|
| 27 | EE | Gérard Boudol,
Cosimo Laneve:
Termination, deadlock and divergence in the lambda-calculus with multiplicities.
Electr. Notes Theor. Comput. Sci. 1: (1995) |
| 1994 |
|---|
| 26 | | Gérard Boudol,
Ilaria Castellani,
Matthew Hennessy,
Astrid Kiehn:
A Theory of Processes with Localities.
Formal Asp. Comput. 6(2): 165-200 (1994) |
| 25 | | Gérard Boudol:
Lambda-Calculi for (Strict) Parallel Functions
Inf. Comput. 108(1): 51-127 (1994) |
| 24 | | Gérard Boudol,
Ilaria Castellani:
Flow Models of Distributed Computations: Three Equivalent Semantics for CCS
Inf. Comput. 114(2): 247-314 (1994) |
| 1993 |
|---|
| 23 | | Gérard Boudol:
The Lambda-Calculus with Multiplicities (Abstract).
CONCUR 1993: 1-6 |
| 22 | | Gérard Boudol:
Some Chemical Abstract Machines.
REX School/Symposium 1993: 92-123 |
| 21 | | Gérard Boudol,
Ilaria Castellani,
Matthew Hennessy,
Astrid Kiehn:
Observing Localities.
Theor. Comput. Sci. 114(1): 31-61 (1993) |
| 1992 |
|---|
| 20 | | Gérard Boudol,
Ilaria Castellani,
Matthew Hennessy,
Astrid Kiehn:
A Theory of Process with Localities (Extended Abstract).
CONCUR 1992: 108-122 |
| 19 | | Gérard Boudol,
Kim Guldstrand Larsen:
Graphical Versus Logical Specifications.
Theor. Comput. Sci. 106(1): 3-20 (1992) |
| 18 | | Gérard Berry,
Gérard Boudol:
The Chemical Abstract Machine.
Theor. Comput. Sci. 96(1): 217-248 (1992) |
| 1991 |
|---|
| 17 | | Gérard Boudol,
Ilaria Castellani,
Matthew Hennessy,
Astrid Kiehn:
Observing Localities (Extended Abstract).
MFCS 1991: 93-102 |
| 1990 |
|---|
| 16 | | Gérard Boudol,
Kim Guldstrand Larsen:
Graphical versus Logical Specifications.
CAAP 1990: 57-71 |
| 15 | | Gérard Berry,
Gérard Boudol:
The Chemical Abstract Machine.
POPL 1990: 81-94 |
| 14 | | Gérard Boudol:
Flow Event Structures and Flow Nets.
Semantics of Systems of Concurrent Processes 1990: 62-95 |
| 13 | | Gérard Boudol,
Ilaria Castellani:
Three Equivalent Semantics for CCS.
Semantics of Systems of Concurrent Processes 1990: 96-141 |
| 1989 |
|---|
| 12 | | Gérard Boudol,
Valérie Roy,
Robert de Simone,
Didier Vergamini:
Process Calculi, from Theory to Practice: Verification Tools.
Automatic Verification Methods for Finite State Systems 1989: 1-10 |
| 11 | | Gérard Boudol:
Towards a Lambda-Calculus for Concurrent and Communicating Systems.
TAPSOFT, Vol.1 1989: 149-161 |
| 10 | | Gérard Boudol:
Atomic actions.
Bulletin of the EATCS 38: 136-144 (1989) |
| 1988 |
|---|
| 9 | | Gérard Boudol,
Ilaria Castellani:
Permutation of transitions: An event structure semantics for CCS and SCCS.
REX Workshop 1988: 411-427 |
| 8 | | Gérard Boudol,
Ilaria Castellani:
Concurrency and Atomicity.
Theor. Comput. Sci. 59: 25-84 (1988) |
| 1987 |
|---|
| 7 | | Gérard Boudol,
Ilaria Castellani:
On the Semantics of Concurrency: Partial Orders and Transition Systems.
TAPSOFT, Vol.1 1987: 123-137 |
| 1985 |
|---|
| 6 | | Gérard Boudol,
Gérard Roucairol,
Robert de Simone:
Petri nets and algebraic calculi of processes.
Applications and Theory in Petri Nets 1985: 41-58 |
| 5 | | Gérard Boudol,
Gérard Roucairol,
Robert de Simone:
Petri Nets and Algebraic Calculi of Processes.
STACS 1985: 59-70 |
| 1984 |
|---|
| 4 | | Didier Austry,
Gérard Boudol:
Algèbre de Processus et Synchronisation.
Theor. Comput. Sci. 30: 91-131 (1984) |
| 1983 |
|---|
| 3 | | Gérard Boudol,
Laurent Kott:
Recursion Induction Principle Revisited.
Theor. Comput. Sci. 22: 135-173 (1983) |
| 1981 |
|---|
| 2 | | Gérard Boudol:
Une Semantique Pour Les Arbres Non Deterministes.
CAAP 1981: 147-161 |
| 1979 |
|---|
| 1 | | Gérard Boudol:
A new Recursion Induction Principle.
Theoretical Computer Science 1979: 79-90 |
