Computing transitive closures of integer relations is the key to finding precise invariants of integer programs. In this paper, we describe an efficient algorithm for computing the transitive closures of difference bounds, octagonal and finite monoid affine relations. On the theoretical side, this framework provides a common solution to the acceleration problem, for all these three classes of relations. In practice, according to our experiments, the new method performs up to four orders of magnitude better than the previous ones, making it a promising approach for the verification of integer programs. © 2010 Springer-Verlag.
CITATION STYLE
Bozga, M., Iosif, R., & Konečný, F. (2010). Fast acceleration of ultimately periodic relations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6174 LNCS, pp. 227–242). https://doi.org/10.1007/978-3-642-14295-6_23
Mendeley helps you to discover research relevant for your work.