A Modular Approach for Reusing Formalisms in Verification Tools of Concurrent Systems

Abstract : Over the past two decades, numerous verification tools have been successfully used for verifying complex concurrent systems, modelled using various formalisms. However, it is still hard to coordinate these tools since they rely on such a large number of formalisms. Having a proper syntactical mechanism to interrelate them through variability would increase the capability of effective integrated formal methods. In this paper, we propose a modular approach for defining new formalisms by reusing existing ones and adding new features and/or constraints. Our approach relies on standard XML technologies; their use provides the capability of rapidly and automatically obtaining tools for representing and validating models. It thus enables fast iterations in developing and testing complex formalisms. As a case study, we applied our modular definition approach on families of Petri nets and timed automata.
Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00926126
Contributor : Benedikt Bollig <>
Submitted on : Thursday, January 9, 2014 - 10:30:13 AM
Last modification on : Thursday, March 21, 2019 - 2:44:29 PM

Links full text

Identifiers

Citation

Étienne André, Benoît Barbot, Clément Démoulins, Lom Messan Hillah, Francis Hulin-Hubard, et al.. A Modular Approach for Reusing Formalisms in Verification Tools of Concurrent Systems. 15th International Conference on Formal Engineering Methods (ICFEM'13), Oct 2013, Queenstown, New Zealand. pp.199-214, ⟨10.1007/978-3-642-41202-8_14⟩. ⟨hal-00926126⟩

Share

Metrics

Record views

361