Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

34

ZUM
2000
Springer

favoriteEmaildiscussreport

93views Formal Methods» more ZUM 2000»

A Computation Model for Z Based on Concurrent Constraint Resolution

14 years 2 months ago

A Computation Model for Z Based on Concurrent Constraint Resolution

Download research.microsoft.com

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 test-data evaluation and prototyping.

Wolfgang Grieskamp

Real-time Traffic

Computation Model | Concurrent Constraint Resolution | Formal Methods | Functional Logic Languages | ZUM 2000 |

claim paper

Related Content

» Using Use Cases in Executable Z

» Encoding Temporal Logics in Executable Z A Case Study for the ZETA System

» An Overview of RoZ A Tool for Integrating UML and Z Specifications

» Concurrent ConstraintBased Memory Machines A Framework for Java Memory Models

» What Do Semantics Matter When the Meat Is Overcooked

» Volume contact constraints at arbitrary resolution

» Concurrent Constraint Programming

» A Distributed and Probabilistic Concurrent Constraint Programming Language

» Declarative Concurrency in Java

Post Info
More Details (n/a)

Added	26 Aug 2010
Updated	26 Aug 2010
Type	Conference
Year	2000
Where	ZUM
Authors	Wolfgang Grieskamp

Comments (0)