On Solving Universally Quantified Horn Clauses
Authors:
- 1 January 2013
- book chapter
- Published by Springer Nature
- p. 105-125
Abstract
No abstract availableKeywords
This publication has 29 references indexed in Scilit:
- Solving Existentially Quantified Horn Clauses2013
- Beautiful Interpolants2013
- Lazy Abstraction with Interpolants for Arrays2012
- A parametric segmentation functor for fully automatic and scalable array content analysis2011
- Fluid Updates: Beyond Strong vs. Weak Updates2010
- Simplify: a theorem prover for program checkingJournal of the ACM, 2005
- Automatic Software Model Checking Using CLPLecture Notes in Computer Science, 2003
- Predicate abstraction for software verification2002
- Model Checking in CLP1999
- Construction of abstract state graphs with PVS1997