A SAT characterization of boolean-program correctness

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2648, Issue , 2003, Pages 104-120

  Leino, K Rustan M ^a  

^a MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY DECISION DIAGRAMS; ECONOMIC AND SOCIAL EFFECTS; SEMANTICS;

BINARY DECISION DIAGRAMS (BDDS); BOOLEAN PROGRAMS; DEVICE DRIVER; EXPLICIT STATE; IMPERATIVE PROGRAMS; MODEL CHECKER; SATISFIABILITY PROBLEMS; WEAKEST PRECONDITION;

MODEL CHECKING;

EID: 35048875780     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Article

References (16)

1. ∼{}faloul/Tools/satire/, April 2002.
2. Thomas Ball and Sriram K. Rajamani. Bebop: A symbolic model checker for boolean programs. In SPIN 7, LNCS #1885, pp. 113-130. Springer, 2000.
3. Thomas Ball and Sriram K. Rajamani. Automatically validating temporal safety properties of interfaces. In SPIN 8, LNCS #2057, pp. 103-122. Springer, 2001.
4. François Bancilhon, David Maier, Yehoshua Sagiv, and Jeffrey D. Ullman. Magic sets and other strange ways to implement logic programs. In PODS 5, pp. 1-15. ACM Press, 1986.
5. Armin Biere, Alessandro Cimatti, Edmund Clarke, and Yunshan Zhu. Symbolic model checking without BDDs. In TACAS '99, LNCS #1579, pp. 193-207. Springer, 1999.
6. Per Bjesse and Koen Claessen. SAT-based verification without state space traversal. In FMCAD 2000, LNCS #1954, pp. 372-389. Springer, 2000.
7. Randal E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers, 35(8):677-691, 1986.
8. Edsger W. Dijkstra. A Discipline of Programming. Prentice Hall, 1976.
9. Edsger W. Dijkstra and Carel S. Scholten. Predicate Calculus and Program Semantics. Texts and Monographs in Computer Science. Springer-Verlag, 1990.
10. Viktor Kuncak and K. Rustan M. Leino. On computing the fixpoint of a set of boolean equations. Technical Report MSR-TR-2003-08, Microsoft Research, 2003.
11. M. S. Manasse and C. G. Nelson. Correct compilation of control structures. Technical report, AT&T Bell Laboratories, September 1984.
12. João P. Marques-Silva and Karem A. Sakallah. GRASP: A search algorithm for prepositional satisfiability. IEEE Transactions on Computers, 48(5):506-521, 1999.
13. Matthew W. Moskewicz, Conor F. Madigan, Ying Zhao, Lintao Zhang, and Sharad Malik. Chaff: Engineering an efficient SAT solver. In DAC 2001, pp. 530-535. ACM, 2001.
14. Andreas Podelski. Model checking as constraint solving. In SAS 2000, LNCS #1824, pp. 22-37. Springer, 2000.
15. Mary Sheeran, Satnam Singh, and Gunnar Stålmarck. Checking safety properties using induction and a SAT-solver. In FMCAD 2000, LNCS #1954, pp. 108-125. Springer, 2000.
16. Francis Tang and Martin Hofmann. Generation of verification conditions for Abadi and Leino's logic of objects. In FOOL 9, 2002. Electronic proceedings.