Utilisateur·rice

Emmanuel • Beffara
Maître de Conférences (MCF H) • Affiliation : Aix-Marseille Université (AMU)
Site : Luminy • Office : 234 • Office Floor : 2 •

...

User group(s) :

Research keywords :
    Pi-calculus Vrification Automates temporiss Timed automata Rewriting theory Semantics Rcriture

Publications HAL

2018/11 - Les abstractions informatiques peuvent-elles concrétiser les mathématiques?

2018/10 - Une analyse des exercices d’algorithmique et de programmation du brevet 2017

2018/08 Mathematical Structures in Computer Science - Order algebras: a quantitative model of interaction

2015/04 - Unifying type systems for mobile processes

2014/07 Electronic Proceedings in Theoretical Computer Science - A proof-theoretic view on scheduling in concurrency

2013/08 - Introduction to linear logic

2012/09 - Proofs as Executions

2010/02 - Concurrent processes as wireless proof nets

2009/01 - Quantitative testing semantics for non-interleaving

2008/06 - An algebraic process calculus

2007/01 - Functions as proofs as processes

2006/05 Theoretical Computer Science - Concurrent nets: a study of prefixing in process calculi

2006/01 - A concurrent model for linear logic

2005/12 - Logique, Réalisabilité et Concurrence

2004/01 - Concurrent nets: a study of prefixing in process calculi

2003/03 - Realizability with constants

2003/01 - Disjunctive normal forms and local exceptions

2001/06 - Verification of Timed Automata Using Rewrite Rules and Strategies

2001/06 - Verification of Timed Automata Using Rewrite Rules and Strategies


Retour en haut 

Secured By miniOrange