Combining model checking and deduction for I/O- automata

Müller, Olaf; Nipkow, Tobias

doi:10.1007/3-540-60630-0_1

Cited by 34 publications

(20 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, the novelty here is that the existing concepts are transferred to the formalism of statecharts that (a) enable to structure the state space and (b) contain data. While there is some work on mechanical analysis of transition systems containing data using abstraction techniques [MN95] and some mechanizations of statecharts, e.g. [BW98], we are not aware of any work dedicated to the statecharts formalism combining theorem proving and model checking.…”

Section: Discussionmentioning

confidence: 99%

Structure Preserving Data Abstractions for Statecharts

Helke

Kammüller

2005

Formal Techniques for Networked and Distributed Systems - FORTE 2005

View full text Add to dashboard Cite

Abstract. Hierarchical automata (HAs) represent a structured model of statecharts previously formalized in Isabelle/HOL. The present work extends this framework by an abstraction technique for HAs defined on infinite data spaces. This structure preserving abstraction enables the connection of the framework to the model checker SMV. This paper reports on the following results (a) We discuss abstractions of sequential automata, from which HAs are composed. Here we focus on the special problems of synchronous models and examine the feasibility of constructions for over-and underapproximations in order to preserve CTL properties. (b) Based on this results we describe a compositional abstraction technique, which can be applied to HAs. (c) We extend the formalization of HAs in Isabelle/HOL by suitable operators to construct abstractions inside the logic. (d) We present an efficient implementation of the abstraction process outside of the logic, which is integrated in the formalization by the oracle interface of Isabelle.

show abstract

Section: Discussionmentioning

confidence: 99%

Structure Preserving Data Abstractions for Statecharts

Helke

Kammüller

2005

Formal Techniques for Networked and Distributed Systems - FORTE 2005

View full text Add to dashboard Cite

show abstract

“…For instance, the Ptolemy approach (Eker et al, 2003) introduces a general way to combine heterogeneous models of embedded systems. A prominent example of integration of verification techniques is a combination of Model Checking and Deduction for I/O-Automata done by Müller and Nipkow (1995).…”

Section: Semi-automatic Formal Verificationmentioning

confidence: 99%

Formal-Based Framework for Analysis of Logical Architecture

Spichkova¹,

Schmidt²

2015

STSC

View full text Add to dashboard Cite

This paper presents a formal framework for modeling and analysis of data and control flow dependencies between components or services within remotely deployed distributed systems. This work aims at elaborating for a concrete system, which parts of the system (or system model) are necessary to check a given property. The approach allows services and components decomposition oriented towards efficient checking of system properties as well as analysis of dependencies within a system: after analysis of the logical architecture of the system, an optimized architecture is developed following the specified algorithm. One of the key features of this approach is a semi-automatic support of the presented ideas on verification level.

show abstract

“…in [5][6][7][8][9][10]. These methods are, like ours, all based on proving the existence of some kind of 'mimicing' relation from concrete system models to abstract ones.…”

Section: Related Workmentioning

confidence: 99%

A proof of burns N-process mutual exclusion algorithm using abstraction

Jensen

Lynch

1998

Tools and Algorithms for the Construction and Analysis of Systems

View full text Add to dashboard Cite

Abstract. Within the Input/Output Automata framework, we state and prove a general abstraction theorem giving conditions for preservation of safety properties from one automaton to another. We use our abstraction theorem to verify that Burns distributed mutual exclusion algorithm parameterized in the number of processes n satisfies the mutual exclusion property. The concrete n-process algorithm is abstracted by a simple 2-process algorithm which is property preserving with respect to the mutual exclusion property. The condition for property preservation is proved to be satisfied by use of the LP theorem prover with a minimum of user assistance, and the 2-process abstraction is automatically verified using the SPIN model checker.

show abstract

Combining model checking and deduction for I/O- automata

Cited by 34 publications

References 12 publications

Structure Preserving Data Abstractions for Statecharts

Structure Preserving Data Abstractions for Statecharts

Formal-Based Framework for Analysis of Logical Architecture

A proof of burns N-process mutual exclusion algorithm using abstraction

Contact Info

Product

Resources

About