Verification of BDD normalization

Lecture Notes in Computer Science

Volumn 3603, Issue , 2005, Pages 261-277

  Ortner, Veronika ^a   Schirmer, Norbert ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LOGIC; THEOREM PROVING;

BINARY DECISION DIAGRAM (BDD); HOARE LOGICS; NORMALIZATION PROCESSES; VERIFICATION;

ALGORITHMS;

EID: 26844532520     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11541868_17     Document Type: Conference Paper

References (14)

1. Richard Bornat. Proving pointer programs in Hoare logic. In J. Oliveira R. Backhouse, editor, Mathematics of Program Construction, volume 1837 of Lect. Notes in Comp. Sci., pages 102-126. Springer, 2000.
2. Karl S. Brace, Richard L. Rudell, and Randal E. Bryant. Efficient implementation of a BDD package. In Design Automation Conference, 1990. Proceedings. 27th ACM/IEEE, pages 40-45, June 1990.
3. Randal E. Bryant. Graph-based Algorithms for Boolean Function Manipulation. IEEE Transactions on Computers, C-35(8):677-691, August 1986.
4. Rod Burstall. Some techniques for proving correctness of programs which alter data structures. In B. Meltzer and D. Michie, editors, Machine Intelligence 7, pages 23-50. Edinburgh University Press, 1972.
5. Edmund Clarke, Orna Grumberg, and Doron Peled. Model Checking. MIT Press, 1999.
6. Jean-Christophe Filliâtre and Claude Marché. Multi-prover verification of C programs. In Jim Davies, Wolfram Schulte, and Mie Barnett, editors, Formal Methods and Software Engineering 6th International Conference on Formal Engineering Methods, ICFEM 2004, Seattle, WA, USA, November 8-12, 2004, volume 3308 of Lect. Notes in Comp. Sci. Springer, 2004.
7. Sava Krstic and John Matthews. Verifying BDD algorithms through monadic interpretation. In A. Cortesi, editor, Verification, Model Checking, and Abstract Interpretation: Third International Workshop, VMCAI 2002, Venice, Italy, January 21-22, volume 2294 of LNCS, pages 182-195, 2002.
8. Farhad Mehta and Tobias Nipkow. Proving Pointer Programs in Higher-Order Logic. In P. Baader, editor, Automated Deduction - CADE-19, volume 2741 of Lect. Notes in Comp. Sci., pages 121-135. Springer, 2003.
9. Tobias Nipkow. Structured Proofs in Isar/HOL. In TYPES 2002, volume 2646 of Lect. Notes in Comp. Sci. Springer, 2002. http://isabelle.in.tum.de/docs. html.
10. Tobias Nipkow, Lawrence Paulson, and Markus Wenzel. Isabelle/HOL - A Proof Assistant for Higher-Order Logic, volume 2283 of Lect. Notes in Comp. Sci. Springer-Verlag, 2002. http://www.in.tum.de/~nipkow/LNCS2283/.
11. Veronika Ortner. Verification of BDD Algorithms. Master's thesis, Technische Universität München, 2004. available from http://www.veronika.langlotz.info/.
12. John C. Reynolds. Separation logic: A logic for shared mutable data structures. In Proc. 17th IEEE Symposium on Logic in Computer Science (LICS 2002), pages 55-74, 2002.
13. Norbert Schirmer. A verification environment for sequential imperative programs in Isabelle/HOL. In P. Baader and A. Voronkov, editors, Logic for Programming, Artificial Intelligence, and Reasoning, volume 3452 of Lect. Notes in Art. Int., pages 398-414. Springer-Verlag, 2005.
14. Kumar Neeraj Verma, Jean Goubault-Larrecq, Sanjiva Prasad, and S. Arun-Kumar. Reflecting BDDs in Coq. In Proc. 6th Asian Computing Science Conference (ASIAN'2000), Penang, Malaysia, Nov. 2000, volume 1961, pages 162-181. Springer, 2000.