Partial predicate abstraction and counter-example guided refinement

DOI10.1016/J.JLAMP.2019.01.003zbMATH Open1494.68177arXiv1712.01734OpenAlexW2963357686WikidataQ128537623 ScholiaQ128537623MaRDI QIDQ2291815FDOQ2291815

Authors: Tuba Yavuz 

Publication date: 31 January 2020

Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)

Abstract: In this paper we present a counter-example guided abstraction and approximation refinement (CEGAAR) technique for {em partial predicate abstraction}, which combines predicate abstraction and fixpoint approximations for model checking infinite-state systems. The proposed approach incrementally considers growing sets of predicates for abstraction refinement. The novelty of the approach stems from recognizing source of the imprecision: abstraction or approximation. We use Craig interpolation to deal with imprecision due to abstraction. In the case of imprecision due to approximation, we delay application of the approximation. Our experimental results on a variety of models provide insights into effectiveness of partial predicate abstraction as well as refinement techniques in this context.

Full work available at URL: https://arxiv.org/abs/1712.01734

Recommendations

• Abstract Counterexamples for Non-disjunctive Abstractions
• Tools and Algorithms for the Construction and Analysis of Systems
• Computer Aided Verification
• scientific article; zbMATH DE number 1670775
• Probabilistic CEGAR

zbMATH Keywords

model checkingpredicate abstractionfixpoint approximations

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Logic in computer science (03B70)

Cites Work

• Title not available (Why is that?)
• Theory and Applications of Satisfiability Testing
• Title not available (Why is that?)
• Linear reasoning. A new form of the Herbrand-Gentzen theorem
• Tools and Algorithms for the Construction and Analysis of Systems
• Property preserving abstractions for the verification of concurrent systems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Transition predicate abstraction and fair termination
• Title not available (Why is that?)
• Title not available (Why is that?)
• Action language verifier: An infinite-state model checker for reactive software specifications
• Combining Predicate Abstraction with Fixpoint Approximations
• Title not available (Why is that?)
• Making predicate abstraction efficient: how to eliminate redundant predicates

Cited In (6)

• Abstract Counterexamples for Non-disjunctive Abstractions
• Computer Aided Verification
• Abstract Counterexample-Based Refinement for Powerset Domains
• Unification and combination of a class of traversal strategies made with pattern matching and fixed-points
• Predicate Abstraction with Under-approximation Refinement
• Probabilistic CEGAR

Uses Software

• Omega

This page was built for publication: Partial predicate abstraction and counter-example guided refinement

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2291815)