Abstract-Formal process languages inheriting the concurrency and communication features of process algebras are convenient formalisms to model distributed applications, especially when they are equipped with formal verification tools (e.g., modelcheckers) to help hunting for bugs early in the development process. However, even starting from a fully verified formal model, bugs are likely to be introduced while translating (generally by hand) the concurrent model -which relies on high-level and expressive communication primitives-into the distributed implementation -which often relies on low-level communication primitives. In this paper, we present DLC, a compiler that enables distributed code to be generated from models written in a formal p...
Part 6: Session 5: Model CheckingInternational audienceDistributed systems are hard to design, and f...
International audienceThe verification of distributed algorithms is a challenge for formal technique...
A promising new application domain for coordination languages is expressing interaction protocols am...
International audienceFormal process languages inheriting the concurrency and communication features...
International audienceFormal process languages inheriting the concurrency and communication features...
International audienceFormal methods can verify the correctness of a concurrentsystem by analyzing i...
International audienceThe verification of distributed algorithms is a challenge for formal technique...
Abstract. Cadp (Construction and Analysis of Dis-tributed Processes) is a comprehensive software too...
Since 2001, in the Oasis team, I have developed research on the semantics of applications based on d...
International audienceAsynchronous concurrency is becoming increasingly present in a large spectrum ...
Distributed protocols, typically expressed as stateful agents communicating asynchronously over buff...
We present a new approach, certified program models, to establish correctness of distributed protoco...
International audienceCADP (Construction and Analysis of Distributed Processes) is a comprehensive s...
Abstract — This paper presents how we use LfP, a formal-based, Object Oriented notation dedicated to...
International audienceCADP (Construction and Analysis of Distributed Processes) is a comprehensive s...
Part 6: Session 5: Model CheckingInternational audienceDistributed systems are hard to design, and f...
International audienceThe verification of distributed algorithms is a challenge for formal technique...
A promising new application domain for coordination languages is expressing interaction protocols am...
International audienceFormal process languages inheriting the concurrency and communication features...
International audienceFormal process languages inheriting the concurrency and communication features...
International audienceFormal methods can verify the correctness of a concurrentsystem by analyzing i...
International audienceThe verification of distributed algorithms is a challenge for formal technique...
Abstract. Cadp (Construction and Analysis of Dis-tributed Processes) is a comprehensive software too...
Since 2001, in the Oasis team, I have developed research on the semantics of applications based on d...
International audienceAsynchronous concurrency is becoming increasingly present in a large spectrum ...
Distributed protocols, typically expressed as stateful agents communicating asynchronously over buff...
We present a new approach, certified program models, to establish correctness of distributed protoco...
International audienceCADP (Construction and Analysis of Distributed Processes) is a comprehensive s...
Abstract — This paper presents how we use LfP, a formal-based, Object Oriented notation dedicated to...
International audienceCADP (Construction and Analysis of Distributed Processes) is a comprehensive s...
Part 6: Session 5: Model CheckingInternational audienceDistributed systems are hard to design, and f...
International audienceThe verification of distributed algorithms is a challenge for formal technique...
A promising new application domain for coordination languages is expressing interaction protocols am...