Bounded Model Checking and Induction: From Refutation to Verification
Authors:
- 1 January 2003
- book chapter
- Published by Springer Nature
- p. 14-26
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Efficient Computation of Recurrence Diameters2002
- Lazy Theorem Proving for Bounded Model Checking over Infinite Domains2002
- ICS: Integrated Canonizer and Solver?2001
- Bounded Model Checking Using Satisfiability SolvingFormal Methods in System Design, 2001
- Symbolic Reachability Analysis Based on SAT-Solvers2000
- Automatic Verification of Parameterized Cache Coherence Protocols2000
- Automatic Generation of InvariantsFormal Methods in System Design, 1999
- Symbolic Model Checking without BDDs1999
- Timed Automata1999
- A synthesizer of inductive assertionsIEEE Transactions on Software Engineering, 1975