Heuristics for Selecting Predicates for Partial Predicate Abstraction

12/30/2017
by   Tuba Yavuz, et al.
0

In this paper we consider the problem of configuring partial predicate abstraction that combines two techniques that have been effective in analyzing infinite-state systems: predicate abstraction and fixpoint approximations. A fundamental problem in partial predicate abstraction is deciding the variables to be abstracted and the predicates to be used. In this paper, we consider systems modeled using linear integer arithmetic and investigate an alternative approach to counter-example guided abstraction refinement. We devise two heuristics that search for predicates that are likely to be precise. The first heuristic performs the search on the problem instance to be verified. The other heuristic leverages verification results on the smaller instances of the problem. We report experimental results for CTL model checking and discuss advantages and disadvantages of each approach.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

12/05/2017

Partial Predicate Abstraction and Counter-Example Guided Refinement

In this paper we present a counter-example guided abstraction and approx...
12/21/2021

Model Sketching by Abstraction Refinement for Lifted Model Checking (Extended Version)

In this work, we show how the use of verification and analysis technique...
01/26/2018

Invariant Checking of NRA Transition Systems via Incremental Reduction to LRA with EUF

Model checking invariant properties of designs, represented as transitio...
09/29/2011

FluCaP: A Heuristic Search Planner for First-Order MDPs

We present a heuristic search algorithm for solving first-order Markov D...
08/09/2014

A Heuristic Search Algorithm for Solving First-Order MDPs

We present a heuristic search algorithm for solving first-order MDPs (FO...
07/30/2014

Graph Transformation Planning via Abstraction

Modern software systems increasingly incorporate self-* behavior to adap...
08/22/2017

Scheduling Constraint Based Abstraction Refinement for Multi-Threaded Program Verification

Bounded model checking is among the most efficient techniques for the au...
This week in AI

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