Objective
Experience shows that the verification of realistic systems cannot be achieved without applying a tight combination of several approaches and analysis techniques. We are convinced that the next generation validation tools should be built by embedding several specialized tools in a single framework. These tools should apply complementary approaches and be able to communicate and cooperate easily. The goal of our project is to produce such a framework. Our approach consists of a combination of powerful abstraction techniques, and efficient validation procedures based on reach ability analysis of finite and infinite-state systems. These techniques are embedded in a common formal framework based on the model of extended automata, i.e. automata with data structures. All usual models like timed automata, counter automata, Petri nets, unbounded FIFO-channel automata, automata with unbounded arrays (relevant for modelling unbounded networks and networks of mobile processes), etc, are particular instances of this general model. Our validation environment will be built from several tools (for abstraction, symbolic analysis, etc) dealing with extended automata. The connections between the different tools will be made through a common format for the description of extended automata. We have already a definition of such a format. In order to make our validation framework effectively usable, we will connect it to a specification environment for SDL. Our framework will be experimented and evaluated on industrial scale case studies: the PGM protocol (Pragmatic General Multicast) and the SIP (Session Initiation Protocol). Experience shows that the verification of realistic systems cannot be achieved without applying a tight combination of several approaches and analysis techniques. We are convinced that the next generation validation tools should be built by embedding several specialized tools in a single framework. These tools should apply complementary approaches and be able to communicate and cooperate easily. The goal of our project is to produce such a framework. Our approach consists of a combination of powerful abstraction techniques, and efficient validation procedures based on reach ability analysis of finite and infinite-state systems. These techniques are embedded in a common formal framework based on the model of extended automata, i.e. automata with data structures. All usual models like timed automata, counter automata, Petri nets, unbounded FIFO-channel automata, automata with unbounded arrays (relevant for modelling unbounded networks and networks of mobile processes), etc, are particular instances of this general model. Our validation environment will be built from several tools (for abstraction, symbolic analysis, etc) dealing with extended automata. The connections between the different tools will be made through a common format for the description of extended automata. We have already a definition of such a format. In order to make our validation framework effectively usable, we will connect it to a specification environment for SDL.
Our framework will be experimented and evaluated on industrial scale case studies: the PGM protocol (Pragmatic General Multicast) and the SIP (Session Initiation Protocol).
DESCRIPTION OF WORK
The main outcome of the project will be the production of a novel validation environment including:
- Abstraction tools for automatic construction of abstract models,
- Symbolic reachability analysis procedures for various infinite-state extended automata,
- Efficient state-space explorers based on symbolic and partial-order techniques.
Topic(s)
Call for proposal
Data not availableFunding Scheme
CSC - Cost-sharing contractsCoordinator
75251 PARIS CEDEX 05
France