A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
The Octagon domain, which tracks a restricted class of two variable inequality, is the abstract domain of choice for many applications because its domain operations are either quadratic or cubic in the number of program variables. Octagon constraints are classically represented using a Difference Bound Matrix (DBM), where the entries in the DBM store bounds c for inequalities of the form xi´xj ď c, xi'xj ď c or´xi´xj ď c. The size of such a DBM is quadratic in the number of variables, giving adoi:10.1007/978-3-319-71237-6_23 fatcat:xi3muphymzgotbby4bdhk5ye5u