Abstracting numeric constraints with Boolean functions

Howe, Jacob M. and King, Andy (2000) Abstracting numeric constraints with Boolean functions. Information Processing Letters, 75 (1-2). pp. 17-23. ISSN 0020-0190. (doi:https://doi.org/10.1016/S0020-0190(00)00081-8 ) (Full text available)

Download (345kB) Preview
Other (zip)
Download (83kB)
Official URL


A simple, syntactic algorithm for abstracting numeric constraints for groundness analysis is presented and proved correct. The technique uses neither projection nor temporary variables, and plugs a gap in the abstract interpretation literature.

Item Type: Article
Uncontrolled keywords: abstract interpretation; compilers; constraint programming
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 75 Electronic computers. Computer science
Divisions: Faculties > Sciences > School of Computing
Faculties > Sciences > School of Computing > Security Group
Depositing User: Andy King
Date Deposited: 02 Apr 2009 20:12 UTC
Last Modified: 27 Jun 2017 02:43 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/16241 (The current URI for this page, for reference purposes)
  • Depositors only (login required):


Downloads per month over past year