Detail publikace

Fast Acceleration of Ultimately Periodic Relations

Originální název

Fast Acceleration of Ultimately Periodic Relations

Anglický název

Fast Acceleration of Ultimately Periodic Relations

Jazyk

en

Originální abstrakt

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.

Anglický abstrakt

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.

BibTex


@inproceedings{BUT34831,
  author="Marius {Bozga} and Iosif {Radu} and Filip {Konečný}",
  title="Fast Acceleration of Ultimately Periodic Relations",
  annote="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.",
  address="Springer Verlag",
  booktitle="Computer Aided Verification",
  chapter="34831",
  edition="Lecture Notes in Computer Science",
  howpublished="print",
  institution="Springer Verlag",
  year="2010",
  month="july",
  pages="227--242",
  publisher="Springer Verlag",
  type="conference paper"
}