Survey on Directed Model Checking

Edelkamp, Stefan; Schuppan, Viktor; Bošnački, Dragan; Wijs, Anton; Fehnker, Ansgar; Aljazzar, Husain

doi:10.1007/978-3-642-00431-5_5

Cited by 37 publications

(29 citation statements)

References 95 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As future work we would like extend the proposed techniques to support timed BIP [4] (e.g. the symbolic encoding could be extended to HYDI [15]) and, in the case of ESST we would improve its performance in finding bugs using direct model checking [19]. Finally, we will investigate the possibility to exploit the invariants computed by DFINDER in all our approaches.…”

Section: Discussionmentioning

confidence: 99%

Formal Verification of Infinite-State BIP Models

Bliudze

Cimatti

Jaber

et al. 2015

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. We propose two expressive and complementary techniques for the verification of safety properties of infinite-state BIP models. Both our techniques deal with the full BIP specification, while the existing approaches impose considerable restrictions: they either verify finite-state systems or they do not handle the transfer of data on the interactions and priorities. Firstly, we propose an instantiation of the ESST (Explicit Scheduler Symbolic Thread) framework to verify BIP models. The key insight is to apply symbolic reasoning to analyze the behavior of the system described by the BIP components, and an explicit-state search to analyze the behavior of the system induced by the BIP interactions and priorities. The combination of symbolic and explicit exploration techniques allow to benefit from abstraction, useful when reasoning about data, and from partial order reduction, useful to mitigate the state space explosion due to concurrency. Secondly, we propose an encoding from a BIP model into a symbolic, infinitestate transition system. This technique allows us to leverage the state of the art verification algorithms for the analysis of infinite-state systems. We implemented both techniques and we evaluated their performance against the existing approaches. The results show the effectiveness of our approaches with respect to the state of the art, and their complementarity for the analysis of safe and unsafe BIP models.

show abstract

Section: Discussionmentioning

confidence: 99%

Formal Verification of Infinite-State BIP Models

Bliudze

Cimatti

Jaber

et al. 2015

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…A survey on this topic is provided by Edelkamp et al [14]. In particular, directed model checking has been applied to timed systems.…”

Section: Related Workmentioning

confidence: 99%

“…Directed model checking has recently found much attention in different variants and contexts [9,12,14,19,22,23,30,32,[34][35][36][37]. For a given model M of a system, the main idea is to focus the search on those parts of the state space of M that appear to be promising to contain a reachable error state.…”

mentioning

confidence: 99%

Downward pattern refinement for timed automata

Wehrle

Kupferschmid²

2014

Int J Softw Tools Technol Transfer

View full text Add to dashboard Cite

Directed model checking is a well-established approach for detecting error states in concurrent systems. A popular variant to find shortest error traces is to apply the A * search algorithm with distance heuristics that never overestimate the real error distance. An important class of such distance heuristics is the class of pattern database heuristics. Pattern database heuristics are built on abstractions of the system under consideration. In this paper, we propose downward pattern refinement, a systematic approach for the construction of pattern database heuristics for concurrent systems of timed automata. First, we propose a general framework for pattern databases in the context of timed automata and show that desirable theoretical properties hold for the resulting pattern database. Afterward, we formally define a concept to measure the accuracy of abstractions. Based on this concept, we propose an algorithm for computing succinct abstractions that are still accurate to produce informed pattern databases. We evaluate our approach on large and complex industrial problems. The experiments show the practical potential of the resulting pattern database heuristic.

show abstract

“…Directed model checking has recently found much attention, and various distance heuristics to estimate a state's distance to a nearest error state have been proposed in this context [1][2][3][4][5][6][7][8][9]. Given a declarative description of the system under consideration, these distance heuristics are usually computed fully automatically based on abstractions.…”

Section: Related Workmentioning

confidence: 99%

“…An error state can be found by only exploring a small fraction of the entire reachable state space. Especially for this purpose, directed model checking has found much attention in recent years [1][2][3][4][5][6][7][8][9]. Directed model checking is tailored to the fast detection of reachable error states.…”

Section: Introductionmentioning

confidence: 99%

Context-Enhanced Directed Model Checking

Wehrle

Kupferschmid

2010

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Directed model checking is a well-established technique to efficiently tackle the state explosion problem when the aim is to find error states in concurrent systems. Although directed model checking has proved to be very successful in the past, additional search techniques provide much potential to efficiently handle larger and larger systems. In this work, we propose a novel technique for traversing the state space based on interference contexts. The basic idea is to preferably explore transitions that interfere with previously applied transitions, whereas other transitions are deferred accordingly. Our approach is orthogonal to the model checking process and can be applied to a wide range of search methods. We have implemented our method and empirically evaluated its potential on a range of non-trivial case studies. Compared to standard model checking techniques, we are able to detect subtle bugs with shorter error traces, consuming less memory and time.

show abstract

Survey on Directed Model Checking

Cited by 37 publications

References 95 publications

Formal Verification of Infinite-State BIP Models

Formal Verification of Infinite-State BIP Models

Downward pattern refinement for timed automata

Context-Enhanced Directed Model Checking

Contact Info

Product

Resources

About