![Z User Workshop, York 1991 [electronic resource] : Proceedings of the Sixth Annual Z User Meeting, York 16–17 December 1991 /](/search/themes/bootstrap3/images/libros.png)
Z User Workshop, York 1991 [electronic resource] : Proceedings of the Sixth Annual Z User Meeting, York 16–17 December 1991 /
In ordinary mathematics, an equation can be written down which is syntactically correct, but for which no solution exists. For example, consider the equation x = x + 1 defined over the real numbers; there is no value of x which satisfies it. Similarly it is possible to specify objects using the formal specification language Z [3,4], which can not possibly exist. Such specifications are called inconsistent and can arise in a number of ways. Example 1 The following Z specification of a functionf, from integers to integers "f x : ~ 1 x ~ O· fx = x + 1 (i) "f x : ~ 1 x ~ O· fx = x + 2 (ii) is inconsistent, because axiom (i) gives f 0 = 1, while axiom (ii) gives f 0 = 2. This contradicts the fact that f was declared as a function, that is, f must have a unique result when applied to an argument. Hence no suchfexists. Furthermore, iff 0 = 1 andfO = 2 then 1 = 2 can be deduced! From 1 = 2 anything can be deduced, thus showing the danger of an inconsistent specification. Note that all examples and proofs start with the word Example or Proof and end with the symbol.1.
| Main Authors: | , |
|---|---|
| Format: | Texto biblioteca |
| Language: | eng |
| Published: |
London : Springer London,
1992
|
| Subjects: | Computer science., Computer programming., Software engineering., Programming languages (Electronic computers)., Computers., Computer logic., Mathematical logic., Computer Science., Software Engineering., Theory of Computation., Programming Languages, Compilers, Interpreters., Mathematical Logic and Formal Languages., Logics and Meanings of Programs., Programming Techniques., |
| Online Access: | http://dx.doi.org/10.1007/978-1-4471-3203-5 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | In ordinary mathematics, an equation can be written down which is syntactically correct, but for which no solution exists. For example, consider the equation x = x + 1 defined over the real numbers; there is no value of x which satisfies it. Similarly it is possible to specify objects using the formal specification language Z [3,4], which can not possibly exist. Such specifications are called inconsistent and can arise in a number of ways. Example 1 The following Z specification of a functionf, from integers to integers "f x : ~ 1 x ~ O· fx = x + 1 (i) "f x : ~ 1 x ~ O· fx = x + 2 (ii) is inconsistent, because axiom (i) gives f 0 = 1, while axiom (ii) gives f 0 = 2. This contradicts the fact that f was declared as a function, that is, f must have a unique result when applied to an argument. Hence no suchfexists. Furthermore, iff 0 = 1 andfO = 2 then 1 = 2 can be deduced! From 1 = 2 anything can be deduced, thus showing the danger of an inconsistent specification. Note that all examples and proofs start with the word Example or Proof and end with the symbol.1. |
|---|