Reasoning about reversal-bounded counter machines - Archive ouverte HAL Accéder directement au contenu
Chapitre D'ouvrage Année : 2018

Reasoning about reversal-bounded counter machines

Résumé

In this paper, we present a short survey on reversal-bounded counter machines. It focuses on the main techniques for model-checking such counter machines with specifications expressed with formulae from some linear-time temporal logic. All the decision procedures are designed by translation into Presburger arithmetic. We provide a proof that is alternative to Ibarra's original one for showing that reachability sets are effectively definable in Presburger arithmetic. Extensions to repeated control state reachability and to additional temporal properties are discussed in the paper. The article is written to the honor of Professor Ewa Orłowska and focuses on several topics that are developped in her works.
Fichier principal
Vignette du fichier
SD-EORM.pdf (455.05 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02366668 , version 1 (16-11-2019)

Identifiants

Citer

Stephane Demri. Reasoning about reversal-bounded counter machines. Ewa Orlowska on Relational Methods in Logic and Computer Science, volume 17 of Outstanding Contributions to Logic, Springer, 2018., pp.441--479, 2018, ⟨10.1007/978-3-319-97879-6_17⟩. ⟨hal-02366668⟩
114 Consultations
94 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More