A Computation Model for Z Based on Concurrent Constraint Resolution

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.

[1]  Gilles Kahn,et al.  Natural Semantics , 1987, STACS.

[2]  Samuel H. Valentine.  The programming language Z- , 1995, Inf. Softw. Technol..

[3]  Barry Eaglestone,et al.  Software development: two approaches to animation of Z specifications using Prolog , 1992, Softw. Eng. J..

[4]  Wolfgang Grieskamp,et al.  A Modular Framework for the Integration of Heterogeneous Notations and Tools , 1999, IFM.

[5]  S. Gerd,et al.  A calculus for higher-order concurrent constraint programming with deep guards , 1994 .

[6]  Wolfgang Grieskamp,et al.  A set based calculus and its implementation , 1999 .

[7]  Michael Hanus.  A Unified Computation Model for Declarative Programming , 1997, APPIA-GULP-PRODE.

[8]  Bharat Jayaraman,et al.  Subset Logic Programs and Their Implementation , 2000, J. Log. Program..

[9]  Xiaoping Jia.  An approach to animating Z specifications , 1995, Proceedings Nineteenth Annual International Computer Software and Applications Conference (COMPSAC'95).

[10]  Pieter H. Hartel,et al.  Benchmarking implementations of lazy functional languages , 1993, FPCA '93.

[11]  Michael Winikoff,et al.  Rapid Prototyping using Formal Specifications , 1998 .

[12]  J. Michael Spivey,et al.  The Z notation - a reference manual , 1992, Prentice Hall International Series in Computer Science.

[13]  Jonathan P. Bowen,et al.  ZUM '95: The Z Formal Specification Notation , 1995, Lecture Notes in Computer Science.

[14]  Rob Arthan.  Recursive Definitions in Z , 1998, ZUM.

[15]  Michael Hanus,et al.  The Integration of Functions into Logic Programming: From Theory to Practice , 1994, J. Log. Program..

[16]  Alexander Aiken,et al.  Solving systems of set constraints , 1992, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science.

[17]  Rafael Dueire Lins,et al.  Benchmarking implementations of functional languages with ‘Pseudoknot’, a float-intensive benchmark , 1996, Journal of Functional Programming.

[18]  Howard S. Goodman.  The Z-into-Haskell Tool-Kit: An Illustrative Case Study , 1995, ZUM.

[19]  J. Michael Spivey,et al.  Z Notation - a reference manual (2. ed.) , 1992, Prentice Hall International Series in Computer Science.

[20]  Christian Schulte,et al.  An Abstract Machine for Oz , 1995, PLILP.

[21]  M. Gordon,et al.  Introduction to HOL: a theorem proving environment for higher order logic , 1993 .

[22]  Jonathan P. Bowen,et al.  ZUM '98: The Z Formal Specification Notation , 1998 .

[23]  Agostino Dovier,et al.  A Minimality Study for Set Unification , 1997, J. Funct. Log. Program..