TY  - GEN
AU  - Woodcock,Jim
AU  - Davies,Jim
TI  - Using Z: specification, refinement, and proof 
SN  - 0139484728 (pbk. : alk. paper)
U1  - 005.12,WOO 
PY  - 1996///
CY  - London, New York
PB  - Prentice Hall
KW  - Z (Computer program language)
N1  - Introduction (Page-1), Propositional Logic (Page-9), Predicate Logic (Page-27),Equality and Definite Description (Page-45), Set (Page-57), Definitions (Page-73), Relations (Page-83), Functions (Page-99), Sequences (Page-115), Free Types (Page-133), Sachems (Page-147), Schema Operators (Page-165), Promotions (Page-185), Preconditions (Page-201),A file System (Page-217), Data Refinement (Page-233), Data Refinement and Sachems (Page-257), Functional Refinement (Page-283), Refinement Calculus (Page-2978), A telecommunications Protocol (Page-321), An Operating System Scheduler (Page-331), A Bounded Buffer Module (Page-347), A Save Area (Page-365).
ER  -