Heuristics for Selecting Predicates for Partial Predicate Abstraction release_qe47cdrq5vhrbpbqwapzzqzu7m

by Tuba Yavuz, Chelsea Metcalf

Released as a article .

2017  

Abstract

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.
In text/plain format

Archived Files and Locations

application/pdf  485.9 kB
file_qtcsflefbjcrdlblor5csm5r7y
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2017-12-30
Version   v1
Language   en ?
arXiv  1801.02457v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: e7a50f42-05a1-49d6-9ba5-42036f26ad0a
API URL: JSON