Skip to main content
SpringerLink
Log in

An analysis of refinement in an abortive paradigm

  • Original Article
  • Published:
Formal Aspects of Computing

Abstract

This paper presents a new strand of investigation which complements our previous investigation of refinement for specifications whose semantics is given by partial relations (using Z as a linguistic vehicle for this semantics). It revolves around extending our mathematical apparatus so as to continue our quest for examining mathematically the essence of the lifted-totalisation semantics (which underlies the de facto standard notion of refinement in Z) and the role of the semantic elements\(\perp\) in model-theoretic refinement, but this time in the abortive paradigm. The analysis is given in two salient parts. In the first part, we consider the simpler framework of operation-refinement: we examine the (de facto) standard account of operation-refinement in this regime by introducing a simpler, normative theory which captures the notion of firing-conditions refinement directly in the language and in terms of the natural properties of preconditions and postconditions. In the second part, we generalise our analysis to a more intricate investigation of simulation-based data-refinement. The proof-theoretic approach we undertake in the formal analysis provides us with a mathematical apparatus which enables us to examine precisely the relationships amongst the various theories of refinement. This enables us to examine the general mathematical role that the \(\perp\) values play in model-theoretic refinement in the abortive paradigm, as well as the significance of the unique interaction of these values with the notions of lifting (of data simulations) and lifted-totalisation (of operations) in this regime. Furthermore, we generalise this mathematical analysis to a more conceptual one which also involves extreme specifications.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Abrial JR (1996) The B-Book. Cambridge University Press, Cambridge

    MATH  Google Scholar 

  2. Azada D, Muenchaisri P, (ed.) (2003) APSEC 2003: 10th Asia-Pacific software engineering conference, Chiangmai, Thailand, December 10-12, 2003. Proceedings. IEEE Computer Society Press

  3. Bowen JP, Dunne SE, Galloway A, King S (ed.) (2000) ZB 2000: Formal specification and development in Z and B, first international conference of B and Z users, York, UK, August 29–September 2, 2000, Proceedings, vol 1878 of Lecture Notes in Computer Science. Springer, Berlin Heidelberg New York

  4. Boiten EA, de Roever WP (2003) Getting to the bottom of relational refinement: relations and correctness, partial and total. In: Berghammer R, Mö ller B, (eds) RelMiCS 7: 7th international seminar on relational methods in computer science, Malente, Germany, 12–17 May, Proceedings. pp. 82–88 University of Kiel

  5. Bolton C, Davies J, Woodcock JCP (1999) On the refinement and simulation of data types and processes. In: Araki K, Galloway A, Taguchi K, (eds). Integrated formal methods (IFM ’99). Springer, Berlin Heidelberg New York

  6. Bowen JP, Fett A, Hinchey MG (eds) (1998) ZUM ’98: The Z formal specification notation, 11th international conference of Z users, Berlin, Germany, September 24–26, 1998, Proceedings, vol 1493 of Lecture Notes in Computer Science. Springer, Berlin Heidelberg New York

  7. Bjørner D, Hoare CAR, Langmaack H (1990) (eds) VDM ’90, VDM and Z – Formal methods in software development, third international symposium of VDM Europe, Kiel, FRG, April 17–21, 1990, Proceedings, vol 428 of Lecture Notes in Computer Science. Springer, Berlin Heidelberg New York

  8. Back RJR, von Wright J (1998) Refinement Calculus: a Systematic Introduction. Springer, Berlin Heidelberg New York

    MATH  Google Scholar 

  9. Cavalcanti ALC, Woodcock JCP (1997) A weakest precondition semantics for Z. Technical Monograph PRG-TR-16-97. Oxford University Computing Laboratory, Oxford

  10. Derrick J, Boiten EA (1999) Calculating upward and downward simulations of state-based specifications. Inf Softw Technol 41:917–923

    Article  Google Scholar 

  11. Derrick J, Boiten EA (2001) Refinement in Z and Object-Z: foundations and advanced applications. Formal approaches to computing and information technology – FACIT. Springer, Berlin Heidelberg New York

  12. Derrick J, Boiten EA (eds) (2005) REFINE 2005 international workshop, Electronic Notes in Theoretical Computer Science. BCS-FACS

  13. Bert D, Bowen JP, King S, Waldén M (eds)(2003) ZB 2003: formal specification and development in Z and B, third international conference of B and Z users, Turku, Finland, June 4–6, 2003, Proceedings, vol 2651 of Lecture Notes in Computer Science. Springer, Berlin Heidelberg New York

  14. Derrick J (2000) A single complete refinement rule for Z. Logic Comput 10(5):663–675

    Article  MATH  MathSciNet  Google Scholar 

  15. Deutsch M (2002) Firing Conditions. University of Essex, technical report CSM-386

  16. Deutsch M (2005) An Analysis of total correctness refinement models for partial relation semantics. PhD thesis, University of Essex

  17. Deutsch M, Henson MC (2003) An analysis of backward simulation data-refinement for partial relation semantics. In: APSEC 2003 AM03, pp. 38–48

  18. Deutsch M, Henson MC (2003) An analysis of forward simulation data refinement. In: ZB 2003 [DBKW03, pp. 148–167

  19. Deutsch M, Henson MC (2003) An analysis of total correctness refinement models for partial relation semantics II. Logic J IGPL 11(3):319–352

    Article  MATH  MathSciNet  Google Scholar 

  20. Deutsch M, Henson MC (2003) Four theories for backward simulation data-refinement. In: Muntean, T, Sere K (eds) RCS’03 – 2nd international workshop on refinement of critical systems: methods, tools and developments. Äbo Academi, Turku – Finland

  21. Deutsch M, Henson MC (2005) An analysis of operation-refinement in an abortive paradigm. In: REFINE 2005 [DB05

  22. Deutsch M, Henson MC, Reeves S (2003) An analysis of total correctness refinement models for partial relation semantics I. Logic J IGPL 11(3):287–317

    MATH  MathSciNet  Google Scholar 

  23. Deutsch M, Henson MC, Reeves S (2003) Modular reasoning in Z: scrutinising monotonicity and refinement. University of Essex, technical report CSM-407 (under consideration of FACJ)

  24. Diller A (1994) Z: An introduction to formal methods 2nd edn. Wiley New York

  25. de Roever WP, Engelhardt K (1998) Data refinement: model-oriented proof methods and their comparison. Prentice Hall International New Jersey

  26. Fischer C (1998) How to combine Z with a process algebra. In: ZUM ’98 BFJ98, pp. 5–23

  27. Gardiner P (2003) Power simulation and its relation to traces and failures refinement. Theor Comput Sci 309(1):157–176

    Article  MATH  MathSciNet  Google Scholar 

  28. Gardiner PHB, Morgan CC (1993) A single complete rule for data refinement. Formal Aspects Comput 5: 367–382

    Article  MATH  Google Scholar 

  29. Grundy J (1993) A method of program refinement. PhD thesis, University of Cambridge

  30. He J, Hoare CAR (1990) Prespecification and data refinement. In: Data refinement in a categorical setting, technical monograph PRG-90. Oxford University Computing Laboratory, Oxford

  31. He J, Hoare CAR, Sanders JW (1986) Data refinement refined. In: Goos G, Hartmanis J (eds) European symposium on programming (ESOP ’86), vol 213 of Lecture Notes in Computer Science. Springer, Berlin Heidelberg New York, pp 187–196

  32. He J, Hoare CAR, Sanders JW (1987) Prespecification in data refinement. Inf Proces Lett 25(2):71–76

    Article  MATH  MathSciNet  Google Scholar 

  33. Hayes IJ, Jones CB, Nicholls JE (1993) Understanding the differences between VDM and Z. Technical Report UMCS-93-8-1. Department of Computer Science, University of Manchester

  34. Henson MC, Kajtazi B (2005) The Specification Logic vZs. In: REFINE 2005 [DB05

  35. Hoare CAR (1972) Proof of correctness of data representations. Acta Informatica 1:271–281

    Article  MATH  Google Scholar 

  36. Henson MC, Reeves S (1999) Revising Z: I - logic and semantics. Formal Aspects Comput 11(4):359–380

    Article  MATH  Google Scholar 

  37. Henson MC, Reeves S (1999) Revising Z: II – logical development. Formal Aspects Comput 11(4):381–401

    Article  MATH  Google Scholar 

  38. Henson MC, Reeves S (2000) Investigating Z. Logic Comput 10(1):43–73

    Article  MATH  MathSciNet  Google Scholar 

  39. Henson MC, Reeves S (2000) Program development and specification refinement in the schema calculus. In: ZB 2000 [BDGKB00], pp 344–362

  40. Henson MC, Reeves S(2003) A logic for schema-based program development. Formal Aspects of Computing, 15(1):84–99, 2003

  41. Henson MC, Reeves S, Bowen JP (2003) Z logic and its consequences. Comput Informat 22(4):381–415

    MATH  MathSciNet  Google Scholar 

  42. Jones CB (1990) Systematic Software Development using VDM, 2nd edn. Prentice Hall International, New Jersey

    Google Scholar 

  43. Josephs MB (1991) Specifying reactive systems in Z Technical Monograph PRG-TR-19-91. Oxford University Computing Laboratory, Oxford

    Google Scholar 

  44. Manna Z (1974) Mathematical theory of computation. Computer Science Series. McGraw-Hill, New York

  45. Métayer C, Abrial JR, Voisin L (2005) Event-B language. RODIN Deliverable 3.2. rigorous open development environment for complex systems – RODIN

  46. Miarka R, Boiten EA, Derrick J (2000) Guards, preconditions, and refinement in Z. In: ZB 2000 [BDGK00], pp 286–303

  47. Milner AJRG (1971) An algebric definition of simulation between programs. In: Procceedings of 2nd Joint Conference on Artificial Intelligence, pp 481–489

  48. Morgan CC (1988) The specification statement. ACM Trans Programm Lang Syst 10:403–419

    Article  MATH  Google Scholar 

  49. Nipkow T (1986) Non deterministic data types: Models and implementations. Acta Inf 22(6):629–661

    Article  MATH  MathSciNet  Google Scholar 

  50. Prehn S, Toetenel WJ (eds) (1991) VDM ’91 – Formal software development, 4th international symposium of VDM Europe, Noordwijkerhout, The Netherlands, October 21–25, 1991, Proceedings, Vol 2: Tutorials, vol 552 of Lecture Notes in Computer Science. Springer, Berlin Heidelberg New York

  51. Schneider S (2001) The B-Method – An introduction. Correctness of Computing Palgrave

  52. Stepney S, Cooper D, Woodcock JCP (1998) More powerful Z data refinement: pushing the state of the art in industrial refinement. In: ZUM ’98 [BFH98], pp 284–307

  53. Stepney S, Cooper D, Woodcock JCP (2000) An electronic purse: specification, refinement, and proof. Technical Monograph PRG-126. Oxford University Computing Laboratory Oxford

  54. Strulo B (1995) How firing conditions help inheritance. In: Bowen JP, Hinchey MG (eds) ZUM ’95: the Z formal specification notation, 9th international conference of Z users limerick, Ireland, September 7–9, 1995, vol 967 of Lecture Notes in Computer Science. Springer, Berlin Heidelberg New York pp 264–275

  55. Toyn I (ed) (1999) Z notation: final committee Draft, CD 13568.2. Z Standards Panel

  56. Woodcock JCP, Davies J (1996) Using Z: specification, refinement and proof. Prentice Hall New Jersey

  57. Woodcock JCP, Morgan CC (1990) Refinement of State-Based Concurrent Systems. In: VDM ’90 [NHL90], pp 340–351

  58. Woodcock JCP (1991) An introduction to refinement in Z. In: VDM ’91 (volume 2) [BT91b], pp 96–117

  59. Woodcock JCP (1991) The refinement calculus. In: VDM ’91 (volume 2) [PTP91b], pp 80–95

  60. Wordsworth JB (1992) Software development with Z – A practical approach to formal methods in software engineering. Internalional Computer Science Series. Addison-Wesley, Reading

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Essex, Wivenhoe Park, Colchester, Essex, CO4 3SQ, UK

    Moshe Deutsch & Martin C. Henson

Authors
  1. Moshe Deutsch
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Martin C. Henson
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Martin C. Henson.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Deutsch, M., Henson, M.C. An analysis of refinement in an abortive paradigm. Form Asp Comp 18, 329–363 (2006). https://doi.org/10.1007/s00165-006-0006-3

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00165-006-0006-3

Keywords

Search

Navigation