Name
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. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1007/978-3-642-14295-6_23 | CAV |
Keywords | Field | DocType |
transitive closure,computing transitive closure,common solution,periodic relation,integer program,new method,fast acceleration,difference bound,efficient algorithm,acceleration problem,integer relation,finite monoid affine relation | Affine transformation,Integer,Computer science,Algorithm,Monoid,Acceleration,Invariant (mathematics),Transitive closure,Periodic graph (geometry),Transitive relation | Conference |
Volume | ISSN | ISBN |
6174 | 0302-9743 | 3-642-14294-X |
Citations | PageRank | References |
36 | 1.09 | 10 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Marius Bozga | 1 | 2100 | 127.83 |
| Radu Iosif | 2 | 483 | 42.44 |
| Filip Konečný | 3 | 83 | 3.78 |