Abstracting numeric constraints with Boolean functions

DOI10.1016/S0020-0190(00)00081-8MaRDI QIDQ294784zbMATH OpenOpenAlexWikidataFDO

Authors Jacob M. Howe, Andy King

Publication date 16 June 2016

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0020-0190(00)00081-8

zbMATH Keywords

constraint programmingabstract interpretationcompilers

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• Extending constraint-only representation of polyhedra with Boolean constraints
• Automatic modular abstractions for template numerical constraints
• A constraint solver based on abstract domains
• Efficient groundness analysis in Prolog
• Worst-case groundness analysis using positive Boolean functions

Cites work

• scientific article; zbMATH DE number 1538027 (Why is no real title available?)
• A simple polynomial groundness analysis for logic programs
• Analyzing logic programs using “prop”-ositional logic programs and a magic wand
• Two classes of Boolean functions for dependency analysis

Cited in

(4)

• Typing Linear Constraints for Moding CLP( ${\cal R}$ ) Programs
• Splitting the Control Flow with Boolean Flags
• Extending constraint-only representation of polyhedra with Boolean constraints
• Abstraction of Optional Numerical Values

This page was built for publication: Abstracting numeric constraints with Boolean functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q294784)