Lazy Theorem Proving for Bounded Model Checking over Infinite Domains
- 4 July 2002
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 438-455
- https://doi.org/10.1007/3-540-45620-1_35
Abstract
No abstract availableKeywords
This publication has 25 references indexed in Scilit:
- Model-checking for real-time systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Benefits of Bounded Model Checking at an Industrial SettingLecture Notes in Computer Science, 2001
- ICS: Integrated Canonizer and Solver?Lecture Notes in Computer Science, 2001
- Bounded Model Checking Using Satisfiability SolvingFormal Methods in System Design, 2001
- Counterexample-Guided Abstraction RefinementLecture Notes in Computer Science, 2000
- Symbolic Model Checking without BDDsPublished by Defense Technical Information Center (DTIC) ,1999
- Exploiting Positive Equality in a Logic of Equality with Uninterpreted FunctionsLecture Notes in Computer Science, 1999
- BDD based procedures for a theory of equality with uninterpreted functionsPublished by Springer Nature ,1998
- Symbolic Model Checking for Real-Time SystemsInformation and Computation, 1994
- Graph-Based Algorithms for Boolean Function ManipulationIEEE Transactions on Computers, 1986