Verifying temporal relational models with Pardinus - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2023

Verifying temporal relational models with Pardinus

Résumé

This short paper summarizes an article published in the Journal of Automated Reasoning. It presents Pardinus, an extension of the popular Kodkod relational model finder with linear temporal logic (including past operators) to simplify the analysis of dynamic systems. Pardinus includes a SAT-based bounded model checking engine and an SMV-based complete model checking engine, both allowing iteration through the different instances (or counterexamples) of a specification. It also supports a decomposed parallel analysis strategy that improves the efficiency of both analysis engines on commodity multi-core machines.
Fichier non déposé

Dates et versions

hal-04074866 , version 1 (19-04-2023)

Identifiants

  • HAL Id : hal-04074866 , version 1

Citer

Julien Brunel, David Chemouil, Alcino Cunha, Nuno Macedo. Verifying temporal relational models with Pardinus. 9th international conference on rigorous state-based methods, May 2023, Nancy, France. ⟨hal-04074866⟩

Collections

ONERA
14 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More