Proving refinement using transduction

Distributed Computing

Volumn 12, Issue 2-3, 1999, Pages 129-149

  Jonsson, Bengt ^a   Pnueli, Amir ^b   Rump, Camilla ^c  

^a UPPSALA UNIVERSITY   (Sweden)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^c TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

BUFFER STORAGE; COMPUTER SIMULATION; COMPUTER SYSTEMS PROGRAMMING; NETWORK PROTOCOLS; RESPONSE TIME (COMPUTER SYSTEMS); SEQUENTIAL SWITCHING;

DELAYED SIMULATION; PARTIAL-ORDER REFINEMENT; TEMPORAL LOGIC;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0033311967     PISSN: 01782770     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004460050062     Document Type: Article

References (32)

1. Afek Y, Brown G, Merritt M: Lazy caching. ACM Transactions on Programming Languages and Systems 15(1):182-206 (1993)
2. Abadi M, Lamport L: The existence of refinement mappings. Theor Comput Sci 82(2):253-284 (1991)
3. Brinksma E. Jonssen B. Orava F: Refining interfaces of communicating systems. In: Abramsky S. Maibaum T, (eds) Proc. Coll. on Combining Paradigms for Software Development, Lecture Notes in Computer Science, Vol 494, pp 297-312, Berlin Heidelberg New York: Springer 1991
4. Collier WW: Reasoning about Parallel Architectures. Englewood Cliffs, NJ: Prentice Hall 1992
5. Dubois M, Scheurig C, Briggs FA: Memory access buffering in multiprocessors. In: Proc. 13th Annual Int. Symp. on Computer Architecture pp 434-442, June 1986
6. Elrad T, Francez N: Decomposition of distributed programs into communication closed layers. Sci Comput Program 2(3):155-173 (1982)
7. Gharachorloo K, Adve S, Gupta A, Hennessy J, Hill MD: Programming for different memory consistency models. J Parallel Distrib Comput 15:399-407 (1992)
8. Gaifman H: Modeling concurrency by partial orders and non-linear transition systems. In: de Bakker JW, de Roever W-P, Rozenberg G (eds) Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, Lecture Notes in Computer Science, Vol 354, pp 467-488, Berlin Heidelberg New York: Springer 1989
9. Gerth R: Introduction. Distrib Comput 12:57-59 (1999)
10. Gerth R, Kuiper R, Segers J: Interface refinement in reactive systems. In: Cleaveland R (ed) Proc. CONCUR '92, Theories of Concurrency: Unification and Extension, Lecture Notes in Computer Science, Vol 630, pp 77-93, Berlin Heidelberg New York: Springer 1992
11. Jifeng H: Process simulation and refinement. Formal Asp Comput 1:229-241 (1989)
12. Hoare CAR, Jifeng H, Sanders JW: Prespecification in data refinement. Inform Process Lett 25:71-76 (1987)
13. Jonsson B: Simulations between specifications of distributed systems. In: Proc. CONCUR '91 Theories of Concurrency: Unification and Extension, Lecture Notes in Computer Science, Vol 527, Berlin Heidelberg New York: Springer 1991
14. Jonsson B: Compositional specification and verification of distributed systems. ACM Trans Program Languages Syst 16(2):259-303 1994
15. Josephs MB: A state-based approach to communicating processes. Distrib Comput 3:9-18 (1988)
16. Janssen W, Zwiers J: Specifying and proving communication closedness in protocols. In: Proceedings of 13th IFIP Symp. on Protocol Specification, Testing and Verification, Amsterdam: North-Holland 1993
17. Lamport L: How to make a multiprocessor that correctly executes multiprocess programs. IEEE Trans. Comput C-28:690-691 (1979)
18. Lamport L: Specifying concurrent program modules. ACM Trans Program Languages Syst 5(2):190-222 (1983)
19. Lamport L: A simple approach to specifying concurrent systems. Communications of the ACM 32(1):32-45 (1989)
20. Lenoski D, Laudon J, Gharachorloo K, Gupta A, Hennessy J: The directory-based cache coherence protocol for the DASH multiprocessor. In: Proc. 17th Annual Int. Symp. on Computer Architecture, May 1990
21. Lam SS, Shankar AU: Refinement and projection of relational specifications. In: de Bakker, de Roever, Rozenberg (eds) Stepwise Refinement of Distributed Systems. Models, Formalisms, Correctness, Lecture Notes in Computer Science, Vol 430, pp 454-486, Berlin Heidelberg New York: Springer 1990
22. th ACM Symp. on Principles of Distributed Computing, pp 137-151, Vancouver, Canada 1987
23. Mazurkiewicz A: Basic notions of trace theory. In: de Bakker JW, de Roever W-P, Rozenberg G (eds) Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, Lecture Notes in Computer Science. Vol 354. pp 285-363, Berlin Heidelberg New York: Springer 1989
24. Manna Z, Pnueli A: The Temporal Logic of Reactive and Concurrent Systems: Specification. New York: Springer 1991
25. Manna Z, Pnueli A: Completing the temporal picture. Theor Comput Sci 83(1):97-130 (1991)
26. Manna Z. Pnueli A: Temporal Verification of Reactive Systems: Safety, New York: Springer 1995
27. Orava F: Verifying safety and deadlock properties of networks of asynchronously communicating processes. In: Protocol Specification, Testing, and Verification IX, pp 357-372, Enschede, The Netherlands 1989. IFIP WG 6.1, North-Holland
28. Pratt V: Modeling concurrency with partial orders. Int J Parallel Program 15(1):33-71 (1986)
29. Rump C: Proof-by-Transduction: A Refinement Verification Technique. Ph.D. thesis ID-TR: 1995-164, Department of Computer Science, The Technical University of Denmark, January 1995
30. Shankar AU, Lam SS: An HDLC protocol specification and its verification using image protocols. ACM Trans Comput Syst 1(4):331-368 (1983)
31. Shasha D. Snir M: Efficient and correct execution of parallel programs thai share memory. ACM Trans Program Languages Syst 10(2):282-312 (1988)
32. Stark EW: Proving entailment between conceptual state specifications. Theor Comput Sci 56:135-154 (1988)