A new Recursion Induction Principle. - Gérard Boudol (Theoretical Computer Science, 1979)

Une Semantique Pour Les Arbres Non Deterministes. - Gérard Boudol (CAAP, 1981)

Recursion Induction Principle Revisited. - Gérard Boudol; Laurent Kott (Theor. Comput. Sci., 1983)

Notes on Algebraic Calculi of Processes. - Gérard Boudol (Logics and Models of Concurrent Systems, 1984)

Algèbre de Processus et Synchronisation. - Didier Austry; Gérard Boudol (Theor. Comput. Sci., 1984)

Petri nets and algebraic calculi of processes. - Gérard Boudol; Gérard Roucairol; Robert de Simone (Applications and Theory in Petri Nets, 1985)

On the Semantics of Concurrency: Partial Orders and Transition Systems. - Gérard Boudol; Ilaria Castellani (TAPSOFT, Vol.1, 1987)

Permutation of transitions: An event structure semantics for CCS and SCCS. - Gérard Boudol; Ilaria Castellani (REX Workshop, 1988)

Concurrency and Atomicity. - Gérard Boudol; Ilaria Castellani (Theor. Comput. Sci., 1988)

Process Calculi, from Theory to Practice: Verification Tools. - Gérard Boudol; Valérie Roy; Robert de Simone; Didier Vergamini (Automatic Verification Methods for Finite State Systems, 1989)

Towards a Lambda-Calculus for Concurrent and Communicating Systems. - Gérard Boudol (TAPSOFT, Vol.1, 1989)

Atomic actions. - Gérard Boudol (Bull. EATCS, 1989)

Graphical versus Logical Specifications. - Gérard Boudol; Kim Guldstrand Larsen (CAAP, 1990)

Flow Event Structures and Flow Nets. - Gérard Boudol (Semantics of Systems of Concurrent Processes, 1990)

Three Equivalent Semantics for CCS. - Gérard Boudol; Ilaria Castellani (Semantics of Systems of Concurrent Processes, 1990)

The Chemical Abstract Machine. - Gérard Berry; Gérard Boudol (POPL, 1990)

Observing Localities (Extended Abstract). - Gérard Boudol; Ilaria Castellani; Matthew Hennessy; Astrid Kiehn (MFCS, 1991)

A Theory of Process with Localities (Extended Abstract). - Gérard Boudol; Ilaria Castellani; Matthew Hennessy; Astrid Kiehn (CONCUR, 1992)

The Lambda-Calculus with Multiplicities (Abstract). - Gérard Boudol (CONCUR, 1993)

Some Chemical Abstract Machines. - Gérard Boudol (REX School/Symposium, 1993)

Observing Localities. - Gérard Boudol; Ilaria Castellani; Matthew Hennessy; Astrid Kiehn (Theor. Comput. Sci., 1993)

A Theory of Processes with Localities. - Gérard Boudol; Ilaria Castellani; Matthew Hennessy; Astrid Kiehn (Formal Aspects Comput., 1994)

Lambda-Calculi for (Strict) Parallel Functions - Gérard Boudol (Inf. Comput., 1994)

Flow Models of Distributed Computations: Three Equivalent Semantics for CCS - Gérard Boudol; Ilaria Castellani (Inf. Comput., 1994)

Termination, deadlock and divergence in the lambda-calculus with multiplicities. - Gérard Boudol; Cosimo Laneve (MFPS, 1995)

Full Abstraction for Lambda Calculus with Resources and Convergence Testing. - Gérard Boudol; Carolina Lavatelli (CAAP, 1996)

The Discriminating Power of Multiplicities in the Lambda-Calculus. - Gérard Boudol; Cosimo Laneve (Inf. Comput., 1996)

Typing the Use of Resources in a Concurrent Calculus (Extended Abstract). - Gérard Boudol (ASIAN, 1997)

The Pi-calculus in Direct Style. - Gérard Boudol (POPL, 1997)

Calculi for concurrent processes. - Gérard Boudol (J. Comput. Sci. Technol., 1998)

The p-Calculus in Direct Style. - Gérard Boudol (High. Order Symb. Comput., 1998)

An Interpretation of Extensible Objects. - Gérard Boudol; Silvano Dal-Zilio (FCT, 1999)

The Receptive Distributed pi-Calculus (Extended Abstract). - Roberto M. Amadio; Gérard Boudol; Cédric Lhoussaine (FSTTCS, 1999)

A semantics for lambda calculi with resources. - Gérard Boudol; Pierre-Louis Curien; Carolina Lavatelli (Math. Struct. Comput. Sci., 1999)

lambda-calculus, multiplicities, and the pi-calculus. - Gérard Boudol; Cosimo Laneve (Proof, Language, and Interaction, 2000)

On the semantics of the call-by-name CPS transform. - Gérard Boudol (Theor. Comput. Sci., 2000)

The Recursive Record Semantics of Objects Revisited. - Gérard Boudol (ESOP, 2001)

Noninterference for Concurrent Programs. - Gérard Boudol; Ilaria Castellani (ICALP, 2001)

Recursion in the call-by-value lambda-calculus. - Gérard Boudol; Pascal Zimmer (FICS, 2002)

On message deliverability and non-uniform receptivity. - Roberto M. Amadio; Gérard Boudol; Cédric Lhoussaine (Fundam. Informaticae, 2002)

Noninterference for concurrent programs and thread systems. - Gérard Boudol; Ilaria Castellani (Theor. Comput. Sci., 2002)

On Programming Models for Mobility. - Gérard Boudol (ICTCS, 2003)

On Strong Normalization in the Intersection Type Discipline. - Gérard Boudol (TLCA, 2003)

The receptive distributed pi-calculus. - Roberto M. Amadio; Gérard Boudol; Cédric Lhoussaine (ACM Trans. Program. Lang. Syst., 2003)

A Reactive Programming Model for Global Computing. - Gérard Boudol (COORDINATION, 2004)

ULM: A Core Programming Model for Global Computing: (Extended Abstract). - Gérard Boudol (ESOP, 2004)

A Generic Membrane Model (Note). - Gérard Boudol (Global Computing, 2004)

On Type Inference in the Intersection Type Discipline. - Gérard Boudol; Pascal Zimmer (ITRS, 2004)

On Declassification and the Non-Disclosure Policy. - Ana Almeida Matos; Gérard Boudol (CSFW, 2005)

On Typing Information Flow. - Gérard Boudol (ICTAC, 2005)

Reactive Concurrent Programming Revisited. - Roberto M. Amadio; Gérard Boudol; Frédéric Boussinot; Ilaria Castellani (APC 25, 2005)

Shared-Variable Concurrency: A Proposal. - Gérard Boudol (FSTTCS, 2006)

Fair Cooperative Multithreading. - Gérard Boudol (CONCUR, 2007)

Typing noninterference for reactive programs. - Ana Almeida Matos; Gérard Boudol; Ilaria Castellani (J. Log. Algebraic Methods Program., 2007)

Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra. - Gérard Boudol; Ilaria Castellani; Matthew Hennessy; Mogens Nielsen; Glynn Winskel (Concurrency, Graphs and Models, 2008)

Typing Safe Deallocation. - Gérard Boudol (ESOP, 2008)

Secure Information Flow as a Safety Property. - Gérard Boudol (Formal Aspects in Security and Trust, 2008)

On strong normalization and type inference in the intersection type discipline. - Gérard Boudol (Theor. Comput. Sci., 2008)

A Deadlock-Free Semantics for Shared Memory Concurrency. - Gérard Boudol (ICTAC, 2009)

Relaxed memory models: an operational approach. - Gérard Boudol; Gustavo Petri (POPL, 2009)

A Theory of Speculative Computation. - Gérard Boudol; Gustavo Petri (ESOP, 2010)

Typing termination in a higher-order concurrent imperative language. - Gérard Boudol (Inf. Comput., 2010)

Relaxed Operational Semantics of Concurrent Programming Languages - Gérard Boudol; Gustavo Petri; Bernard P. Serpette (EXPRESS/SOS, 2012)

Reasoning about Web Applications: An Operational Semantics for HOP. - Gérard Boudol; Zhengqin Luo; Tamara Rezk; Manuel Serrano (ACM Trans. Program. Lang. Syst., 2012)

Jthread, a deadlock-free mutex library. - Johan Grande; Gérard Boudol; Manuel Serrano (PPDP, 2015)