Holger Hermanns,Björn Wachter, Lijun Zhang
CAV'08 © Springer LNCS
Abstract. Counterexample-guided abstraction refinement (CEGAR) has been en vogue for the automatic verification of very large systems in the past years. When trying to apply CEGAR to the verification of probabilistic systems, various foundational questions and practical tradeoffs arise. This paper explores them in the context of predicate abstraction.
Links: [Google Scholar]
|Chair for Programming Languages and Compiler Construction