Closing the Performance Gap between Doubles and Rationals for Octagons

Chawdhary, Aziem and King, Andy (2018) Closing the Performance Gap between Doubles and Rationals for Octagons. In: Podelski, Andreas, ed. Static Analysis 25th International Symposium. Springer. ISBN 978-3-319-99724-7. (doi:10.1007/978-3-319-99725-4_13) (Access to this publication is currently restricted. You may be able to access a copy if URLs are provided)

PDF (Closing the Performance Gap between Doubles and Rationals for Octagons) - Author's Accepted Manuscript
Restricted to Repository staff only until 29 August 2019.
Contact us about this Publication Download (486kB)
Official URL


Octagons have enduring appeal because their domain operations are simple, readily mapping to for-loops which apply max, min and sum to the entries of a Difference Bound Matrix (DBM). In the quest for efficiency, arithmetic is often realised with double-precision floating-point, albeit at the cost of the certainty provided by arbitrary-precision rationals. In this paper we show how Compact DBMs (CoDBMs), which has recently been proposed as a memory refinement for DBMs, enable arithmetic calculation to be short-circuited in various domain operations. We also show how comparisons can be avoided by changing the tables which underpin CoDBMs. From the perspective of implementation, the optimisations are attractive because they too are conceptually simple, following the ethos of Octagons. Yet they halve the running time on rationals, putting CoDBMs on rationals on a par with DBMs on doubles.

Item Type: Book section
DOI/Identification number: 10.1007/978-3-319-99725-4_13
Subjects: Q Science
T Technology > T Technology (General)
Divisions: Faculties > Sciences > School of Computing > Programming Languages and Systems Group
Depositing User: Andy King
Date Deposited: 07 Jun 2018 08:58 UTC
Last Modified: 29 May 2019 20:36 UTC
Resource URI: (The current URI for this page, for reference purposes)
  • Depositors only (login required):


Downloads per month over past year