Conference item

Probabilistic CEGAR

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.

Actions

Email

Email this record

Send the bibliographic details of this record to your email address.

Your Email
Please enter the email address that the record information will be sent to.

-
Your message (optional)
Please add any additional information to be included within the email.
Share
Cite

Cite this record

APA Style

Hermanns, H., Wachter, B., & Zhang, L. (2008). Probabilistic CEGAR. 5123.

MLA Style

Hermanns, H, et al. “Probabilistic CEGAR.” vol. 5123, 2008.

Chicago Style

Hermanns, H, B Wachter, and L Zhang. 2008. “Probabilistic CEGAR.” 5123.
Print

Access Document

Files:: cav08.pdf

(Preview, pdf, 185.1KB, Terms of use)

Authors

+ Hermanns, H More by this author

Role:: Author

+ Wachter, B More by this author

Role:: Author

+ Zhang, L More by this author

Role:: Author

Publisher:: Springer Verlag
Host title:: CAV
Volume:: 5123
Publication date:: 2008-01-01

UUID:: uuid:c9ad9922-56be-4b55-8b0c-5c3a77d6269b
Local pid:: cs:4767
Deposit date:: 2015-03-31
ARK identifier:: ark:/29072/ora_c9ad992256be4b558b0c5c3a77d6269b

Terms of use

Copyright date:: 2008

Licence:: Terms and Conditions of Use for Oxford University Research Archive

Views and Downloads

About views and downloads

If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP