Towards a model-checker for counter systems - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2006

Towards a model-checker for counter systems

Résumé

This paper deals with model-checking of fragments and extensions of CTL on infinite-state Presburger counter systems, where the states are vectors of integers and the transitions are determined by means of relations definable within Presburger arithmetic. We have identified a natural class of admissible counter systems (ACS) for which we show that the quantification over paths in CTL can be simulated by quantification over tuples of natural numbers, eventually allowing translation of the whole Presburger-CTL into Presburger arithmetic, thereby enabling effective model checking. We have provided evidence that our results are close to optimal with respect to the class of counter systems described above. Finally, we design a complete semi-algorithm to verify first-order LTL properties over trace-flattable counter systems, extending the previous underlying FAST semi-algorithm to verify reachability questions over flattable counter systems.
Fichier principal
Vignette du fichier
DDFG-atva06.pdf (204.88 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03203578 , version 1 (20-04-2021)

Identifiants

Citer

Stéphane Demri, Alain Finkel, Valentin Goranko, Govert van Drimmelen. Towards a model-checker for counter systems. ATVA 2006 - 4th International Symposium on Automated Technology for Verification and Analysis, Susanne Graf; Wenhui Zhang, Oct 2006, Beijing, China. pp.493-507, ⟨10.1007/11901914_36⟩. ⟨hal-03203578⟩
31 Consultations
31 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More