Results 1 - 10 of 21

Counterexample driven refinement for abstract interpretation

by Bhargav S. Gulavani, Sriram K. Rajamani - In TACAS 06: Tools and Algorithms for Construction and Analysis of Systems, LNCS 3920 , 2006
"... Abstract. Abstract interpretation techniques prove properties of programs by computing abstract fixpoints. All such analyses suffer from the possibility of false errors. We present a new counterexample driven refinement technique to reduce false errors in abstract interpretations. Our technique keep ..."
Abstract - Cited by 41 (4 self) - Add to MetaCart
Abstract. Abstract interpretation techniques prove properties of programs by computing abstract fixpoints. All such analyses suffer from the possibility of false errors. We present a new counterexample driven refinement technique to reduce false errors in abstract interpretations. Our technique

Formalizing counterexample-driven refinement with weakest preconditions

by Thomas Ball, Thomas Ball - In Engineering Theories of Software Intensive Systems, volume 195 of NATO Science Series , 2005
"... This page intentionally left blank. ..."
Abstract - Cited by 6 (0 self) - Add to MetaCart
This page intentionally left blank.

The SLAM project: debugging system software via static analysis

by Thomas Ball, Sriram K. Rajamani - SIGPLAN Not
"... Abstract. The goal of the SLAM project is to check whether or not a program obeys "API usage rules " that specif[y what it means to be a good client of an API. The SLAM toolkit statically analyzes a C program to determine whether or not it violates given usage rules. The toolkit has two un ..."
Abstract - Cited by 472 (17 self) - Add to MetaCart
unique aspects: it does not require the programmer to annotate the source program (invariants are inferred); it minimizes noise (false error messages) through a process known as "counterexample-driven refinement". SLAM exploits and extends results fi'om program analysis, model checking

Synergy: A new algorithm for property checking

by Bhargav S. Gulavani, Thomas A. Henzinger, Yamini Kannan, Aditya V. Nori, Sriram K. Rajamani - In FSE 06: Proceedings of the Symposium on Foundations of Software Engineering. ACM , 2006
"... The property checking problem is to check if a program satisfies a specified safety property. Interesting programs have infinite state spaces, with inputs ranging over infinite domains, and for these pro-grams the property checking problem is undecidable. Two broad approaches to property checking ha ..."
Abstract - Cited by 129 (19 self) - Add to MetaCart
including: (1) counterexample driven re-finement approaches for verification (such as slam [2], blast [15], magic [5]), (2) directed testing approaches (such as dart [13]) and (3) partition refinement approaches (such as Paige-Tarjan [22] and Lee-Yannakakis [19]) algorithms). This paper presents a

A verification toolkit for numerical transition systems

by Hossein Hojjat, Florent Garnier, Radu Iosif, Viktor Kuncak - In Proc. of FM , 2012
"... Abstract. This paper presents a publicly available toolkit and a benchmark suite for rigorous verification of Integer Numerical Transition Systems (INTS), which can be viewed as control-flow graphs whose edges are annotated by Presburger arithmetic formulas. We present FLATA and ELDARICA, two verifi ..."
Abstract - Cited by 10 (4 self) - Add to MetaCart
verification tools for INTS. The FLATA system is based on precise acceleration of the transition relation, while the ELDARICA system is based on predicate abstraction with interpolation-based counterexample-driven refinement. The ELDARICA verifier uses the PRINCESS theorem prover as a sound and complete

AVerification Toolkit forNumerical TransitionSystems Tool Paper ⋆

by unknown authors
"... Abstract. Thispaperpresentsapubliclyavailabletoolkitandabenchmark suite for rigorous verification of Integer Numerical Transition Systems (INTS), which can be viewed as control-flow graphs whose edges are annotated by Presburger arithmetic formulas. We present FLATA and ELDARICA, two verification to ..."
Abstract - Add to MetaCart
tools for INTS. The FLATA system is based on precise acceleration of the transition relation, while the ELDARICA system is based on predicate abstraction with interpolation-based counterexample-driven refinement. The ELDARICA verifier uses the PRINCESStheorem prover as asound and complete interpolating

Proof Slicing with Application to Model Checking Web Services

by Hai Huang, Wei-tek Tsai, Raymond Paul
"... Web Services emerge as a new paradigm for distributed computing. Model checking is an important verification method to ensure the trustworthiness of composite WS. Boolean abstraction and counterexample driven refinement are major techniques for model checking software and WS. In most of the literatu ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Web Services emerge as a new paradigm for distributed computing. Model checking is an important verification method to ensure the trustworthiness of composite WS. Boolean abstraction and counterexample driven refinement are major techniques for model checking software and WS. In most

A Forward-Backward Abstraction Refinement Algorithm

by Francesco Ranzato, Olivia Rossi Doria
"... Abstract. Abstraction refinement-based model checking has become a standard approach for efficiently verifying safety properties of hardware/software systems. Abstraction refinement algorithms can be guided by counterexamples generated from abstract transition systems or by fixpoints computed in abs ..."
Abstract - Cited by 4 (0 self) - Add to MetaCart
in abstract domains. Cousot, Ganty and Raskin recently put forward a new fixpoint-guided abstraction refinement algorithm that is based on standard abstract interpretation and improves the state-of-the-art, also for counterexample-driven methods. This work presents a new fixpoint-guided abstraction refinement

Solving qbf with counterexample guided refinement

by William Klieber, Joao Marques-silva, Edmund Clarke - In SAT , 2012
"... Abstract. We propose two novel approaches for using Counterexample-Guided Abstraction Refinement (CEGAR) in Quantified Boolean Formula (QBF) solvers. The first approach develops a recursive algorithm whose search is driven by CEGAR (rather than by DPLL). The second approach employs CEGAR as an addit ..."
Abstract - Cited by 21 (6 self) - Add to MetaCart
Abstract. We propose two novel approaches for using Counterexample-Guided Abstraction Refinement (CEGAR) in Quantified Boolean Formula (QBF) solvers. The first approach develops a recursive algorithm whose search is driven by CEGAR (rather than by DPLL). The second approach employs CEGAR

Counterexample Guided Spotlight Abstraction Refinement

by Tobe Toben - Volume 5048 of LNCS , 2008
"... Abstract. This paper addresses the formal verification of distributed systems comprising a dynamically changing and potentially unbounded number of processes. We employ the spotlight principle to obtain a concise finitary abstraction of the system and devise an abstraction refinement strategy guide ..."
Abstract - Cited by 3 (1 self) - Add to MetaCart
guided by the analysis of abstract counterexamples. It turns out that the key problem for spotlight refinement is the identification of spurious counterexamples. We observe that the problem is in general undecidable, and provide a sound but incomplete method that is able to solve the problem for many
Results 1 - 10 of 21