Skip to main content

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)

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
Divisions: 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: 16 Nov 2021 09:54 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

  • Depositors only (login required):

Total unique views for this document in KAR since July 2020. For more details click on the image.