PrIC3: Property Directed Reachability for MDPs

04/30/2020
by   Kevin Batz, et al.
0

IC3 has been a leap forward in symbolic model checking. This paper proposes PrIC3 (pronounced pricy-three), a conservative extension of IC3 to symbolic model checking of MDPs. Our main focus is to develop the theory underlying PrIC3. Alongside, we present a first implementation of PrIC3 including the key ingredients from IC3 such as generalization, repushing, and propagation.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

06/04/2020

Automatic Verification of LLVM Code

In this work we present our work in developing a software verification t...
09/07/2017

A Backward-traversal-based Approach for Symbolic Model Checking of Uniform Strategies for Constrained Reachability

Since the introduction of Alternating-time Temporal Logic (ATL), many lo...
10/19/2017

Forward Analysis for WSTS, Part III: Karp-Miller Trees

This paper is a sequel of "Forward Analysis for WSTS, Part I: Completion...
06/22/2021

Lifted Model Checking for Relational MDPs

Model checking has been developed for verifying the behaviour of systems...
05/19/2021

Everything You Always Wanted to Know About Generalization of Proof Obligations in PDR

In this paper we revisit the topic of generalizing proof obligations in ...
08/17/2019

Software Verification with PDR: Implementation and Empirical Evaluation of the State of the Art

Property-directed reachability (PDR) is a SAT/SMT-based reachability alg...
02/05/2022

Leveraging the Power of Graph Algorithms: Efficient Algorithms for Computer-Aided Verification

The goal of the thesis is to leverage fast graph algorithms and modern a...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.