Book Chapter10.1007/978-3-642-24372-1_25
A lightweight approach for loop summarization
Mohamed Nassim Seghir
- 11 Oct 2011
- pp 351-365
298
TL;DR: This work uses inference rules to compute summaries of loop summaries and was able to verify safety properties for many examples which are out of the scope of several existing tools.
read more
Abstract: A problem common to most of the tools based on the abstraction refinement paradigm is the divergence of the CEGAR process. In particular, infinitely many (spurious) counterexamples may arise from unfolding the same (while- or for-) loop in the given program again and again; this leads to an infinite or at least too large sequence of refinement steps. Loop summarization is an approach that permits to overcome this problem. It consists of abstracting not just states but also the state changes (transition relation) induced by structured program statements. The effectiveness of this approach depends on two factors: (a) the computation of loop summaries must not be the bottleneck of the verification algorithm (b) loop summaries must be precise enough to prove the property of interest. We present a technique that permits to achieve both goals. It uses inference rules to compute summaries. A lightweight test is performed to check whether a given loop matches the premise of a given rule. If so, a summary is automatically inferred by instantiating the rule. Despite its simplicity, our technique performs well in practice. We were able to verify safety properties for many examples which are out of the scope of several existing tools.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
dReal: an SMT solver for nonlinear theories over the reals
Sicun Gao,Soonho Kong,Edmund M. Clarke +2 more
- 09 Jun 2013
TL;DR: The open-source tool dReal is described, an SMT solver for nonlinear formulas over the reals, which can handle various nonlinear real functions such as polynomials, trigonometric functions, exponential functions, etc.
517
Automated Verification Techniques for Probabilistic Systems
Vojtech Forejt,Marta Kwiatkowska,Gethin Norman,David Parker +3 more
- 13 Jun 2011
TL;DR: Methods to analyse Markov decision processes, which model both stochastic and nondeterministic behaviour, and a wide range of their properties, including specifications in the temporal logics PCTL and LTL, probabilistic safety properties and cost- or reward-based measures are described.
Semantically-based crossover in genetic programming: application to real-valued symbolic regression
TL;DR: This analysis leads to a conclusion that SSC is more constructive and has higher locality than SAC, NSM and SC; it believes these are the main reasons for the improved performance of SSC.
Efficient robust monitoring for STL
Alexandre Donzé,Thomas Ferrère,Oded Maler +2 more
- 13 Jul 2013
TL;DR: This paper presents an efficient algorithm for computing the robustness degree in which a piecewise-continuous signal satisfies or violates an STL formula.
Quantitative multi-objective verification for probabilistic systems
Vojtěch Forejt,Marta Kwiatkowska,Gethin Norman,David Parker,Hongyang Qu +4 more
- 26 Mar 2011
TL;DR: This work proposes and implements an efficient verification framework for analysing multiple quantitative objectives of systems that exhibit both nondeterministic and stochastic behaviour, and presents two distinct applications of it: firstly, controller synthesis subject to multiple quantitative objective verification; and, secondly, quantitative compositional verification.
References
Counterexample-guided abstraction refinement
Edmund M. Clarke
- 08 Jul 2003
TL;DR: Counterexample-guided abstraction refinement is an automatic abstraction method where the key step is to extract information from false negatives ("spurious counterexamples") due to over-approximation.
Lazy abstraction
Thomas A. Henzinger,Ranjit Jhala,Rupak Majumdar,Grégoire Sutre +3 more
- 01 Jan 2002
TL;DR: This work presents an algorithm for model checking safety properties using lazy abstraction and describes an implementation of the algorithm applied to C programs and provides sufficient conditions for the termination of the method.
1.3K
Analysis of Recursive Game Graphs Using Data Flow Equations
Kousha Etessami
- 11 Jan 2004
TL;DR: In this paper, a finite-state abstraction of a sequential program with potentially recursive procedures and input from the environment is checked statically whether there are input sequences that can drive the system into "bad/good" executions.
1.1K
The SLAM project: debugging system software via static analysis
Thomas Ball,Sriram K. Rajamani +1 more
- 01 Jan 2002
TL;DR: This work has successfully applied the SLAM toolkit to Windows XP device drivers, to both validate behavior and find defects in their usage of kernel APIs.
ACSAR: software model checking with transfinite refinement
Mohamed Nassim Seghir,Andreas Podelski +1 more
- 01 Jul 2007
TL;DR: The idea behind ACSAR is to abstract not just states but also the state changes induced by structured program statements, including for- and while-statements, which allows one to shortcut such a “transfinite” sequence of refinement steps.