Conference ProceedingsOPEN ACCESS

Probabilistic CEGAR

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2008) 5123 LNCS 162-175
DOI: 10.1007/978-3-540-70545-1_16
125Citations
Citations of this article
38Readers
Mendeley users who have this article in their library.

This article is free to access.

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 arise. This paper explores them in the context of predicate abstraction. © 2008 Springer-Verlag.

Cite

CITATION STYLE

APA

Hermanns, H., Wachter, B., & Zhang, L. (2008). Probabilistic CEGAR. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5123 LNCS, pp. 162–175). https://doi.org/10.1007/978-3-540-70545-1_16

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free