The Complexity of Reachability Problems for Flat Counter Machines with Periodic Loops - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2014

The Complexity of Reachability Problems for Flat Counter Machines with Periodic Loops

Marius Bozga
Radu Iosif
  • Fonction : Auteur

Résumé

This paper proves the NP-completeness of the reachability problem for the class of flat counter machines with difference bounds and, more generally, octagonal relations, labeling the transitions on the loops. The proof is based on the fact that the sequence of powers {R n } ∞ n=0 of such relations can be encoded as a periodic sequence of matrices, and that both the prefix and the period of this sequence are simply exponential in the size of the binary representation of a relation R. This result allows to characterize the complexity of the reachability problem for one of the most studied class of counter machines [6, 10], and has a potential impact on other problems in program verification.
Fichier principal
Vignette du fichier
1307.5321v5.pdf (724.64 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-01418891 , version 1 (30-12-2016)

Licence

Domaine public

Identifiants

  • HAL Id : hal-01418891 , version 1

Citer

Marius Bozga, Radu Iosif, Filip Konečny. The Complexity of Reachability Problems for Flat Counter Machines with Periodic Loops. 15th International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI) , Jan 2014, San Diego, CA, United States. ⟨hal-01418891⟩
194 Consultations
31 Téléchargements

Partager

Gmail Facebook X LinkedIn More