Worst-case groundness analysis using definite Boolean functions

DOI10.1017/S1471068401001077zbMath1103.68460arXivcs/0405101OpenAlexW1998384504MaRDI QIDQ4452643

Jacob M. Howe, Michael Codish, Samir Genaim

Publication date: 1 March 2004

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cs/0405101

zbMATH Keywords

program analysis

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (2)

Description, Implementation, and Evaluation of a Generic Design for Tabled CLP ⋮ UN-KLEENE BOOLEAN EQUATION SOLVING

This page was built for publication: Worst-case groundness analysis using definite Boolean functions