Safety Problems Are NP-complete for Flat Integer Programs with Octagonal Loops

Marius Bozga, Radu Iosif, Filip Konecný. Safety Problems Are NP-complete for Flat Integer Programs with Octagonal Loops. In Kenneth L. McMillan, Xavier Rival, editors, Verification, Model Checking, and Abstract Interpretation - 15th International Conference, VMCAI 2014, San Diego, CA, USA, January 19-21, 2014, Proceedings. Volume 8318 of Lecture Notes in Computer Science, pages 242-261, Springer, 2014. [doi]

@inproceedings{BozgaIK14,
  title = {Safety Problems Are NP-complete for Flat Integer Programs with Octagonal Loops},
  author = {Marius Bozga and Radu Iosif and Filip Konecný},
  year = {2014},
  doi = {10.1007/978-3-642-54013-4_14},
  url = {http://dx.doi.org/10.1007/978-3-642-54013-4_14},
  researchr = {https://researchr.org/publication/BozgaIK14},
  cites = {0},
  citedby = {0},
  pages = {242-261},
  booktitle = {Verification, Model Checking, and Abstract Interpretation - 15th International Conference, VMCAI 2014, San Diego, CA, USA, January 19-21, 2014, Proceedings},
  editor = {Kenneth L. McMillan and Xavier Rival},
  volume = {8318},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-642-54012-7},
}