Fast Acceleration of Ultimately Periodic Relations

Marius Bozga (1) , Radu Iosif (1) , Filip Konecny (1, 2)

1 VERIMAG - IMAG - VERIMAG
2 FIT / BUT - Faculty of Information Technology [Brno]

Computing transitive closures of integer relations is the key tofinding 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.

Domaines: Systèmes embarqués

Marius Bozga, Radu Iosif, Filip Konecny. Fast Acceleration of Ultimately Periodic Relations. Computer Aided Verification, 22nd International Conference, CAV 2010, Jul 2010, Edinburgh, United Kingdom. pp.227-242, ⟨10.1007/978-3-642-14295-6⟩. ⟨hal-00722391⟩