A generalization of the differential approach to recursive query evaluation
Journal of Logic Programming
Towards a theory of declarative knowledge
Foundations of deductive databases and logic programming
Symbolic finite differencing, part I (invited lecture)
Proceedings of the third European symposium on programming on ESOP '90
Action versus state based logics for transition systems
Proceedings of the LITP spring school on theoretical computer science on Semantics of systems of concurrent processes
Symbolic Boolean manipulation with ordered binary-decision diagrams
ACM Computing Surveys (CSUR)
Data flow analysis is model checking of abstract interpretations
POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Propagating differences: an efficient new fixpoint algorithm for distributive constraint systems
Nordic Journal of Computing
Data Flow Analysis as Model Checking
TACS '91 Proceedings of the International Conference on Theoretical Aspects of Computer Software
Nordic Journal of Computing
PLDI '03 Proceedings of the ACM SIGPLAN 2003 conference on Programming language design and implementation
Computable queries for relational data bases (Preliminary Report)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
A Universal Top-Down Fixpoint Algorithm
A Universal Top-Down Fixpoint Algorithm
Cloning-based context-sensitive pointer alias analysis using binary decision diagrams
Proceedings of the ACM SIGPLAN 2004 conference on Programming language design and implementation
Static validation of security protocols
Journal of Computer Security
Model checking Is static analysis of modal logic
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
Data-Flow analysis as model checking within the jABC
CC'06 Proceedings of the 15th international conference on Compiler Construction
Galois connections for flow algebras
FMOODS'11/FORTE'11 Proceedings of the joint 13th IFIP WG 6.1 and 30th IFIP WG 6.1 international conference on Formal techniques for distributed systems
Model checking as static analysis: revisited
IFM'12 Proceedings of the 9th international conference on Integrated Formal Methods
Proceedings of the 14th symposium on Principles and practice of declarative programming
| Hi-index | 0.00 |
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.