From Symbolic Verification To Domain Specific Languages

De la vérification Symbolique aux langages dédiés à un domaine

Yann Thierry Mieg (1)

1 MoVe - Modélisation et Vérification

This talk will present our experience in building data structures, algorithms, languages and tools to enable symbolic model-checking of specifications expressed in a variety of formalisms. The data structures use symbolic representations of large sets of states and of transition relations to face the challenge of state space explosion, inherent to model-checking. The algorithms exploit such symbolic representations to verify complex behavioral properties of a system, expressed using temporal logic. We leverage model-driven engineering and model transformations to propose a simple yet expressive intermediate language to express the semantics of concurrent systems. The tools freely available at offer both a user friendly front-end and an efficient back-end solver. They support analysis of diverse formalisms designed for modeling of concurrent and real-time systems.

Mots clés: Symbolic Verification; Model-Checking

Mots clés: Vérification Formelle

Domaines: Théorie et langage formel [cs.FL]; Génie logiciel [cs.SE]; Informatique et langage [cs.CL]; Algorithme et structure de données [cs.DS]; Performance et fiabilité [cs.PF]

Yann Thierry Mieg. From Symbolic Verification To Domain Specific Languages. Formal Languages and Automata Theory [cs.FL]. Sorbonne Université UPMC; Laboratoire d'informatique de Paris 6 [LIP6], 2016. ⟨tel-02104341⟩