µ-Chart-Based Specification and Refinement

Authors:
Doug Goldson;Greg Reeve;Steve Reeves
Affiliations:
-;-;-
Venue:
ICFEM '02 Proceedings of the 4th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
Year:
2002

Citing 8
Cited 1

Communicating sequential processes

Communicating sequential processes
Statecharts: A visual formalism for complex systems

Science of Computer Programming
The Z notation: a reference manual

The Z notation: a reference manual
The Theory and Practice of Concurrency

The Theory and Practice of Concurrency
Formal Verification of Statecharts with Instantaneous Chain Reaction

TACAS '97 Proceedings of the Third International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Compositional Specification of Embedded Systems with Statecharts

TAPSOFT '97 Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
The Z/EVES System

ZUM '97 Proceedings of the 10th International Conference of Z Users on The Z Formal Specification Notation
mu-Charts and Z: Hows, Whys, and Wherefores

IFM '00 Proceedings of the Second International Conference on Integrated Formal Methods

Refinement for User Interface Designs

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce two new notions of refinement for 碌-charts and compare them with the existing notion due to Scholz. The two notions are interesting and important because one gives rise (via a logic) to a calculus for constructing refinements and the other gives rise (via model checking) to a way of checking that refinements hold. Thus we bring together the two competing worlds of model checking and proof.