Journal article · Conference paper
Explicit Versus Symbolic Algorithms for Solving ALFP Constraints
In
Electronic Notes in Theoretical Computer Science
—
2010, pp. 15-28
Abstract
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.
| Language: | English |
|---|---|
| Year: | 2010 |
| Pages: | 15-28 |
| Proceedings: | Proceedings of the Tools for Automatic Program AnalysiS (TAPAS), Proceedings of the Tools for Automatic Program AnalysiS (TAPAS) |
| ISSN: | 15710661 |
| Types: | Journal article and Conference paper |
| DOI: | 10.1016/j.entcs.2010.09.015 |
| ORCIDs: | Nielson, Hanne Riis and Nielson, Flemming |
