On refinement and temporal annotations

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

Volumn 1926, Issue , 2000, Pages 185-202

  van der Meyden, Ron ^a   Moses, Yoram ^b  

^a UNIVERSITY OF NEW SOUTH WALES   (Australia)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Refinement calculus; Temporal logic; Temporal refinement calculi

Indexed keywords

BIOMINERALIZATION; CALCULATIONS; COMPUTER CIRCUITS; FAULT TOLERANCE; SEMANTICS; TEMPORAL LOGIC;

COMPOSITIONAL STRUCTURE; PARTIAL CORRECTNESS; PROGRAM OPTIMIZATION; REFINEMENT CALCULI; REFINEMENT STEP; SEQUENTIAL PROGRAMS; TEMPORAL SPECIFICATION; WIDE SPECTRUM LANGUAGE;

REAL TIME SYSTEMS;

EID: 84974687955     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45352-0_16     Document Type: Conference Paper

References (18)

1. R. J. Back and von Wright. Refinement Calculus: A systematic approach. Graduate Texts in Computer Science. Springer Verlag, 1998.
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.
3. K. Engelhardt, R. van der Meyden, and Y. Moses. Arefinement framework supporting reasoning about knowledge and time. In Proc. of FOSSACS ’2000. Springer Verlag, March 2000.
4. R. Fagin, J. Y. Halpern, Y. Moses, and M. Y. Vardi. Reasoning about Knowledge. MIT Press, Cambridge, Mass., 1995.
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.
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.
7. K. Havelund and K. Larsen. Arefinement 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.
8. C.A.R. Hoare. An axiomatic basis for computer programming. Comm. ACM, 12:516–580, 1967.
9. S. Holström. Arefinement calculus for specifications in Henessy-Milner logic with recursion. Formal Aspects of Computing, 1:242–272, 1989.
10. I. Hayes and M. Utting. Asequen tial 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.
12. Y. Moses and O. Kislev. Knowledge-oriented programming. In Proc. 12th ACM Symp. on Principles of Distributed Computing, pages 261–270, 1993.
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.
14. J. M. Morris. Atheoretical basis for refinement and the programming calculus. Science of Computer Programming, 9(3):287–306, 1987.
15. C. Morgan. Programming from Specifications. Prentice Hall, New York, 1990.
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.
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.
18. G. Winskel. Acomplete proof system for SCSS with modal assertions. Fundamenta Informaticae, IX:401–419, 1986.