Generalized Craig Interpolation for Stochastic Satisfiability Modulo Theory Problems

Mahdi, Ahmed; Fränzle, Martin

doi:10.1007/978-3-319-11439-2_16

Lecture Notes in Computer Science

2014

DOI: 10.1007/978-3-319-11439-2_16

|View full text |Cite

Generalized Craig Interpolation for Stochastic Satisfiability Modulo Theory Problems

Ahmed Mahdi¹,

Martin Fränzle²

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2019

Publication Types

Select...

Other1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The original paper uses SSMT to consider bounded reachability in probabilistic automata, which is an incomplete technique. The approach is, however, more general than that, and can be applied easily to other properties, and has been integrated with Craig Interpolation[17]. SSMT is a very different approach to pIC3, and builds on the idea of lazy form of quantifier elimination to compute reachable sets.…”

mentioning

confidence: 99%

Verifying Reachability Properties in Markov Chains via Incremental Induction

Polgreen,

Brain,

Fraenzle

et al. 2019

Preprint

View full text Add to dashboard Cite

There is a scalability gap between probabilistic and nonprobabilistic verification. Probabilistic model checking tools are based either on explicit engines or on (Multi-Terminal) Binary Decision Diagrams. These structures are complemented in areas of non-probabilistic verification by more scalable techniques, such as IC3. We present a symbolic probabilistic model checking algorithm based on IC3-like incremental construction of inductive clauses to partition the state space, interleaved with incremental construction of a system of linear inequalities. This paper compares our implementation to standard quantitative verification alternatives: our experiments show that our algorithm is a step to more scalable symbolic verification of rare events in finite-state Markov chains.

show abstract

mentioning

confidence: 99%

Verifying Reachability Properties in Markov Chains via Incremental Induction

Polgreen,

Brain,

Fraenzle

et al. 2019

Preprint

View full text Add to dashboard Cite

show abstract

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

Generalized Craig Interpolation for Stochastic Satisfiability Modulo Theory Problems

Cited by 1 publication

References 24 publications

Verifying Reachability Properties in Markov Chains via Incremental Induction

Verifying Reachability Properties in Markov Chains via Incremental Induction

Contact Info

Product

Resources

About