Systèmes de transitions symboliques et hiérarchiques pour la conception et la validation de modèles B raffinés

Abstract : This thesis presents a new approach to help in the design and development of B models. This approach is based on the construction of a symbolic labeled transition system which describes the models behaviors. This description completes the data oriented description provided by the B model. It can also be used to document it or to validate it. The transition system is constructed from a user-defined data space on which transition relation is computed by solving proof obligations. We also propose to take into account the B refinement process by introducing some hierarchy in the transition systems. This representation allows exhibiting the link between data from several refinement levels. Moreover, the proposed method works by partitioning the states space of the more abstract description. This makes it possible to keep the abstract system global structure. Finally, the manuscript ends with a description of the GénéSyst tool, which implements the proposed method. We describe its use in the framework of the GECCOO project, in order to verify some security properties.
Document type :
Theses
Complete list of metadatas

Cited literature [171 references]  Display  Hide  Download

https://tel.archives-ouvertes.fr/tel-00216026
Contributor : Nicolas Stouls <>
Submitted on : Thursday, January 24, 2008 - 12:03:47 PM
Last modification on : Friday, October 25, 2019 - 1:25:36 AM
Long-term archiving on : Thursday, April 15, 2010 - 4:07:19 PM

Identifiers

  • HAL Id : tel-00216026, version 1

Collections

LIG | UGA

Citation

Nicolas Stouls. Systèmes de transitions symboliques et hiérarchiques pour la conception et la validation de modèles B raffinés. Génie logiciel [cs.SE]. Institut National Polytechnique de Grenoble - INPG, 2007. Français. ⟨tel-00216026⟩

Share

Metrics

Record views

326

Files downloads

1545