Publication result detail

Fast Acceleration of Ultimately Periodic Relations

BOZGA, M.; IOSIF, R.; KONEČNÝ, F.

Original Title

Fast Acceleration of Ultimately Periodic Relations

English Title

Fast Acceleration of Ultimately Periodic Relations

Type

Paper in proceedings outside WoS and Scopus

Original Abstract

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.

English abstract

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.

Keywords

acceleration, counter systems, difference bounds relations, octagonal relations, finite monoid affine relations

Key words in English

acceleration, counter systems, difference bounds relations, octagonal relations, finite monoid affine relations

Authors

BOZGA, M.; IOSIF, R.; KONEČNÝ, F.

RIV year

2012

Released

09.07.2010

Publisher

Springer Verlag

Location

Berlin

ISBN

978-3-642-14294-9

Book

Computer Aided Verification

Edition

Lecture Notes in Computer Science

Volume

6174

Pages from

227

Pages to

242

Pages count

15

URL

https://www.fit.vut.cz/research/publication/9278/

BibTex

@inproceedings{BUT34831,
  author="Marius {Bozga} and Iosif {Radu} and Filip {Konečný}",
  title="Fast Acceleration of Ultimately Periodic Relations",
  booktitle="Computer Aided Verification",
  year="2010",
  series="Lecture Notes in Computer Science",
  volume="6174",
  pages="227--242",
  publisher="Springer Verlag",
  address="Berlin",
  isbn="978-3-642-14294-9",
  url="https://www.fit.vut.cz/research/publication/9278/"
}