From Symbolic Verification To Domain Specific Languages - TEL - Thèses en ligne Access content directly
Habilitation À Diriger Des Recherches Year : 2016

From Symbolic Verification To Domain Specific Languages

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

Yann Thierry Mieg

Abstract

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.
Fichier principal
Vignette du fichier
hdr-ytm.pdf (2.23 Mo) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

tel-02104341 , version 1 (19-04-2019)

Identifiers

  • HAL Id : tel-02104341 , version 1

Cite

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⟩
95 View
89 Download

Share

Gmail Facebook X LinkedIn More