Refinement calculus, part II: Parallel and reactive programs

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

Volumn 430 LNCS, Issue , 1990, Pages 67-93

  Back, R J R ^a  

^a ÅBO AKADEMI UNIVERSITY   (Finland)

Author keywords

Action systems; Fairness; Hiding; Parallel composition; Parallel programs; Reactive programs; Refinement mappings; Simulation; Stepwise refinement; Stuttering; Total correctness; Weakest preconditions

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

ACTION SYSTEMS; FAIRNESS; HIDING; PARALLEL COMPOSITION; PARALLEL PROGRAM; REACTIVE PROGRAMS; REFINEMENT MAPPING; SIMULATION; STEPWISE REFINEMENT; STUTTERING; TOTAL CORRECTNESS; WEAKEST PRECONDITION;

CALCULATIONS;

EID: 84957834675     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-52559-9_61     Document Type: Conference Paper

References (34)

1. M. Abadi and L. Lamport. The existence of refinement mappings. In Proc, 3rd IEEE Symp. on LICS, Edinburgh, 1988.
2. K. R. Apt and E.-R. Olderog. Proof rules dealing with fairness. Science of Computer Programming, 3:65-100, 1983.
3. R. J. R. Back. Refining atomicity in parallel algorithms. In PARLE Conference on Parallel Architectures and Languages Europe, volume 366 of Lecture Notes in Computer Science, Eind-hoven, the Netherlands, June 1989. Springer Verlag. Also available as Abo Akademi reports on computer science and mathematics no. 57, 1988.
4. R. J. R. Back, E. Hartikainen, and R. Kurki-Suonio. Multi-process handshaking on broadcasting networks. Reports on computer science and mathematics 42, Abo Akademi, 1985.
5. R. J. R. Back and R. Kurki-Suonio. Decentralization of process nets with centralized control. In 2nd ACM SIGACT-SIGOPS Symp. on Principles of Distributed Computing, pages 131-142. ACM, 1983.
6. R. J. R. Back and R. Kurki-Suonio. Co-operation in distributed systems using symmetric multiprocess handshaking. Reports on computer science and mathematics 34, Abo Akademi, 1984.
7. R. J. R. Back and R. Kurki-Suonio. Distributed co-operation with action systems. ACM Transactions on Programming Languages and Systems, 10:513-554, October 1988. Previous version in Abo Akademi reports on computer science and mathematics no. 34, 1984.
8. R. J. R. Back and R. Kurki-Suonio. Serializability in distributed systems with handshaking. In International Colloquium on Automata, Languages and Programming, volume 317 of Lecture Notes in Computer Science, 1988. Previous version in CMU-CS-85-109, Carnegie-Mellon University 1985.
9. R. J. R. Back and R. Kurki-Suonio. Decentralization of process nets with centralized control. Distributed Computing, 3(2):73-87, 1989. Appeared previously in 2nd ACM SIGACT-SIGOPS Symp. on Principles of Distributed Computing 1983.
10. R. J. R. Back and K. Sere. An exercise in deriving parallel algorithms: Gaussian elimination. Reports on computer science and mathematics 65, Abo Akademi, 1988.
11. R. J. R. Back and K. Sere. An implementation of action systems in occam. (in preparation), 1989.
12. R. J. R. Back and K. Sere. Refinement of action systems. In Mathematics of Program Construction, volume 375 of Lecture Notes in Computer Science, Groningen, The Netherlands, June 1989. Springer-Verlag.
13. R. Bagrodia. An environment for the design and performance analysis of distributed systems. PhD thesis, The University of Texas at Austin, Austin, Texas, 1987.
14. K. Chandy and J. Misra. Parallel Program Design: A Foundation. Addison-Wesley, 1988.
15. P. Eklund. Synchronizing multiple processes in common handshakes. Reports on computer science and mathematics 39, Abo Akademi, 1985.
16. N. Francez. Fairness. Springer-Verlag, 1986.
17. D. Harel. Statecharts: a visual formalism for complex systems. Science of Computer Programming, 8(3):231-274,1987.
18. C. A. R. Hoare. Communicating sequential processes. Communications of the ACM, 21(8):666-677, August 1978.
19. C. A. R. Hoare. Communicating Sequential Processes. Prentice-Hall, 1985.
20. INMOS Ltd. occam Programming Manual. Prentice-Hall International, 1984.
21. B. Jonsson. Compositional Verification of Distributed Systems. PhD thesis, Dept, of Computer Systems, Uppsala University, Uppsala, 1987. Available as report DoCS 87/09.
22. R. Kurki-Suonio and H.-M. Järvinen. Action system approach to the specification and design of distributed systems. In Proc. 5th International Workshop on Software Specification and Design, volume 14(3) of ACM Software Engineering Notes, pages 34-40, 1989.
23. R. Kurki-Suonio and T. Kankaanpää. On the design of reactive systems. BIT, 28(3):581-604, 1988.
24. S. S. Lam and A. U. Shankar. A relational notation for state transition systems. Technical Report TR-88-21, Dept, of Computer Sciences, University of Texas at Austin, 1988.
25. L. Lamport. Reasoning about nonatomic operations. In Proc. 10th ACM Conference on Principles of Programming Languages, pages 28-37, 1983.
26. L. Lamport. A simple approach to specifying concurrent systems. Communications of the ACM, 32(l):32-45, January 1989.
27. N. A. Lynch and M. R. Tuttle. Hierarchical correctness proofs for distributed algorithms. In Proc. 6th ACM Symp. on Principles of Distributed Computing, pages 137-151, 1987.
28. Z. Manna and A. Pnueli. How to cook a temporal proof system for your pet language. In Proc. 10a ACM Symp. on Principles of Programming Languages, pages 141-154, 1983.
29. R. Milner. A Calculus of Communicating Systems, volume 92 of Lecture Notes of Computer Science. Springer Verlag, 1980.
30. J. Misra. Specifications of concurrently accessed data. In J. van de Snepscheut, editor, Mathematics of Program Construction, volume 375 of Lecture Notes in Computer Science, Groningen, The Netherlands, June 1989. Springer-Verlag.
31. A. Pnueli. Applications of temporal logic to the specification and verification of reactive systems: A survey of current trends. In de Bakker, de Roever, and Rozenberg, editors, Current Trends in Concurrency, volume 224 of Lecture Notes in Computer Science, pages 510-584. Springer Verlag, 1986.
32. K. Sere. Stepwise removal of virtual channels in distributed algorithms. In 2nd International Workshop on Distributed Algorithms, 1987.
33. E. W. Stark. Foundations of a Theory of Specification for Distributed Systems. PhD thesis, Massachusetts Inst, of Technology, 1984. Available as Report No. MIT/LCS/TR-342.
34. E. W. Stark. Proving entailment between conceptual state specifications. Theoretical Comput. Sei., 56:135-154, 1988.