School of Computing

Abstracting Numeric Constraints with Boolean Functions

J. M. Howe and A. King

Information Processing Letters, 75(1-2):182-196, July 2000.

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.

Download publication 81 kbytes

Bibtex Record

@article{1067,
author = {Howe, J. M. and King, A.},
title = {Abstracting {N}umeric {C}onstraints with {B}oolean {F}unctions},
month = {July},
year = {2000},
pages = {182-196},
keywords = {determinacy analysis, Craig interpolants},
note = {},
doi = {},
url = {http://www.cs.kent.ac.uk/pubs/2000/1067},
    journal = {Information Processing Letters},
    number = {1--2},
    publication_type = {article},
    publisher = {Elsevier},
    submission_id = {5152_963332424},
    volume = {75},
}

School of Computing, University of Kent, Canterbury, Kent, CT2 7NF

Enquiries: +44 (0)1227 824180 or contact us.

Last Updated: 21/03/2014