Formal Refinement and Model Checking of an Echo Cancellation Unit

Authors:
Alexander Krupp;Wolfgang Mueller;Ian Oliver
Affiliations:
-;-;-
Venue:
Proceedings of the conference on Design, automation and test in Europe - Volume 3
Year:
2004

Citing 5
Cited 1

A computational logic handbook

A computational logic handbook
An Approach to Combining B and Alloy

ZB '02 Proceedings of the 2nd International Conference of B and Z Users on Formal Specification and Development in Z and B
Reactive Modules

LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
STeP: The Stanford Temporal Prover

STeP: The Stanford Temporal Prover
Model checking and theorem proving: a unified framework

Model checking and theorem proving: a unified framework

Specialization and validation of statecharts in OWL

EKAW'10 Proceedings of the 17th international conference on Knowledge engineering and management by the masses

Quantified Score

Hi-index	0.00

Visualization

Abstract

This article presents an approach, which combines theorem proving-based refinement with model checking for state based real-time systems. Our verification flow starts from UML state diagrams, which are translated to the formal B language and are model checked for real-time properties. By means of the B language and a B theorem prover, refined state diagrams are verified against their abstract representation. The approach is presented by means of the refinement of a digital echo cancellation unit.