Logahedra: a New Weakly Relational Domain

Howe, J.M. and King, Andy (2009) Logahedra: a New Weakly Relational Domain. In: International Symposium on Automated Technology for Verification and Analysis, OCT 13-16, 2009, Macao, Peoples Republic of China.

PDF
Download (238Kb)	Preview

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:	Conference or workshop item (Paper)
Uncontrolled keywords:	abstract interpretation
Subjects:	Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions:	Faculties > Science Technology and Medical Studies > School of Computing > Theoretical Computing Group
Depositing User:	Mark Wheadon
Date Deposited:	29 Mar 2010 12:15
Last Modified:	25 Jun 2012 14:18
Resource URI:	http://kar.kent.ac.uk/id/eprint/24115 (The current URI for this page, for reference purposes)

• Depositors only (login required):