Flat Acceleration in Symbolic Model Checking

Bardin, Sébastien; Finkel, Alain; Leroux, Jérôme; Schnoebelen, Philippe

doi:10.1007/11562948_35

Cited by 68 publications

(99 citation statements)

References 34 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Herein, we show decidability of model checking FOCTL (Pr) over ACS and we propose a complete semi-algorithm for model checking FOLTL(Pr) formulae over trace-flattable PCS, extending what is done in [BFLS05] for post*-flattable PCS.…”

Section: Model-checking Flattable Counter Systemsmentioning

confidence: 89%

“…In this section, we provide the basis to understand how our results on ACS can be used to verify more general classes of PCS and under which hypotheses (see also Section 5.2). The most standard way to reduce a PCS to an ACS is via a graph homomorphism, aka a flattening [BFLS05].…”

Section: Model-checking For Three Main Classes Of Flattable Systemsmentioning

confidence: 99%

“…As a first step, heuristics implemented in FAST can be used, see e.g. [BFLS05]. The semi-algorithm model-check extends the underlying FAST algorithm [BFLS05] to trace-flattable Presburger counter systems and LTL temporal properties which paves the way to design the new generation of the tool.…”

Section: Model-checking Of Trace-flattable Counter Systemsmentioning

confidence: 99%

“…[BFLS05]. The semi-algorithm model-check extends the underlying FAST algorithm [BFLS05] to trace-flattable Presburger counter systems and LTL temporal properties which paves the way to design the new generation of the tool. Using previous results shown in the paper, we can establish the following key result of the paper.…”

Section: Model-checking Of Trace-flattable Counter Systemsmentioning

confidence: 99%

“…Transition systems defined by Presburger relations provide a large natural class of infinite-state transition systems [BFLS05], suitable for modeling in various applications such as TTP Protocol (embedded system) [BFL04] and broadcast protocols [EFM99], to quote a few examples. Important cases of such transition systems with computable reachability have been established in [Iba78,FO97,CJ98,FL02].…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Towards a Model-Checker for Counter Systems

Demri

Finkel

Goranko

et al. 2006

Automated Technology for Verification and Analysis

View full text Add to dashboard Cite

Abstract. This paper deals with model-checking of fragments and extensions of CTL* on infinite-state Presburger counter systems, where the states are vectors of integers and the transitions are determined by means of relations definable within Presburger arithmetic. We have identified a natural class of admissible counter systems (ACS) for which we show that the quantification over paths in CTL* can be simulated by quantification over tuples of natural numbers, eventually allowing translation of the whole Presburger-CTL* into Presburger arithmetic, thereby enabling effective model checking. We have provided evidence that our results are close to optimal with respect to the class of counter systems described above. Finally, we design a complete semi-algorithm to verify first-order LTL properties over trace-flattable counter systems, extending the previous underlying FAST semi-algorithm to verify reachability questions over flattable counter systems.

show abstract

Section: Model-checking Flattable Counter Systemsmentioning

confidence: 89%

Section: Model-checking For Three Main Classes Of Flattable Systemsmentioning

confidence: 99%

Section: Model-checking Of Trace-flattable Counter Systemsmentioning

confidence: 99%

Section: Model-checking Of Trace-flattable Counter Systemsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Towards a Model-Checker for Counter Systems

Demri

Finkel

Goranko

et al. 2006

Automated Technology for Verification and Analysis

View full text Add to dashboard Cite

show abstract

FAST Extended Release

Bardin

Leroux

Point

2006

Computer Aided Verification

Self Cite

View full text Add to dashboard Cite

Fast is a tool designed for the analysis of counter systems, i.e. automata extended with unbounded integer variables. Despite the reachability set is not recursive in general, Fast implements several innovative techniques such as acceleration and circuit selection to solve this problem in practice. In its latest version, the tool is built upon an open architecture: the Presburger library is manipulated through a clear and convenient interface, thus any Presburger arithmetics package can be plugged to the tool. We provide four implementations of the interface using Lash, Mona, Omega and a new shared automata package with computation cache. Finally new features are available, like different acceleration algorithms.

show abstract