Fast Acceleration of Ultimately Periodic Relations

  title={Fast Acceleration of Ultimately Periodic Relations},
  author={Marius Bozga and Radu Iosif and Filip Konecn{\'y}},
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… CONTINUE READING
Highly Cited
This paper has 81 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.


Publications citing this paper.
Showing 1-10 of 50 extracted citations

Fundamentals of Computation Theory

Adrian Kosowski Igor Walukiewicz
Lecture Notes in Computer Science • 2015
View 10 Excerpts
Highly Influenced

82 Citations

Citations per Year
Semantic Scholar estimates that this publication has 82 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-10 of 13 references

Iterating octagons

M. Bozga, C. Gı̂rlea, R. Iosif
In TACAS • 2009
View 9 Excerpts
Highly Influenced

FAST Extended Release

View 4 Excerpts
Highly Influenced

Fast Acceleration of Ultimately Periodic Relations

M. Bozga, R. Iosif, F. Konečný
Technical Report TR-2010-3, • 2010
View 2 Excerpts

The octagon abstract domain

Higher-Order and Symbolic Computation • 2006
View 3 Excerpts

Similar Papers

Loading similar papers…