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]

Authors

Marius Bozga

This author has not been identified. Look up 'Marius Bozga' in Google

Radu Iosif

This author has not been identified. Look up 'Radu Iosif' in Google

Filip Konecný

This author has not been identified. Look up 'Filip Konecný' in Google