Emmanuel Beffara

According to our database1, Emmanuel Beffara authored at least 15 papers between 2001 and 2023.

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

2023
Concurrent Realizability on Conjunctive Structures.
Proceedings of the 8th International Conference on Formal Structures for Computation and Deduction, 2023

2021
Concurrent Realizability on Conjunctive Structures.
CoRR, 2021

2018
Order algebras: a quantitative model of interaction.
Math. Struct. Comput. Sci., 2018

2015
Unifying type systems for mobile processes.
CoRR, 2015

2014
A logical view on scheduling in concurrency.
Proceedings of the Proceedings Fifth International Workshop on Classical Logic and Computation, 2014

2012
Proofs as Executions.
Proceedings of the Theoretical Computer Science, 2012

2011
Functions as proofs as processes
CoRR, 2011

2009
Linear combinations of orders
CoRR, 2009

Quantitative testing semantics for non-interleaving
CoRR, 2009

2008
An Algebraic Process Calculus.
Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, 2008

2005
Logique, Réalisabilité et Concurrence. (Logic, Realisability and Concurrency).
PhD thesis, 2005

A Concurrent Model for Linear Logic.
Proceedings of the 21st Annual Conference on Mathematical Foundations of Programming Semantics, 2005

2004
Concurrent Nets: A Study of Prefixing in Process Calculi.
Proceedings of the 11th International Workshop on Expressiveness in Concurrency, 2004

2003
Disjunctive normal forms and local exceptions.
Proceedings of the Eighth ACM SIGPLAN International Conference on Functional Programming, 2003

2001
Verification of Timed Automata Using Rewrite Rules and Strategies
CoRR, 2001


  Loading...