Effectively-Propositional Reasoning about Reachability in Linked Data Structures
Authors:
- 1 January 2013
- book chapter
- Published by Springer Nature
- p. 756-772
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Accurate Invariant Checking for Programs Manipulating Lists and Arrays with Infinite DataLecture Notes in Computer Science, 2012
- Verification conditions for source-level imperative programsComputer Science Review, 2011
- Back to the future2008
- Z3: An Efficient SMT Solver2008
- Decremental All-Pairs Shortest Paths2008
- The Boundary Between Decidability and Undecidability for Transitive-Closure Logics2004
- Avoiding exponential explosion2001
- Incremental maintenance of recursive views using relational calculus/SQLACM SIGMOD Record, 2000
- Knowledge compilation and theory approximationJournal of the ACM, 1996
- Mona: Monadic second-order logic in practice1995