Eternity variables to prove simulation of specifications

ACM Transactions on Computational Logic

Volumn 6, Issue 1, 2005, Pages 175-201

  Hesselink, Wim H ^a  

^a UNIVERSITY OF GRONINGEN   (Netherlands)

Author keywords

History variables; Implementation; Invariant; Preservation of quiescence; Prophecy variables; Refinement mapping; Simulation

Indexed keywords

HISTORY VARIABLES; INVARIANTS; PRESERVATION OF QUIESCENCE; PROPHECY VARIABLES; REFINEMENT MAPPING; SPECIFICATION IMPLEMENTATION;

ALGORITHMS; COMPUTER SIMULATION; DATA PROCESSING; FINITE AUTOMATA; HYBRID COMPUTERS; MATHEMATICAL TRANSFORMATIONS; REAL TIME SYSTEMS; SEMANTICS; THEOREM PROVING;

COMPUTER SCIENCE;

EID: 11444266154     PISSN: 15293785     EISSN: None     Source Type: Journal    
DOI: 10.1145/1042038.1042044     Document Type: Article

References (26)

1. ABADI, M. AND LAMPORT, L. 1991. The existence of refinement mappings. Theoret. Comput. Sci. 82, 253-284.
2. ABADI, M. AND LAMPORT, L. 1995. Conjoining specifications. ACM Trans. Program. Lang. Syst. 17, 507-534.
3. BOYER, R. S. AND MOORE, J S. 1997. A Computational Logic Handbook. Academic Press, Orlando, Fla.
4. BROY, M. 1992. Algebraic and functional specification of an interactive serializable database interface. Distr. Comput. 6, 5-18.
5. CLINT, M. 1973. Program proving: coroutines. Acta Inf. 2, 50-63.
6. COHEN, E. AND LAMPORT, L. 1998. Reduction in TLA. In CONCUR '98, D. Sangiorgi and R. de Simone, Eds. Lecture Notes in Computer Science, vol. 1466. Springer, New York, 317-331.
7. DE ROEVER, W.-P., DE BOER, F., HANNEMANN, U., HOOMAN, J., LAKHNECH, Y., POEL, M., AND ZWIERS, J. 2001. Concurrency Verification, Introduction to Compositional and Noncompositional Methods. Cambridge University Press, Cambridge.
8. EILENBERG, S. AND MACLANE, S. 1945. General theory of natural equivalences. Trans. AMS 58, 231-294.
9. HE, J., HOARE, C. A. R., AND SANDERS, J. W. 1986. Data refinement refined. In ESOP 86, B. Robinet and R. Wilhelm, Eds. Lecture Notes in Computer Science, vol. 213. Springer, New York, 187-196.
10. HESSELINK, W. H. 1998. Invariants for the construction of a handshake register. Inf. Proc. Lett. 68, 173-177.
11. HESSELINK, W. H. 2002a. An assertional criterion for atomicity. Acta Inf. 38, 343-366.
12. HESSELINK, W. H. 2002b. Eternity variables to simulate specifications. In MPC 2002, E. Boiten and B. Moeller, Eds. Lecture Notes in Computer Science, vol. 2386. Springer, New York, 117-130.
13. HESSELINK, W. H. 2004. Using eternity variables to specify and prove a serializable database interface. Sci. Comput. Program. 51, (July), 47-85.
14. HESSELINK, W. H. 2005. Universal extensions to simulate specifications. http.//www.cs.rng.nl/~wim/pub/mans.html.
15. JONNSON, B. 1991. Simulations between specifications of distributed systems. In CONCUR '91, J. Baeten and J. Groote, Eds. Lecture Notes in Computer Science, vol. 527. Springer, New York, 346-360.
16. JONSSON, B., PNUELI, A., AND RUMP, C. 1999. Proving refinement using transduction. Distrib. Comput. 12, 129-149.
17. LADKIN, P., LAMPORT, L., OLIVIER, B., AND ROEGEL, D. 1999. Lazy caching in TLA. Distrib. Comput. 12, 151-174.
18. LAMPORT, L. 1989. A simple approach to specifying concurrent systems. Commun. ACM 32, 32-45.
19. LAMPORT, L. 1992. Critique of the Lake Arrowhead three. Distrib. Comput. 6, 65-71.
20. LAMPORT, L. 1994. The temporal logic of actions. ACM Trans. Prog. Lang. Syst. 16, 872-923.
21. LIPTON, R. J. 1975. Reduction: a method of proving properties of parallel programs. Commun. ACM 18, 717-721.
22. LYNCH, N. AND VAANDRAGER, F. 1995. Forward and backward simulations. Part I: Untimed systems. Inf. Comput. 121, 214-233.
23. MANNA, Z. AND PNUELI, A. 1995. Temporal Verification of Reactive Systems: Safety. Springer, New York.
24. MILNER, R. 1971. An algebraic definition of simulation between programs. In Proceedings of the 2nd International Joint Conference on Artificial Intelligence. British Comput. Society, 481-489.
25. OWICKI, S. AND GRIES, D. 1976. An axiomatic proof technique for parallel programs. Acta Inf. 6, 319-340.
26. SCHNEIDER, F. B. 1992. Introduction. Distrib. Comput. 6, 1-3.