Combined formal refinement and model checking for real-time systems verification

Authors:
Alexander Krupp;Wolfgang Mueller;Ian Oliver
Affiliations:
Paderborn University, Paderborn, Germany;Paderborn University, Paderborn, Germany;Nokia Research Centre, Helsinki, Finland
Venue:
Languages for system specification
Year:
2004

Citing 7
Cited 0

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
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic

Logic of Programs, Workshop
Model Driven Embedded Systems

ACSD '03 Proceedings of the Third International Conference on Application of Concurrency to System Design
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a framework, which combines model checking and theorem prover based refinement for real-time systems design focusing on the refinement of non deterministic to timed deterministic finite state machines. Our verification flow starts from a cycle accurate finite state machine for the RAVEN model checker. We present a translation, which transforms the model into efficient B language code. After refining the RAVEN model and annotating it, the time accurate model is also translated to B so that the B theorem prover can verify the refined model almost automatically. The approach is introduced by the example of a mobile phone echo cancellation unit.