Abstracting numeric constraints with Boolean functions

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

PDF Language: English
Download this file (PDF/223kB)
Request a format suitable for use with assistive technology e.g. a screenreader
Other (zip) Language: English
Download this file (Other/83kB)
Request a format suitable for use with assistive technology e.g. a screenreader
Official URL: http://dx.doi.org/10.1016/S0020-0190(00)00081-8

Abstract

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
DOI/Identification number:	10.1016/S0020-0190(00)00081-8
Uncontrolled keywords:	abstract interpretation; compilers; constraint programming
Subjects:	Q Science > QA Mathematics (inc Computing science) > QA 75 Electronic computers. Computer science
Institutional Unit:	Schools > School of Computing
Former Institutional Unit:	Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing
Depositing User:	Andy King
Date Deposited:	02 Apr 2009 20:12 UTC
Last Modified:	20 May 2025 10:06 UTC
Resource URI:	https://kar.kent.ac.uk/id/eprint/16241 (The current URI for this page, for reference purposes)

University of Kent Author Information

King, Andy.

Creator's ORCID:	https://orcid.org/0000-0001-5806-4822
CReDIT Contributor Roles:

Depositors only (login required):

Altmetric

Total Views

Total unique views of this page since July 2020. For more details click on the image.