A Computation Model for Z Based on Concurrent Constraint Resolution

Authors:
Wolfgang Grieskamp
Affiliations:
-
Venue:
ZB '00 Proceedings of the First International Conference of B and Z Users on Formal Specification and Development in Z and B
Year:
2000

Citing 8
Cited 4

Natural semantics

4th Annual Symposium on Theoretical Aspects of Computer Sciences on STACS 87
The Z notation: a reference manual

The Z notation: a reference manual
Software development: two approaches to animation of Z specifications using Prolog

Software Engineering Journal
Introduction to HOL: a theorem proving environment for higher order logic

Introduction to HOL: a theorem proving environment for higher order logic
An Abstract Machine for Oz

PLILPS '95 Proceedings of the 7th International Symposium on Programming Languages: Implementations, Logics and Programs
The Z-into-Haskell Tool-Kit: An Illustrative Case Study

ZUM '95 Proceedings of the 9th International Conference of Z Usres on The Z Formal Specification Notation
A Modular Framework for the Integration of Heterogeneous Notations and Tools

IFM '99 Proceedings of the 1st International Conference on Integrated Formal Methods
Recursive Definitions in Z

ZUM '98 Proceedings of the 11th International Conference of Z Users on The Z Formal Specification Notation

CLPS-B - A Constraint Solver for B

TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Model Checking Object-Z Using ASM

IFM '02 Proceedings of the Third International Conference on Integrated Formal Methods
Automatic and efficient simulation of operation contracts

GPCE '10 Proceedings of the ninth international conference on Generative programming and component engineering
Compiling formal specifications to oz programs

MOZ'04 Proceedings of the Second international conference on Multiparadigm Programming in Mozart/Oz

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a computation model for Z, which is based on a reduction to a small calculus, called µZ, and on concurrent constraint resolution techniques applied for computing in this calculus. The power of the model is comparable to that of functional logic languages, and combines the strength of higher-order functional computation with logic computation. The model is implemented as part of the ZETA system, where it is used for executing Z specifications for the purpose of testdata evaluation and prototyping.