Automatic Controller Generation
We have developed a software tool chain to allow the specification of models, the controller synthesis, and the execution or simulation of the results. It is based on existing synchronous tools, and thus consists primarily in the use and integration of Sigali (http://www.irisa.fr/vertecs/Logiciels/sigali.html )and of Mode Automata (http://www-verimag.imag.fr ).
Useful component templates and relevant properties can be materialized, on one hand by libraries of task models, and, on the other hand, by properties and synthesis objectives. A prototype compiler has been developed to demonstrate a domain-specific language, named Nemo , for multi-task controllers (see Section 6.3 ).
Participant : B. Jeannet [ contact ] .
Rapture   is a verification tool that was developed jointly by BRICS (Denmark) and Inria in years 2000–2002. The tool is designed to verify reachability properties on Markov Decision Processes (MDP), also known as Probabilistic Transition Systems. This model can be viewed both as an extension to classical (finite-state) transition systems extended with probability distributions on successor states, or as an extension of Markov Chains with non-determinism. We have developed a simple automata language that allows to describe a set of processes communicating over a set of channels à la CSP. Processes can also manipulate local and global variables of finite type. Probabilistic reachability properties are specified by defining two sets of initial and final states together with a probability bound. The originality of the tool is to provide two reduction techniques that limit the state space explosion problem: automatic abstraction and refinement algorithms, and the so-called essential states reduction.
Libraries for Abstract Interpretation
Participant : B. Jeannet [ contact person ] .
We also develop and maintain smaller libraries of general use for people working in the static analysis and abstract interpretation community.
(http://bjeannet.gforge.inria.fr/fixpoint ): a generic fix-point engine written in OCaml . It allows to solve systems of fix-point equations on a lattice, using a parameterized strategy for the iteration order and the application of widening. It also implements very recent techniques  .
(http://bjeannet.gforge.inria.fr/interproc ): a simple interprocedural static analyzer that infers properties on the numerical variables of programs in a toy language. It is aimed at demonstrating the use of the previous library and the above-described APRON library, and more generally at disseminating the knowledge in abstract interpretation. It is also deployed through a web-interface: (http://pop-art.inrialpes.fr/interproc/interprocweb.cgi ).