Skip to main content
SpringerLink
Log in

On Refinement and Temporal Annotations

  • Conference paper
  • First Online:
Formal Techniques in Real-Time and Fault-Tolerant Systems (FTRTFT 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1926))

Abstract

This paper introduces the semantics of a wide spectrum language with a rich compositional structure that is able to represent both temporal specifications and sequential programs. A key feature of the language is the ability to represent partial correctness annotations expressed in temporal logic. A refinement relation is presented that enables refinement steps to make use of these partial correctness assertions. It is argued by means of an example that the approach presented allows for more flexible reasoning using temporal annotations than previous approaches, and that the added .exibility has signi.cant value for program optimization.

Work supported by an Australian Research Council Large Grant, and by the Technion fund for advancement of research. Thanks to Kai Engelhardt for helpful discussions on the topic of this paper.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. J. Back and vonWright. Refinement Calculus: A systematic approach. Graduate Texts in Computer Science. Springer Verlag, 1998.

    Google Scholar 

  2. K. Engelhardt, R. van der Meyden, and Y. Moses. Knowledge and the logic of local propositions. In I. Gilboa, editor, Proc. Conf on Theoretical Aspects of Reasoning about Knowledge, pages 29–41. Morgan Kauffman, July 1998.

    Google Scholar 

  3. K. Engelhardt, R. van der Meyden, and Y. Moses. A refinement framework supporting reasoning about knowledge and time. In Proc. of FOSSACS’ 2000. Springer Verlag, March 2000.

    Google Scholar 

  4. R. Fagin, J. Y. Halpern, Y. Moses, and M. Y. Vardi. Reasoning about Knowledge. MIT Press, Cambridge, Mass., 1995.

    MATH  Google Scholar 

  5. S. Graf and J. Sifakis. Alogic for the description of non-deterministic programs and their properties. Information and Control, 68(1-3):254–270, January/February/March 1986.

    Article  MATH  MathSciNet  Google Scholar 

  6. I. Hayes. Separating timing and calculation in real-time refinement. In J. Grundy et al, editor, International Refinement Workshop & Formal Methods Pacific, Proc. IRW/FMP’98, Series in Discrete Mathematics and Theoretical Computer Science, 1998.

    Google Scholar 

  7. K. Havelund and K. Larsen. A refinement logic for the fork calculus. In S. T. Vuong and S. T. Chanson, editors, Protocol Specification, Testing and Verification XIV, pages 5–20. Chapman and Hall, 1995. IFIP WG 6.1 Symposium.

    Google Scholar 

  8. C.A.R. Hoare. An axiomatic basis for computer programming. Comm. ACM, 12:516–580, 1967.

    Google Scholar 

  9. S. Holström. A refinement calculus for specifications in Henessy-Milner logic with recursion. Formal Aspects of Computing, 1:242–272, 1989.

    Article  Google Scholar 

  10. I. Hayes and M. Utting. A sequential real-time refinement calculus. Technical Report UQ-SVRC-97-33, Software Verification Research Centre, University of Queensland, 1997. URL http://www.svrc.it.uq.edu.au/.

  11. Leslie Lamport. The temporal logic of actions. ACM Transactions on Programming Languages and Systems, 16(3):872–923, May 1994. Also appeared as DEC SRC Research Report 79.

    Article  Google Scholar 

  12. Y. Moses and O. Kislev. Knowledge-oriented programming. In Proc. 12th ACM Symp. on Principles of Distributed Computing, pages 261–270, 1993.

    Google Scholar 

  13. R. van der Meyden and Y. Moses. Top-down considerations on distributed systems. In Proc. 12th Int. Symp. on Distributed Computing, DISC’98, pages 16–19, Andros, Greece, Sept 1998. Springer LNCS No. 1499.

    Google Scholar 

  14. J. M. Morris. A theoretical basis for refinement and the programming calculus. Science of Computer Programming, 9(3):287–306, 1987.

    Article  MATH  MathSciNet  Google Scholar 

  15. C. Morgan. Programming from Specifications. Prentice Hall, New York, 1990.

    MATH  Google Scholar 

  16. M. Utting and C. Fidge. Areal-time refinement calculus that changes only time. In He Jifeng, editor, Proc. 7th BCS/FACS Refinement Workshop, Electronic Workshops in Computing. Springer, 1996.

    Google Scholar 

  17. M. Utting and C. Fidge. Refinement of infeasible real-time programs. In Proc. Formal Methods Pacific’ 97, Series in Discrete Mathematics and Theoretical Computer Science, pages 243–262, 1997.

    Google Scholar 

  18. G. Winskel. Acomplete proof system for SCSS with modal assertions. Fundamenta Informaticae, IX:401–419, 1986.

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science and Engineering, The University of New South Wales, 2052, Sydney, Australia

    Ron van der Meyden

  2. Department of Electrical Engineering, Technion, Haifa, Israel

    Yoram Moses

Authors
  1. Ron van der Meyden
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yoram Moses
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Tata Research Development and Design Centre, 54B, Hadapsar Industrial Estate, Pune, 411013, India

    Mathai Joseph

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

van der Meyden, R., Moses, Y. (2000). On Refinement and Temporal Annotations. In: Joseph, M. (eds) Formal Techniques in Real-Time and Fault-Tolerant Systems. FTRTFT 2000. Lecture Notes in Computer Science, vol 1926. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45352-0_16

Download citation

  • DOI: https://doi.org/10.1007/3-540-45352-0_16

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41055-3

  • Online ISBN: 978-3-540-45352-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation