Explicit versus symbolic algorithms for solving ALFP constraints

Electronic Notes in Theoretical Computer Science

Volumn 267, Issue 2, 2010, Pages 15-28

  Filipiuk, Piotr ^a   Riis Nielson, Hanne ^a   Nielson, Flemming ^a  

^a TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

Author keywords

Alternation free Least Fixed Point logic; Binary decision diagrams; Constraint solving; Differential worklist algorithm; Static analysis

Indexed keywords

ANALYSIS AND MODELS; ANALYSIS PROBLEMS; BINARY DECISION; CONSTRAINT SOLVING; DIFFERENTIAL WORKLIST ALGORITHM; FIXED-POINT LOGIC; INTERMEDIATE LANGUAGES; SYMBOLIC ALGORITHMS;

ALGORITHMS; MODEL CHECKING; STATIC ANALYSIS;

BINARY DECISION DIAGRAMS;

EID: 77957730159     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2010.09.015     Document Type: Article

References (19)

1. K.R. Apt, H.A. Blair, and A. Walker Towards a theory of declarative knowledge Foundations of Deductive Databases and Logic Programming 1988 Morgan Kaufmann 89 148
2. I. Balbin, and K. Ramamohanarao A generalization of the differential approach to recursive query evaluation Journal of Logic Programming 4 1987 259 262
3. Berndl, M., O. Lhoták, F. Qian, L. J. Hendren and N. Umanee, Points-to analysis using BDDs, in: PLDI, 2003, pp. 103-114.
4. C. Bodei, M. Buchholtz, P. Degano, F. Nielson, and H.R. Nielson Static validation of security protocols Journal of Computer Security 13 2005 347 390
5. R.E. Bryant Symbolic boolean manipulation with ordered binary-decision diagrams ACM Comput. Surv. 24 1992 293 318
6. Chandra, A. K. and D. Harel, Computable queries for relational data bases (preliminary report), in: STOC, 1979, pp. 309-318.
7. Charlier, B. L. and P. V. Hentenryck, A universal top-down fixpoint algorithm, Technical report, CS-92-25, Brown University (1992).
8. C. Fecht, and H. Seidl Propagating differences: An efficient new fixpoint algorithm for distributive constraint systems Nordic Journal of Computing 5 1998 304 329
9. Lamprecht, A.-L., T. Margaria and B. Steffen, Data-flow analysis as model checking within the jABC, in: CC, 2006, pp. 101-104.
10. J. Lind-Nielsen Buddy, a binary decision diagram package http://sourceforge.net/projects/buddy/
11. R.D. Nicola, and F.W. Vaandrager Action versus state based logics for transition systems Semantics of Systems of Concurrent Processes 1990 407 419
12. Nielson, F. and H. R. Nielson, Model checking is static analysis of modal logic, in: FOSSACS, 2010, pp. 191-205.
13. Nielson, F., H. R. Nielson, H. Sun, M. Buchholtz, R. R. Hansen, H. Pilegaard and H. Seidl, The succinct solver suite, in: TACAS, 2004, pp. 251-265.
14. F. Nielson, H. Seidl, and H.R. Nielson A Succinct Solver for ALFP Nord. J. Comput. 9 2002 335 372
15. R. Paige Symbolic finite differencing - part i ESOP'90 LNCS vol. 432 1990 36 56
16. Schmidt, D. A., Data flow analysis is model checking of abstract interpretations, in: POPL, 1998, pp. 38-48.
17. Schmidt, D. A. and B. Steffen, Program analysis as model checking of abstract interpretations, in: SAS, 1998, pp. 351-380.
18. Steffen, B., Data flow analysis as model checking, in: TACS, 1991, pp. 346-365.
19. Whaley, J. and M. S. Lam, Cloning-based context-sensitive pointer alias analysis using binary decision diagrams, in: PLDI, 2004, pp. 131-144.