Guards, preconditions, and refinement in Z

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1878, Issue , 2000, Pages 286-303

  Miarka, Ralph ^a   Boiten, Eerke ^a   Derrick, John ^a  

^a UNIVERSITY OF KENT   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

SEMANTICS;

DON'T-CARES; NON DETERMINISM; OPERATION REFINEMENT; PARTIAL RELATIONS; THREE-VALUED; TRUTH VALUES; UNDERSPECIFICATION; Z SPECIFICATIONS;

FORMAL SPECIFICATION;

EID: 23044517946     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44525-0_17     Document Type: Conference Paper

References (15)

1. J.-R. Abrial. The B-Book: Assigning Programs to Meanings. Cambridge University Press, 1996.
2. Jonathan P. Bowen, Andreas Fett, and Michael G. Hinchey, editors. ZUM '98: The Z Formal Specification Notation, Proceedings of the 11th International Conference of Z Users. Lecture Notes in Computer Science 1493. Springer Verlag, Berlin Heidelberg New York, September 1998.
3. H. Doornbos. A relational model of programs without the restriction to Egli-Milner constructs. In E.-R. Olderog, editor, PROCOMET '94, pages 357-376. IFIP, 1994.
4. Clemens Fischer. CSP-OZ: A Combination of Object-Z and CSP. Technical Report TRCF-97-2, Universitat Oldenburg, Fachbereich Informa-tik, PO Box 2503, 26111 Oldenburg, Germany, April 1997. Online: http://theoretica.Informatik.Uni-Oldenburg.DE/~fischer/techreports.html (last access 10/01/2000).
5. Clemens Fischer. How to Combine Z with Process Algebra. In Bowen et al. [2], pages 5-23.
6. Eric C., R. Hehner. A practical theory of programming. Springer Verlag, 1993.
7. Eric C., R. Hehner. Specifications, programs, and total correctness. Science of Computer Programming, 34(3):191-205, July 1999. Online http://www.elsevier.com/cas/tree/store/scico/sub/1999/34/3/563.pdf (last access: 09/05/2000).
8. C. A. R. Hoare and He Jifeng. Unifying Theories of Programming. Prentice Hall, 1998.
9. Mark B. Josephs. Specifying reactive systems in Z. Technical Report PRG-19-91, Programming Research Group, Oxford University Computing Laboratory, 1991.
10. K. Lano, J. Bicarregui, J. Fiadeiro, and A. Lopes. Specification of Required Non-determinism. In John Fitzgerald, Cliff B. Jones, and Peter Lucas, editors, FME'97: Industrial Applications and Strengthened Foundations of Formal Methods (Proc. 4th Intl. Symposium of Formal Methods Europe, Graz, Austria, September 1997), Lecture Notes in Computer Science 1313, pages 298-317. Springer-Verlag, September 1997.
11. J. M. Spivey. The Z Notation: A Reference Manual. Prentice-Hall International Series in Computer Science. Prentice-Hall International (UK) Ltd., 2nd edition, 1992. Online: http://spivey.oriel.ox.ac.uk/~mike/zrm/index.html (last access 26/07/1998).
12. M.W.A. Steen, H. Bowman, J. Derrick, and E.A. Boiten. Disjunction of LOTOS specifications. In T. Mizuno, N. Shiratori, T. Higashino, and A. Togashi, editors, Formal Description Techniques and Protocol Specification, Testing and Verification: FORTE X/PSTV XVII '97, pages 177-192, Osaka, Japan, November 1997. Chapman & Hall. Online: http://www.cs.ukc.ac.uk/pubs/1997/350 (last access: 20/01/2000).
13. Ben Strulo. How Firing Conditions Help Inheritance. In Jonathan P. Bowen and Michael G. Hinchey, editors, ZUM'95: The Formal Specification Notation, Lecture Notes in Computer Science 967, pages 264-275. Springer Verlag, 1995.
14. Ian Toyn. Z Notation: Final Committee Draft, CD 13568.2, August24 1999. Online: http://www.cs.york.ac.uk/~ian/zstan/(last access 09/05/2000).
15. S. H. Valentine. Inconsistency and Undefinedness inZ-A Practical Guide. In Bowen et al. [2], pages 233-249.