Howe, J.M. and King, A. (2000) Abstracting numeric constraints with Boolean functions. Information Processing Letters, 75 (1-2). pp. 17-23. ISSN 0020-0190.
|
Download (218Kb)
|
![[img]](http://kar.kent.ac.uk/style/images/fileicons/application_pdf.png)
|
|
| Other (zip) | ||
|
Download (81Kb)
|
![[img]](http://kar.kent.ac.uk/style/images/fileicons/other.png) |
|
| 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 |
|---|---|
| Uncontrolled keywords: | abstract interpretation; compilers; constraint programming |
| Subjects: | Q Science > QA Mathematics (inc Computing science) > QA 75 Electronic computers. Computer science |
| Divisions: | Faculties > Science Technology and Medical Studies > School of Computing Faculties > Science Technology and Medical Studies > School of Computing > Security Group |
| Depositing User: | O.O. Odanye |
| Date Deposited: | 02 Apr 2009 20:12 |
| Last Modified: | 25 Jun 2012 14:16 |
| Resource URI: | http://kar.kent.ac.uk/id/eprint/16241 (The current URI for this page, for reference purposes) |
- Depositors only (login required):
