Un-Kleene Boolean equation solving

International Journal of Foundations of Computer Science

Volumn 18, Issue 2, 2007, Pages 227-250

  Herlihy, Brian ^a   Schachte, Peter ^a   Søndergaard, Harald ^a  

^a UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

Boolean functions; Decision diagrams; Fixed points; Kleene iteration

Indexed keywords

EID: 34247186927     PISSN: 01290541     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129054107004668     Document Type: Conference Paper

References (24)

1. Aiken, A., Fähndrich, M., Foster, J. S. & Su, Z. (1998), A toolkit for constructing type- and constraint-based program analyses, in X. Leroy & A. Ohori, eds, 'Types in Compilation', Vol. 1473 of Lecture Notes in Computer Science, Springer, pp. 78-96.
2. Armstrong, T., Marriott, K., Schachte, P. & Søndergaard, H. (1998), 'Two classes of Boolean functions for dependency analysis', Science of Computer Programming 31(1), 3-45.
3. Brace, K., Rudell, R. & Bryant, R. (1990), Efficient implementation of a BDD pack-age, in 'Proc. Twenty-seventh ACM/IEEE Design Automation Conf.', pp. 40-45.
4. Bryant, R. (1992), 'Symbolic Boolean manipulation with ordered binary-decision diagrams', ACM Computing Surveys 24(3), 293-318.
5. Codish, M. (1999), 'Worst-case groundness analysis using positive Boolean functions', Journal of Logic Programming 41(1), 125-128.
6. Cousot, P. & Cousot, R. (1977), Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints, in 'Proceedings of the Fourth ACM Symposium on Principles of Programming Languages', ACM Press, pp. 238-252.
7. Englebert, V., Le Charlier, B., Roland, D. & Van Hentenryck, P. (1993), 'Generic abstract interpretation algorithms for Prolog: Two optimization techniques and their experimental evaluation', Software Practice and Experience 23(4), 419-459.
8. Fecht, C. &: Seidl, H. (1998), Propagating differences: An efficient new fixpoint algorithm for distributed constraint systems, in C. Hankin, ed., 'Proceedings of the 1998 European Symposium on Programming', Vol. 1381 of Lecture Notes in Computer Science, Springer, pp. 90-104.
9. Fecht, C. & Seidl, H. (1999), 'A faster solver for general systems of equations', Science of Computer Programming 35(2-3), 137-161.
10. Genaim, S., Howe, J. M. & Codish, M. (2001), 'Worst-case groundness analysis using definite Boolean functions', Theory and Practice of Logic Programming 1, 611-615.
11. Herlihy, B., Schachte, P. & Søndergaard, H. (2006), Boolean equation solving as graph traversal, in J. Gudmundsson & B. Jay, eds, 'Theory of Computing 2006', Vol. 51 of Conferences in Research and Practice in Information Technology, pp. 123-132.
12. Jørgensen, N. (1994), Finding fixpoints in finite function spaces using neededness analysis and chaotic iteration, in B. Le Charlier, ed., 'Static Analysis: Proceedings of the First International Symposium', Vol. 864 of Lecture Notes in Computer Science, Springer, pp. 329-345.
13. Kildall, G. A. (1973), A unified approach to global program optimization, in 'Proceedings of the First Annual ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages', ACM Press, pp. 194-206.
14. Kleene, S. C. (1952), Introduction to Metamathematics, Van Nostrand.
15. Le Charlier, B. & Van Hentenryck, P. (1992), A universal top-down fixpoint algorithm, Technical Report CS-92-25, Brown University, Department of Computer Science.
16. Liaw, H.-T. & Lin, C.-S. (1992), 'On the OBDD-representation of general Boolean functions', IEEE Transactions on Computers C-41(6), 661-664.
17. McAllester, D. (1999), On the complexity analysis of static analyses, in A. Cortesi & G. Filé, eds, 'Static Analysis: Proceedings of the Sixth Symposium', Vol. 1694 of Lecture Notes in Computer Science, Springer, pp. 312-329.
18. Nethercote, N. & Seward, J. (2003), 'Valgrind: A program supervision framework', Electronic Notes in Theoretical Computer Science 89(2).
19. Nielson, F., Nielson, H. R. & Seidl, H. (2002), 'A succinct solver for ALFP', Nordic Journal of Computing 9, 335-372.
20. Schachte, P. (1996), Efficient ROBDD operations for program analysis, in K. Ramamohanarao, ed., 'ACSC'96: Proceedings of the 19 Australasian Computer Science Conference', Australian Computer Science Communications, pp. 347-356.
21. Tarjan, R. E. (1972), 'Depth-first search and linear graph algorithms', SIAM Journal of Computing 1(2), 146-170.
22. Tarski, A. (1955), 'A lattice-theoretical theorem and its applications', Pacific Journal of Mathematics 5, 285-309.
23. Vergauwen, B., Wauman, J. & Lewi, J. (1994), Efficient fixpoint computation, in B. Le Charlier, ed., 'Static Analysis: Proceedings of the First International Symposium', Vol. 864 of Lecture Notes in Computer Science, Springer, pp. 314-328.
24. Wunderwald, J. E. (1995), Memoing evaluation by source-to-source transformation, in M. Proietti, ed., 'Logic Program Synthesis and Transformation', Vol. 1048 of Lecture Notes in Computer Science, Springer, pp. 17-32.