Gérard Boudol

According to our database1, Gérard Boudol authored at least 65 papers between 1979 and 2015.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2015
Jthread, a deadlock-free mutex library.
Proceedings of the 17th International Symposium on Principles and Practice of Declarative Programming, 2015

2012
Reasoning about Web Applications: An Operational Semantics for HOP.
ACM Trans. Program. Lang. Syst., 2012

Relaxed Operational Semantics of Concurrent Programming Languages
Proceedings of the Proceedings Combined 19th International Workshop on Expressiveness in Concurrency and 9th Workshop on Structured Operational Semantics, 2012

2010
Typing termination in a higher-order concurrent imperative language.
Inf. Comput., 2010

A Theory of Speculative Computation.
Proceedings of the Programming Languages and Systems, 2010

2009
On declassification and the non-disclosure policy.
J. Comput. Secur., 2009

Relaxed memory models: an operational approach.
Proceedings of the 36th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2009

A Deadlock-Free Semantics for Shared Memory Concurrency.
Proceedings of the Theoretical Aspects of Computing, 2009

2008
On strong normalization and type inference in the intersection type discipline.
Theor. Comput. Sci., 2008

Secure Information Flow as a Safety Property.
Proceedings of the Formal Aspects in Security and Trust, 5th International Workshop, 2008

Typing Safe Deallocation.
Proceedings of the Programming Languages and Systems, 2008

Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra.
Proceedings of the Concurrency, 2008

2007
Typing noninterference for reactive programs.
J. Log. Algebraic Methods Program., 2007

Fair Cooperative Multithreading.
Proceedings of the CONCUR 2007 - Concurrency Theory, 18th International Conference, 2007

2006
Shared-Variable Concurrency: A Proposal.
Proceedings of the FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science, 2006

2005
Reactive Concurrent Programming Revisited.
Proceedings of the Workshop "Essays on Algebraic Process Calculi", 2005

On Typing Information Flow.
Proceedings of the Theoretical Aspects of Computing, 2005

2004
The recursive record semantics of objects revisited.
J. Funct. Program., 2004

On Type Inference in the Intersection Type Discipline.
Proceedings of the Third International Workshop on Intersection Types and Related Systems, 2004

A Generic Membrane Model (Note).
Proceedings of the Global Computing, IST/FET International Workshop, 2004

ULM: A Core Programming Model for Global Computing: (Extended Abstract).
Proceedings of the Programming Languages and Systems, 2004

A Reactive Programming Model for Global Computing.
Proceedings of the Coordination Models and Languages, 6th International Conference, 2004

2003
The receptive distributed pi-calculus.
ACM Trans. Program. Lang. Syst., 2003

On Strong Normalization in the Intersection Type Discipline.
Proceedings of the Typed Lambda Calculi and Applications, 6th International Conference, 2003

On Programming Models for Mobility.
Proceedings of the Theoretical Computer Science, 8th Italian Conference, 2003

2002
Noninterference for concurrent programs and thread systems.
Theor. Comput. Sci., 2002

On message deliverability and non-uniform receptivity.
Fundam. Informaticae, 2002

Recursion in the call-by-value lambda-calculus.
Proceedings of the Fixed Points in Computer Science, 2002

2001
Noninterference for Concurrent Programs.
Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

2000
On the semantics of the call-by-name CPS transform.
Theor. Comput. Sci., 2000

lambda-calculus, multiplicities, and the pi-calculus.
Proceedings of the Proof, Language, and Interaction, Essays in Honour of Robin Milner, 2000

1999
A semantics for lambda calculi with resources.
Math. Struct. Comput. Sci., 1999

The Receptive Distributed pi-Calculus (Extended Abstract).
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1999

An Interpretation of Extensible Objects.
Proceedings of the Fundamentals of Computation Theory, 12th International Symposium, 1999

1998
The p-Calculus in Direct Style.
High. Order Symb. Comput., 1998

Calculi for concurrent processes.
J. Comput. Sci. Technol., 1998

1997
The Pi-calculus in Direct Style.
Proceedings of the Conference Record of POPL'97: The 24th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1997

Typing the Use of Resources in a Concurrent Calculus (Extended Abstract).
Proceedings of the Advances in Computing Science, 1997

1996
The Discriminating Power of Multiplicities in the Lambda-Calculus.
Inf. Comput., 1996

Full Abstraction for Lambda Calculus with Resources and Convergence Testing.
Proceedings of the Trees in Algebra and Programming, 1996

1995
Termination, deadlock and divergence in the lambda-calculus with multiplicities.
Proceedings of the Eleventh Annual Conference on Mathematical Foundations of Programming Semantics, 1995

1994
Flow Models of Distributed Computations: Three Equivalent Semantics for CCS
Inf. Comput., November, 1994

Lambda-Calculi for (Strict) Parallel Functions
Inf. Comput., January, 1994

A Theory of Processes with Localities.
Formal Aspects Comput., 1994

1993
Observing Localities.
Theor. Comput. Sci., 1993

Some Chemical Abstract Machines.
Proceedings of the A Decade of Concurrency, Reflections and Perspectives, 1993

The Lambda-Calculus with Multiplicities (Abstract).
Proceedings of the CONCUR '93, 1993

1992
Graphical Versus Logical Specifications.
Theor. Comput. Sci., 1992

The Chemical Abstract Machine.
Theor. Comput. Sci., 1992

A Theory of Process with Localities (Extended Abstract).
Proceedings of the CONCUR '92, 1992

1991
Observing Localities (Extended Abstract).
Proceedings of the Mathematical Foundations of Computer Science 1991, 1991

1990
Three Equivalent Semantics for CCS.
Proceedings of the Semantics of Systems of Concurrent Processes, 1990

Flow Event Structures and Flow Nets.
Proceedings of the Semantics of Systems of Concurrent Processes, 1990

1989
Atomic actions.
Bull. EATCS, 1989

Towards a Lambda-Calculus for Concurrent and Communicating Systems.
Proceedings of the TAPSOFT'89: Proceedings of the International Joint Conference on Theory and Practice of Software Development, 1989

Process Calculi, from Theory to Practice: Verification Tools.
Proceedings of the Automatic Verification Methods for Finite State Systems, 1989

1988
Concurrency and Atomicity.
Theor. Comput. Sci., 1988

Permutation of transitions: An event structure semantics for CCS and SCCS.
Proceedings of the Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop, Noordwijkerhout, The Netherlands, May 30, 1988

1987
On the Semantics of Concurrency: Partial Orders and Transition Systems.
Proceedings of the TAPSOFT'87: Proceedings of the International Joint Conference on Theory and Practice of Software Development, 1987

1985
Petri Nets and Algebraic Calculi of Processes.
Proceedings of the STACS 85, 1985

1984
Algèbre de Processus et Synchronisation.
Theor. Comput. Sci., 1984

Notes on Algebraic Calculi of Processes.
Proceedings of the Logics and Models of Concurrent Systems, 1984

1983
Recursion Induction Principle Revisited.
Theor. Comput. Sci., 1983

1981
Une Semantique Pour Les Arbres Non Deterministes.
Proceedings of the CAAP '81, 1981

1979
A new Recursion Induction Principle.
Proceedings of the Theoretical Computer Science, 1979


  Loading...