-
An overview of CADP 2001
CADP is a toolbox for specifying and verifying asynchronous finite-state systems described using process algebraic languages. It offers a wide range of... -
Typing Noninterference for Reactive Programs
We propose a type system to enforce the security property of noninterference in a core reactive language, obtained by extending the imperative language of Volpano,... -
Behavioural Theory for Mobile Ambients
We study a behavioural theory of Cardelli and Gordon's Mobile Ambients, a process calculus for modelling mobile agents in wide-area networks, focussing on reduction... -
CAESAR_SOLVE: A Generic Library for On-the-Fly Resolution of Alternation-Free...
Boolean Equation Systems (BESs) provide a useful framework for modeling various verification problems on finite-state concurrent systems, such as equivalence checking... -
Modélisation et analyse de systèmes asynchrones avec CADP
La conception des systèmes industriels critiques comportant du parallélisme asynchrone nécessite l'utilisation de méthodes formelles, assistées par des outils de... -
Static analysis of numerical properties in the presence of pointers
The fast and furious pace of change in computing technology has become an article of faith for many. The reliability of computer-based systems cru- cially depends on... -
Action Emulation Between Canonical Models
International audience -
Towards a safe and secure synchronous language
This thesis proposes a new approach to parallelism and concurrency, laying the basis for the design of a programming language with a clear and simple formal semantics,... -
A syntactic congruence for languages of birooted trees
International audience -
Bisimulations up-to: beyond first-order transition systems
International audience
