Abstracting Numeric Constraints with Boolean Functions

Howe, J.M. & King, A. (2000). Abstracting Numeric Constraints with Boolean Functions. Information Processing Letters, 75(1-2), 17 - 23. doi: 10.1016/S0020-0190(00)00081-8

[img]
Preview
 PDF
Download (204kB) | Preview

    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 > QA75 Electronic computers. Computer science
    Divisions: School of Informatics > Department of Computing
    URI: http://openaccess.city.ac.uk/id/eprint/1696

    Actions (login required)

    		 View Item

    Document Downloads

    More statistics for this item...
    Tools
    EPrints Logo
    City Research Online is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.