Formal Specification Using Z by David Lightfoot

By David Lightfoot

Formal specification is a method for specifying what's required of a working laptop or computer process in actual fact, concisely and with out ambiguity. Z is a number one notation for formal specification.
Formal Specification utilizing Z is an introductory publication meant for the numerous software program engineers and scholars who will reap the benefits of studying approximately this crucial subject in software program engineering. it's meant for non-mathematicians, and it introduces the tips in a positive variety, development every one new proposal at the ones already coated. every one bankruptcy is through a suite of workouts, and pattern strategies are supplied for all of those in an appendix.

Show description

Read or Download Formal Specification Using Z PDF

Best systems analysis & design books

Architectures for E-Business Systems: Building the Foundation for Tomorrow's Success

As dot. com businesses grapple with inflexible marketplace stipulations and we maintain listening to how the massive expertise avid gamers are being punished on Wall road, it turns into effortless to consider the web as a fad. the web frenzy could have subsided, yet curiosity within the web as a enterprise and advertising software continues to be powerful.

Operating System Concepts, 6th Edition

Celebrating its twentieth anniversary, Silberschatz: working structures options, 6th version, keeps to supply an excellent theoretical origin for figuring out working structures. The 6th version deals superior conceptual insurance and additional content material to bridge the space among recommendations and real implementations.

Additional info for Formal Specification Using Z

Example text

This example concerns recording the passengers aboard an aircraft. There are no seat numbers, passengers are allowed aboard on a firstcome-first-served basis, and the aircraft has a fixed capacity. The only basic type involved here is the set of all possible persons, called PERSON. [PERSON) the set of all possible uniquely identified persons Normally people are identified by name and the possibility of two or more persons having the same name poses difficulties. For this example people are assumed to be identified uniquely; for example, by identitycard number or passport number.

Implication The implication operator is pronounced "implies" or "if ... then" as in "P implies Q" or "if P then Q" and is written: Given propositions P and Q, the truth table for implication is: p Q P~Q false false true false true true true false false true true true The proposition P :=:} Q is false only when P is true and Q is false. P v a This is useful for removing implications when manipulating expressions. Equivalence The equivalence operator is pronounced "is equivalent to" or "if and only if' and is written: Logic: propositional calculus 31 <=> Given propositions P and Q, the truth table for equivalence is: p Q P<::::>Q false false true false true false true false false true true true The proposition P ~ Q is true only when P is the same as Q.

Furthermore it is possible to have a schema with no predicate part. In this case the schema would simply declare a new observation or observations without applying a constraining predicate. An observation introduced by a schema is local to that schema and may only be referenced in another schema by explicitly including the observation's defining schema. This is sometimes inconvenient and it is also possible to introduce observations which are available throughout the specification. These are known as global observations and are introduced by an axiomatic definition.

Download PDF sample

Rated 4.42 of 5 – based on 45 votes