ion/refinement solvers1 Andreas Bauer , Martin Leucker , Christian Schallhart , Michael Tautschnig Computer Sciences Laboratory, Australian National University Institut f
Andreas Bauer 0002, Martin Leucker, Christian Scha...
Abstract. Partial order reduction limits the state explosion problem that arises in model checking by limiting the exploration of redundant interleavings. A state space search algo...
Abstract. We report here on an experimental investigation of LTL satisfiability checking via a reduction to model checking. By using large LTL formulas, we offer challenging model-...
We present a model of the IEEE 1394 Root Contention Protocol with a proof of Safety. This model has real-time properties which are expressed in the language of the event B method: ...
Event-B is a formal method for system-level modelling and analysis. Key features of Event-B are the use of set theory as a modelling notation, the use of ent to represent systems a...
Jean-Raymond Abrial, Michael J. Butler, Stefan Hal...
Tool support for the Java Modeling Language (JML) is a very pressing problem. A main issue with current tools is their architecture: the cost of keeping up with the evolution of Ja...
Patrice Chalin, Robby, Perry R. James, Jooyong Lee...
Abstract. Runtime (dynamic) model checking is a promising verification methodology for real-world threaded software because of its many features, the prominent ones being: (i) it ...
This article proposes a case study to evaluate the suitability of graph transformation tools for program refactoring. In order to qualify for this purpose, a graph transformation s...