Model Checking Using SMT and Theory of Lists
Authors:
- 1 January 2011
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 282-297
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Deciding Effectively Propositional Logic Using DPLL and Substitution SetsJournal of Automated Reasoning, 2009
- Compositional Synthesis of Reactive Systems from Live Sequence Chart SpecificationsLecture Notes in Computer Science, 2009
- Z3: An Efficient SMT Solver2008
- JPF–SE: A Symbolic Execution Extension to Java PathFinder2007
- A Tool for Checking ANSI-C Programs2004
- Behavioral consistency of C and verilog programs using bounded model checking2003
- Applying SAT Methods in Unbounded Symbolic Model Checking2002
- Counterexample-Guided Abstraction Refinement2000
- Symbolic Model Checking without BDDs1999
- The Impact of Branching Heuristics in Propositional Satisfiability Algorithms1999