Conference paper

BOZGA Marius, IOSIF Radu and KONEČNÝ Filip. Fast Acceleration of Ultimately Periodic Relations. In: Computer Aided Verification. Berlin: Springer Verlag, 2010, pp. 227-242. ISBN 978-3-642-14294-9.
Publication language:english
Original title:Fast Acceleration of Ultimately Periodic Relations
Title (cs):Akcelerace periodických relací
Proceedings:Computer Aided Verification
Conference:22nd International Conference on Computer-Aided Verification
Series:Lecture Notes in Computer Science 6174
Place:Berlin, DE
Publisher:Springer Verlag
acceleration, counter systems, difference bounds relations, octagonal relations, finite monoid affine relations
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.
   author = {Marius Bozga and Radu Iosif and Filip
   title = {Fast Acceleration of Ultimately Periodic Relations},
   pages = {227--242},
   booktitle = {Computer Aided Verification},
   series = {Lecture Notes in Computer Science 6174},
   year = {2010},
   location = {Berlin, DE},
   publisher = {Springer Verlag},
   ISBN = {978-3-642-14294-9},
   language = {english},
   url = {}

Your IPv4 address:
Switch to https