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 |
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: | 05 Nov 2024 09:51 UTC |
Resource URI: | https://kar.kent.ac.uk/id/eprint/16241 (The current URI for this page, for reference purposes) |
- Link to SensusAccess
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):