A Symbolic Approach to Predicate Abstraction
- 1 January 2003
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Modeling and Verifying Systems Using a Logic of Counter Arithmetic with Lambda Expressions and Uninterpreted FunctionsPublished by Springer Nature ,2002
- Applying SAT Methods in Unbounded Symbolic Model CheckingPublished by Springer Nature ,2002
- Checking Satisfiability of First-Order Formulas by Incremental Translation to SATPublished by Springer Nature ,2002
- Deciding Separation Formulas with SATPublished by Springer Nature ,2002
- Automatic predicate abstraction of C programsACM SIGPLAN Notices, 2001
- Automatic Deductive Verification with Invisible InvariantsPublished by Springer Nature ,2001
- Exploiting Positive Equality in a Logic of Equality with Uninterpreted FunctionsPublished by Springer Nature ,1999
- Abstract and Model Check while You ProvePublished by Springer Nature ,1999
- Experience with Predicate AbstractionPublished by Springer Nature ,1999
- Validity checking for combinations of theories with equalityPublished by Springer Nature ,1996