Logahedra: A new weakly relational domain

Howe, J. M. & King, A. (2009). Logahedra: A new weakly relational domain. Lecture Notes in Computer Science, 5799, pp. 306-320. doi: 10.1007/978-3-642-04761-9_23

Download (244kB) | Preview


Weakly relational numeric domains express restricted classes of linear inequalities that strike a balance between what can be described and what can be efficiently computed. Popular weakly relational domains such as bounded differences and octagons have found application in model checking and abstract interpretation. This paper introduces logahedra, which are more expressiveness than octagons, but less expressive than arbitrary systems of two variable per inequality constraints. Logahedra allow coefficients of inequalities to be powers of two whilst retaining many of the desirable algorithmic properties of octagons.

Item Type: Article
Additional Information: The original publication is available at www.springerlink.com
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisions: School of Informatics > Department of Computing
URI: http://openaccess.city.ac.uk/id/eprint/1704

Actions (login required)

View Item View Item


Downloads per month over past year

View more statistics