Type-Constrained Generics for Z

13 years 8 months ago

Download www-users.cs.york.ac.uk

We propose an extension to Z whereby generic parameters may have their types partially constrained. Using this mechanism it becomes possible to dene in Z much of its own schema calculus and renement rules.

Samuel H. Valentine, Ian Toyn, Susan Stepney, Stev

Real-time Traffic

Formal Methods | Generic Parameters | Schema Calculus | ZUM 2000 |

claim paper

Related Content

» Systems Development Using Z Generics

» Towards a Generic Multiagent Model for Decision Support Two Case Studies

» AENEID a generic lithographyfriendly detailed router based on postRET data learning and ho...

» Remarks on Cheons Algorithms for PairingRelated Problems

» Guided Navigation in TaskOriented 3D Graph Visualizations

» New Signature Schemes with Coupons and Tight Reduction

» Short and Stateless Signatures from the RSA Assumption

» Projective Coordinates Leak

» Building Formal Method Tools in the IsabelleIsar Framework

Post Info
More Details (n/a)

Added	26 Aug 2010
Updated	26 Aug 2010
Type	Conference
Year	2000
Where	ZUM
Authors	Samuel H. Valentine, Ian Toyn, Susan Stepney, Steve King

Comments (0)

Sciweavers

Type-Constrained Generics for Z

Formal Methods | Generic Parameters | Schema Calculus | ZUM 2000 |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers