Expand, Enlarge and Check... Made Efficient

Geeraerts, Gilles; Raskin, Jean-François; Begin, Laurent Van

doi:10.1007/11513988_38

Cited by 13 publications

(9 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The method of [21,20] and its reformulated, generic version of [19] are in principle similar to ours. They come with a complete method for well-quasi ordered systems which is an alternative to backward reachability analysis based on a forward exploration.…”

Section: Related Workmentioning

confidence: 81%

All for the Price of Few

Abdulla

Haziza

Holík

2013

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. We present a simple and efficient framework for automatic verification of systems with a parameteric number of communicating processes. The processes may be organized in various topologies such as words, multisets, rings, or trees. Our method needs to inspect only a small number of processes in order to show correctness of the whole system. It relies on an abstraction function that views the system from the perspective of a fixed number of processes. The abstraction is used during the verification procedure in order to dynamically detect cut-off points beyond which the search of the state space need not continue. We show that the method is complete for a large class of well quasi-ordered systems including Petri nets. Our experimentation on a variety of benchmarks demonstrate that the method is highly efficient and that it works well even for classes of systems with undecidable verification problems.

show abstract

Section: Related Workmentioning

confidence: 81%

All for the Price of Few

Abdulla

Haziza

Holík

2013

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…Petri nets: Many data structures and algorithms have been proposed for their efficient analysis and coverability checking [15,11,8]. Most of these algorithms suffer, however, from an intractable number of vector elements after the translation from (Boolean) programs: one per local program state.…”

Section: Related Workmentioning

confidence: 99%

“…The PEP tool is a popular coverability checker [16] that takes as input a variety of languages such as B(P N ) 2 and SDL. A more recent tool implements the Expand, Enlarge and Check algorithms due to Geeraerts et al [15]. Furthermore, Petri net/VASS analysis has been applied to Java programs [7] and Boolean programs [2].…”

Section: Related Workmentioning

confidence: 99%

Dynamic Cutoff Detection in Parameterized Concurrent Programs

Kaiser

Kroening

Wahl

2010

Lecture Notes in Computer Science

100

View full text Add to dashboard Cite

Abstract. The verification problem for parameterized concurrent programs is a grand challenge in computing. We consider the class of finitestate programs executed by an unbounded number of replicated threads, which is essential in concurrent software verification using predicate abstraction. While the reachability problem for this class is decidable, existing algorithms are of limited use in practice, due to an exponential-space lower bound. In this paper, we present an alternative method based on a reachability cutoff : a number n of threads that suffice to generate all reachable program locations. We give a sufficient condition, verifiable dynamically during the reachability analysis, that allows us to conclude that n is a cutoff. We then make the method complete, using a lean backward coverability analysis. We demonstrate the efficiency of the approach on Petri net encodings of communication protocols, as well as on non-recursive Boolean programs run by arbitrarily many parallel threads.

show abstract

“…However the superset obtained in the end may not be tight enough to decide the property. We can cite the classic tool Hytech [1], as well as the abstract-check and refine technique of Raskin et al [44] to compute iteratively covering trees of monotonic Petri nets.…”

Section: Other Tools For Counter Systemsmentioning

confidence: 99%

FAST: acceleration from theory to practice

Bardin

Finkel

Leroux

et al. 2008

Int J Softw Tools Technol Transfer

View full text Add to dashboard Cite

International audienceFast acceleration of symbolic transition systems (Fast) is a tool for the analysis of systems manipulating unbounded integer variables. We check safety properties by computing the reachability set of the system under study. Even if this reachability set is not necessarily recursive, we use innovative techniques, namely symbolic representation, acceleration and circuit selection, to increase convergence. Fast has proved to perform very well on case studies. This paper describes the tool, from the underlying theory to the architecture choices. Finally, Fast capabilities are compared with those of other tools. A range of case studies from the literature is investigated

show abstract

Expand, Enlarge and Check... Made Efficient

Cited by 13 publications

References 12 publications

All for the Price of Few

All for the Price of Few

Dynamic Cutoff Detection in Parameterized Concurrent Programs

FAST: acceleration from theory to practice

Contact Info

Product

Resources

About