Abstracting numeric constraints with Boolean functions

DOI10.1016/S0020-0190(00)00081-8zbMath1339.68045OpenAlexW1991816648WikidataQ127351599 ScholiaQ127351599MaRDI QIDQ294784

Andy King, Jacob M. Howe

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 programmingcompilersabstract interpretation

Mathematics Subject Classification ID

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

Related Items (1)

Typing Linear Constraints for Moding CLP( ${\cal R}$ ) Programs

Cites Work

• Unnamed Item
• Two classes of Boolean functions for dependency analysis
• Analyzing logic programs using “prop”-ositional logic programs and a magic wand
• A simple polynomial groundness analysis for logic programs

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