z-logo
open-access-imgOpen Access
An Automated Approach for the Interpretation of Counter-Examples
Author(s) -
Lionel van den Berg,
Paul Strooper,
Wendy Johnston
Publication year - 2007
Publication title -
electronic notes in theoretical computer science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.242
H-Index - 60
ISSN - 1571-0661
DOI - 10.1016/j.entcs.2006.12.027
Subject(s) - model checking , computer science , debugging , abstract interpretation , set (abstract data type) , state space , domain (mathematical analysis) , state (computer science) , counterexample , interpretation (philosophy) , programming language , abstraction model checking , theoretical computer science , mathematics , discrete mathematics , mathematical analysis , statistics
Model checking is an automatic technique used for the verification of finite systems. A model checker explores the full state space of a given model and checks it against a set of requirements. If a state exists in which a requirement is not satisfied most tools will generate a counter-example. Counter-examples are useful for debugging a model and determining if an error exists in the modelled system. However, they can be difficult for end users to understand and this may limit the take-up of model checking in industry.This paper describes a domain-specific approach to automatically interpreting counter-examples and presenting the results in an intuitive form to the end user. Our research extends previous work on model checking railway signalling control tables with signalling engineers from Queensland Rail

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom