Explicit Versus Symbolic Algorithms for Solving ALFP Constraints

• Published in: Electronic notes in theoretical computer science Vol. 267; no. 2; pp. 15 - 28
• Main Authors: Filipiuk, Piotr, Riis Nielson, Hanne, Nielson, Flemming
• Format: Journal Article
• Language: English
• Published: Elsevier B.V 01-10-2010
• Subjects: Alternation-free Least Fixed Point logic; binary decision diagrams; constraint solving; differential worklist algorithm; Static analysis; differential worklist algorithm; binary decision diagrams; constraint solving; Alternation-free Least Fixed Point logic; Static analysis
• ISSN: 1571-0661; 1571-0661
• DOI: 10.1016/j.entcs.2010.09.015

ALFP, Alternation-free Least Fixed Point logic, has successfully been used as an intermediate language in the implementation of static analysis and model checking problems. Clearly different analysis problems may give rise to ALFP clauses with different characteristics. There are also different approaches to solving ALFP clauses and some of those are better suited for certain kinds of clauses than others. The aim of this paper is to present two algorithms, one that is based on differential worklists and one based on BDD's, and experiment with them.