Equivalence Between Model-Checking Flat Counter Systems and Presburger Arithmetic

Stéphane Demri, Amit Kumar Dhar, Arnaud Sangnier. Equivalence Between Model-Checking Flat Counter Systems and Presburger Arithmetic. In Joël Ouaknine, Igor Potapov, James Worrell, editors, Reachability Problems - 8th International Workshop, RP 2014, Oxford, UK, September 22-24, 2014. Proceedings. Volume 8762 of Lecture Notes in Computer Science, pages 85-97, Springer, 2014. [doi]

@inproceedings{DemriDS14,
  title = {Equivalence Between Model-Checking Flat Counter Systems and Presburger Arithmetic},
  author = {Stéphane Demri and Amit Kumar Dhar and Arnaud Sangnier},
  year = {2014},
  doi = {10.1007/978-3-319-11439-2_7},
  url = {http://dx.doi.org/10.1007/978-3-319-11439-2_7},
  researchr = {https://researchr.org/publication/DemriDS14},
  cites = {0},
  citedby = {0},
  pages = {85-97},
  booktitle = {Reachability Problems - 8th International Workshop, RP 2014, Oxford, UK, September 22-24, 2014. Proceedings},
  editor = {Joël Ouaknine and Igor Potapov and James Worrell},
  volume = {8762},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-319-11438-5},
}