Closure Algorithms for Domains with Two Variables Per Inequality

Howe, J. M. & King, A. (2009). Closure Algorithms for Domains with Two Variables Per Inequality (Report No. TR/2009/DOC/01). .

[img]
Preview
PDF - Published Version
Download (213kB) | 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. Such domains often restrict their attention of TVPI constraints which are systems of constraints where each constraint involves, at most, two variables. This technical report addresses the problem of deriving an incremental version of the closure operation. In this operation, a new constraint is added to a system that is already closed, and the computational problem is how to efficiently close the augmented system.

Item Type: Report
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/4120

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year

View more statistics