zbMATH — the first resource for mathematics

Techniques for executing and reasoning about specification diagrams. (English) Zbl 1108.68415
Rattray, Charles (ed.) et al., Algebraic methodology and software technology. 10th international conference, AMAST 2004, Stirling, Scotland, UK, July 12–16, 2004. Proceedings. Berlin: Springer (ISBN 3-540-22381-9/pbk). Lecture Notes in Computer Science 3116, 521-536 (2004).
Summary: Specification Diagrams (SD) are a graphical notation for specifying the message passing behavior of open distributed object systems. SDs facilitate specification of system behaviors at various levels of abstraction, ranging from high-level specifications to concrete diagrams with low-level implementation details. We investigate the theory of may testing equivalence on SDs, which is a notion of process equivalence that is useful for relating diagrams at different levels of abstraction. We present a semantic characterization of the may equivalence on SDs which provides a powerful technique to relate abstract specifications and refined implementations. We also describe our prototypical implementation of SDs and of a procedure that exploits the characterization of may testing to establish equivalences between finitary diagrams (without recursion).
For the entire collection see [Zbl 1053.68007].

68N30 Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.)
Full Text: DOI