Debugging of Behavioural Models using Counterexample Analysis
- 7 May 2019
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Software Engineering
- Vol. 47 (6) , 1184-1197
Abstract
Model checking is an established technique for automatically verifying that a model satisfies a given temporal property. When the model violates the property, the model checker returns a counterexample, which is a sequence of actions leading to a state where the property is not satisfied. Understanding this counterexample for debugging the specification is a complicated task for several reasons: (i) the counterexample can contain a large number of actions, (ii) the debugging task is mostly achieved manually, and (iii) the counterexample does not explicitly highlight the source of the bug that is hidden in the model. This article presents a new approach that improves the usability of model checking by simplifying the comprehension of counterexamples. To do so, we first extract in the model all the counterexamples. Second, we define an analysis algorithm that identifies actions that make the model skip from incorrect to correct behaviours, making these actions relevant from a debugging perspective. Third, we develop a set of abstraction techniques to extract these actions from counterexamples. Our approach is fully automated by a tool we implemented and was applied on real-world case studies from various application areas for evaluation purposes.Keywords
This publication has 24 references indexed in Scilit:
- Mining Sequential Patterns to Explain Concurrent Counterexamples2013
- CADP 2011: a toolbox for the construction and analysis of distributed processesInternational Journal on Software Tools for Technology Transfer, 2012
- Causality Analysis in Contract ViolationLecture Notes in Computer Science, 2010
- A Model Checking Language for Concurrent Value-Passing Systems2008
- Error explanation with distance metricsInternational Journal on Software Tools for Technology Transfer, 2005
- Concurrency and automata on infinite sequences2005
- Minimal Assignments for Bounded Model Checking2004
- CloSpan: Mining: Closed Sequential Patterns in Large Datasets2003
- Fate and FreeWill in Error TracesLecture Notes in Computer Science, 2002
- Model Checking2001