Name
Abstract | ||
|---|---|---|
Z is a formal specification language combining typed set theory, predicate calculus, and a schema calculus. This paper describes an extension of Z that allows transformation and reasoning rules to be written in a Z-like notation. This gives a high-level, declarative, way of specifying transformations of Z terms, which makes it easier to build new Z manipulation tools. We describe the syntax and semantics of these rules, plus some example reasoning engines that use sets of rules to manipulate Z terms. The utility of these rules is demonstrated by discussing two sets of rules. One set defines expansion of Z schema expressions. The other set is used by the ZLive animator to preprocess Z expressions into a form more suitable for animation. |
Year | Venue | Keywords |
|---|---|---|
2010 | Chicago Journal of Theoretical Computer Science | transformation rule,z schema expression,example reasoning engine,z term,reasoning rule,predicate calculus,use set,z-like notation,preprocess z expression,new z manipulation tool,schema calculus |
DocType | Volume | Citations |
Journal | 2010 | 1 |
PageRank | References | Authors |
0.36 | 7 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mark Utting | 1 | 1 | 0.36 |
| Petra Malik | 2 | 103 | 6.47 |
| Ian Toyn | 3 | 170 | 22.66 |