Gérard Boudol

71 papers A* 4A 5B 6C 4Journal 25Unranked 27
YearRankTypeTitle / Venue / Authors
2015 C conf
Jthread, a deadlock-free mutex library.
PPDP
Johan Grande, Gérard Boudol, Manuel Serrano
2012 J jnl
Reasoning about Web Applications: An Operational Semantics for HOP.
ACM Trans. Program. Lang. Syst.
Gérard Boudol, Zhengqin Luo, Tamara Rezk, Manuel Serrano
2012 — conf
Relaxed Operational Semantics of Concurrent Programming Languages
EXPRESS/SOS
Gérard Boudol, Gustavo Petri, Bernard P. Serpette
2010 A conf
A Theory of Speculative Computation.
ESOP
Gérard Boudol, Gustavo Petri
2010 J jnl
Typing termination in a higher-order concurrent imperative language.
Inf. Comput.
Gérard Boudol
2009 C conf
A Deadlock-Free Semantics for Shared Memory Concurrency.
ICTAC
Gérard Boudol
2009 J jnl
On declassification and the non-disclosure policy.
J. Comput. Secur.
Ana Almeida Matos, Gérard Boudol
2009 A* conf
Relaxed memory models: an operational approach.
POPL
Gérard Boudol, Gustavo Petri
2008 J jnl
On strong normalization and type inference in the intersection type discipline.
Theor. Comput. Sci.
Gérard Boudol
2008 — conf
Secure Information Flow as a Safety Property.
Formal Aspects in Security and Trust
Gérard Boudol
2008 — conf
Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra.
Concurrency, Graphs and Models
Gérard Boudol, Ilaria Castellani, Matthew Hennessy, Mogens Nielsen, Glynn Winskel
2008 A conf
Typing Safe Deallocation.
ESOP
Gérard Boudol
2007 B conf
Fair Cooperative Multithreading.
CONCUR
Gérard Boudol
2007 J jnl
Typing noninterference for reactive programs.
J. Log. Algebraic Methods Program.
Ana Almeida Matos, Gérard Boudol, Ilaria Castellani
2006 — conf
Shared-Variable Concurrency: A Proposal.
FSTTCS
Gérard Boudol
2005 — conf
On Declassification and the Non-Disclosure Policy.
CSFW
Ana Almeida Matos, Gérard Boudol
2005 C conf
On Typing Information Flow.
ICTAC
Gérard Boudol
2005 — conf
Reactive Concurrent Programming Revisited.
APC 25
Roberto M. Amadio, Gérard Boudol, Frédéric Boussinot, Ilaria Castellani
2005 J jnl
Reactive concurrent programming revisited
CoRR
Roberto M. Amadio, Gérard Boudol, Ilaria Castellani, Frédéric Boussinot
2004 — conf
A Generic Membrane Model (Note).
Global Computing
Gérard Boudol
2004 C conf
A Reactive Programming Model for Global Computing.
COORDINATION
Gérard Boudol
2004 — conf
On Type Inference in the Intersection Type Discipline.
ITRS
Gérard Boudol, Pascal Zimmer
2004 J jnl
The recursive record semantics of objects revisited.
J. Funct. Program.
Gérard Boudol
2004 A conf
ULM: A Core Programming Model for Global Computing: (Extended Abstract).
ESOP
Gérard Boudol
2003 — conf
On Programming Models for Mobility.
ICTCS
Gérard Boudol
2003 — conf
On Strong Normalization in the Intersection Type Discipline.
TLCA
Gérard Boudol
2003 J jnl
The receptive distributed pi-calculus.
ACM Trans. Program. Lang. Syst.
Roberto M. Amadio, Gérard Boudol, Cédric Lhoussaine
2002 J jnl
Noninterference for concurrent programs and thread systems.
Theor. Comput. Sci.
Gérard Boudol, Ilaria Castellani
2002 J jnl
On message deliverability and non-uniform receptivity.
Fundam. Informaticae
Roberto M. Amadio, Gérard Boudol, Cédric Lhoussaine
2002 — conf
Recursion in the call-by-value lambda-calculus.
FICS
Gérard Boudol, Pascal Zimmer
2001 A* conf
Noninterference for Concurrent Programs.
ICALP
Gérard Boudol, Ilaria Castellani
2001 A conf
The Recursive Record Semantics of Objects Revisited.
ESOP
Gérard Boudol
2000 J jnl
On the semantics of the call-by-name CPS transform.
Theor. Comput. Sci.
Gérard Boudol
2000 — conf
lambda-calculus, multiplicities, and the pi-calculus.
Proof, Language, and Interaction
Gérard Boudol, Cosimo Laneve
1999 J jnl
A semantics for lambda calculi with resources.
Math. Struct. Comput. Sci.
Gérard Boudol, Pierre-Louis Curien, Carolina Lavatelli
1999 B conf
An Interpretation of Extensible Objects.
FCT
Gérard Boudol, Silvano Dal-Zilio
1999 — conf
The Receptive Distributed pi-Calculus (Extended Abstract).
FSTTCS
Roberto M. Amadio, Gérard Boudol, Cédric Lhoussaine
1998 J jnl
Calculi for concurrent processes.
J. Comput. Sci. Technol.
Gérard Boudol
1998 J jnl
The p-Calculus in Direct Style.
High. Order Symb. Comput.
Gérard Boudol
1997 A* conf
The Pi-calculus in Direct Style.
POPL
Gérard Boudol
1997 — conf
Typing the Use of Resources in a Concurrent Calculus (Extended Abstract).
ASIAN
Gérard Boudol
1996 — conf
Full Abstraction for Lambda Calculus with Resources and Convergence Testing.
CAAP
Gérard Boudol, Carolina Lavatelli
1996 J jnl
The Discriminating Power of Multiplicities in the Lambda-Calculus.
Inf. Comput.
Gérard Boudol, Cosimo Laneve
1995 B conf
Termination, deadlock and divergence in the lambda-calculus with multiplicities.
MFPS
Gérard Boudol, Cosimo Laneve
1994 J jnl
A Theory of Processes with Localities.
Formal Aspects Comput.
Gérard Boudol, Ilaria Castellani, Matthew Hennessy, Astrid Kiehn
1994 J jnl
Flow Models of Distributed Computations: Three Equivalent Semantics for CCS
Inf. Comput.
Gérard Boudol, Ilaria Castellani
1994 J jnl
Lambda-Calculi for (Strict) Parallel Functions
Inf. Comput.
Gérard Boudol
1993 J jnl
Observing Localities.
Theor. Comput. Sci.
Gérard Boudol, Ilaria Castellani, Matthew Hennessy, Astrid Kiehn
1993 — conf
Some Chemical Abstract Machines.
REX School/Symposium
Gérard Boudol
1993 B conf
The Lambda-Calculus with Multiplicities (Abstract).
CONCUR
Gérard Boudol
1992 B conf
A Theory of Process with Localities (Extended Abstract).
CONCUR
Gérard Boudol, Ilaria Castellani, Matthew Hennessy, Astrid Kiehn
1992 J jnl
Graphical Versus Logical Specifications.
Theor. Comput. Sci.
Gérard Boudol, Kim Guldstrand Larsen
1992 J jnl
The Chemical Abstract Machine.
Theor. Comput. Sci.
Gérard Berry, Gérard Boudol
1991 B conf
Observing Localities (Extended Abstract).
MFCS
Gérard Boudol, Ilaria Castellani, Matthew Hennessy, Astrid Kiehn
1990 — conf
Flow Event Structures and Flow Nets.
Semantics of Systems of Concurrent Processes
Gérard Boudol
1990 — conf
Graphical versus Logical Specifications.
CAAP
Gérard Boudol, Kim Guldstrand Larsen
1990 A* conf
The Chemical Abstract Machine.
POPL
Gérard Berry, Gérard Boudol
1990 — conf
Three Equivalent Semantics for CCS.
Semantics of Systems of Concurrent Processes
Gérard Boudol, Ilaria Castellani
1989 J jnl
Atomic actions.
Bull. EATCS
Gérard Boudol
1989 — conf
Process Calculi, from Theory to Practice: Verification Tools.
Automatic Verification Methods for Finite State Systems
Gérard Boudol, Valérie Roy, Robert de Simone, Didier Vergamini
1989 — conf
Towards a Lambda-Calculus for Concurrent and Communicating Systems.
TAPSOFT, Vol.1
Gérard Boudol
1988 J jnl
Concurrency and Atomicity.
Theor. Comput. Sci.
Gérard Boudol, Ilaria Castellani
1988 — conf
Permutation of transitions: An event structure semantics for CCS and SCCS.
REX Workshop
Gérard Boudol, Ilaria Castellani
1987 — conf
On the Semantics of Concurrency: Partial Orders and Transition Systems.
TAPSOFT, Vol.1
Gérard Boudol, Ilaria Castellani
1985 A conf
Petri Nets and Algebraic Calculi of Processes.
STACS
Gérard Boudol, Gérard Roucairol, Robert de Simone
1985 — conf
Petri nets and algebraic calculi of processes.
Applications and Theory in Petri Nets
Gérard Boudol, Gérard Roucairol, Robert de Simone
1984 J jnl
Algèbre de Processus et Synchronisation.
Theor. Comput. Sci.
Didier Austry, Gérard Boudol
1984 — conf
Notes on Algebraic Calculi of Processes.
Logics and Models of Concurrent Systems
Gérard Boudol
1983 J jnl
Recursion Induction Principle Revisited.
Theor. Comput. Sci.
Gérard Boudol, Laurent Kott
1981 — conf
Une Semantique Pour Les Arbres Non Deterministes.
CAAP
Gérard Boudol
1979 — conf
A new Recursion Induction Principle.
Theoretical Computer Science
Gérard Boudol