Laurent Mounier

Learn More
It is widely recognised that the automated validation of complex systems can hardly be achieved without tool integration. The development of the IF-1.0 toolbox [3] has been initiated several years ago, in order to provide an open validation platform for timed asynchronous systems (such as telecommunication protocols or distributed applications, in general).(More)
The design of distributed systems is an increasingly complex task, yet competitiveness requires faster developments. Formal Description Techniques (FDT) are a way to deal with this requirement, as they come with tools allowing us to simulate and verify the behavior of a system without actually having to execute it, thus translating part of the costly(More)
This paper presents the tools ALDEBARAN, CESAR, CESAR.ADT and CLEOPATRE which constitute a tool- box for compiling and verifying LOTOS programs. The principles of these tools are described, as well as their performances and limitations. Finally, the formal verification of the ret/REL atomic multicast protocol is given as an example to illustrate the(More)
This paper presents a framework for confirming deadlock potentials detected by runtime analysis of a single run of a multi-threaded program. The multi-threaded program under examination is instrumented to emit lock and unlock events. When the instrumented program is executed, a trace is generated consisting of the lock and unlock operations performed during(More)
Marius Bozga, Jean-Claude Fernandez, Constantin Lucian Ghirvu, Susanne Graf, Jean Pierre Krimm, et al.. IF: An intermediate Representation and Validation Environment for Timed Asynchronous Systems. Wing, Jeannette M.; Woodcook, Jim; Davies, Jim. FM’99 Formal Methods World Congress on Formal Methods in the Developement of Computing Systems, Sep 1999,(More)
This paper describes a decision procedure for bisimulation-based equivalence relations between labeled transition systems. The algorithm usually performed in order to verify bisimulation consists in refining some initial equivalence relation until it becomes compatible with the transition relation under consideration. However, this method requires to store(More)
The analysis of programs by the exhaustive inspection of reachable states in a nite state graph is a well-understood procedure It is actually implemented in several industrial tools but one of their main limitations is the size of the memory needed to exhaustively build the state graphs of the programs. For numerous properties such as B uchi acceptance (in(More)