Logahedra: a New Weakly Relational Domain: 7th International Symposium, ATVA 2009, Macao, China, October 14-16, 2009. Proceedings

Howe, Jacob M. and King, Andy (2009) Logahedra: a New Weakly Relational Domain: 7th International Symposium, ATVA 2009, Macao, China, October 14-16, 2009. Proceedings. In: Zhiming, Lu and Anders, Ravn, eds. Automated Technology for Verification and Analysis. Lecture Notes in Computer Science, 5799 . Springer, pp. 306-320. ISBN 978-3-642-04760-2. (doi:https://doi.org/10.1007/978-3-642-04761-9_23) (Full text available)

Abstract

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:	Book section
Subjects:	A General Works
Divisions:	Faculties > Sciences > School of Computing > Programming Languages and Systems Group
Depositing User:	Andy King
Date Deposited:	12 Dec 2013 21:29 UTC
Last Modified:	26 Jun 2017 23:50 UTC
Resource URI:	https://kar.kent.ac.uk/id/eprint/37591 (The current URI for this page, for reference purposes)