Simulations between specifications of distributed systems

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

Volumn 527 LNCS, Issue , 1991, Pages 346-360

  Jonsson, Bengt ^a,b  

^a SWEDISH INSTITUTE OF COMPUTER SCIENCE   (Sweden)

^b UPPSALA UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; COMPUTER SIMULATION LANGUAGES;

AUXILIARY VARIABLES; BACKWARD SIMULATIONS; DISTRIBUTED SYSTEMS; FORWARD-AND-BACKWARD; LABELED TRANSITION SYSTEMS; LEVEL OF ABSTRACTION; SUBSET CONSTRUCTIONS; VERIFICATION TECHNIQUES;

SPECIFICATIONS;

EID: 85027513509     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-54430-5_99     Document Type: Conference Paper

References (36)

1. rd IEEE Int. Symp. on Logic in Computer Science, Edinburgh, 1988.
2. R.J.R. Back and R. Kurki-Suonio. Distributed cooperation with action systems. ACM Trans. on Programming Languages and Systems, 10(4): 513-554, Oct. 1988.
3. R.J.R. Back and K. Sere. Stepwise refinement of parallel algorithms. Technical Report A. 64, Åbo Akademi, Dept. of Computer Science and Mathematics, 1988.
4. K.M. Chandy and J. Misra. Parallel Program Design: A Foundation. Addison-Wesley, 1988.
5. th IEEE Int. Symp. on Logic in Computer Science, pages 118-129, 1990.
6. R. Gerth. Foundations of compositional program refinement-safety properties. Volume 430 of Lecture Notes in Computer Science, pages 777-808. Springer Verlag, 1990.
7. C.A.R. Hoare, H. Jifeng, and J.W. Sanders. Prespecification in data refinement. Information Processing Letters, 25: 71-76, 1987.
8. C.A.R. Hoare. Proof of correctness of data representation. Acta Informatica, 1(4): 271-281, 1972.
9. J.E. Hopcroft and J.D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 1979.
10. H. Jifeng. Process simulation and refinement. Formal Aspects of Computing, 1: 229-241, 1989.
11. B. Jonsson. Compositional Verification of Distributed Systems. PhD thesis, Dept. of Computer Systems, Uppsala University, Sweden, Uppsala, Sweden, 1987. Available as report DoCS 87/09.
12. th ACM Symp. on Principles of Distributed Computing, Vancouver, Canada, pages 152-166, Vancouver, Canada, 1987. Extended Version as SICS Research Report R90010.
13. B. Jonsson. On decomposing and refining specifications of distributed systems. Volume 430 of Lecture Notes in Computer Science, pages 361-385. Springer Verlag, 1990.
14. M.B. Josephs. A state-based approach to communicating processes. Distributed Computing, 3: 9-18, 1988.
15. th ACM Symp. on Principles of Programming Languages, 1991.
16. N. Klarlund and F.B. Schneider. Verifying safety properties using infinite-state automata. Technical Report TR 89-1039, Cornell University, Ithaca, New York, 1989.
17. L. Lamport. Specifying concurrent program modules. ACM Trans. on Programming Languages and Systems, 5(2): 190-222, 1983.
18. L. Lamport. A simple approach to specifying concurrent systems, Communications of the ACM, 32(1): 32-45, Jan. 1989.
19. S.S. Lam and A.U. Shankar. Protocol verfication via projections. IEEE Trans. on Software Engineering, SE-10(4): 325-342, July 1984.
20. S.S. Lam and A.U. Shankar. Refinement and projection of relational specifications. Volume 430 of Lecture Notes in Computer Science, pages 454-486. Springer Verlag, 1990.
21. th ACM Symp. on Principles of Distributed Computing, Vancouver, Canada, pages 137-151, 1987.
22. M. Merritt. Completeness theorems for automata. Volume 430 of Lecture Notes in Computer Science, pages 544-560. Springer Verlag, 1990.
23. R. Milner. An algebraic definition of simulation between programs. pages 481-489. Also as Report No. CS-205, Computer Science Department, Stanford University.
24. Z. Manna and A. Pnueli. The temporal framework for concurrent programs. In Boyer and Moore, editors, The Correctness Problem in Computer Science, pages 215-274. Academic Press, 1981.
25. Z. Manna and A. Pnueli. Adequate proof principles for invariance and liveness properties of concurrent programs. Science of Computer Programming, 4(4): 257-289, 1984.
26. Z. Manna and A. Pnueli. The anchored version of the temporal framework. In de Bakker, de Roever, and Rozenberg, editors, Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, volume 354 of Lecture Notes in Computer Science, pages 201-284. Springer Verlag, 1989.
27. T. Nipkow. Non-deterministic data types. Acta Informatica, 22: 629-661, 1986.
28. th IFIP WG6.1 Symp. on Protocol Specification, Testing, and Verification, Twente, Holland, 1989.
29. G. Plotkin. A structural approach to operational semantics. Technical Report DAIMI FN-19, Computer Science Department, Aarhus University, Denmark, 1981.
30. A. Pnueli. Applications of temporal logic to the specification and verification of reactive systems: A survey of current trends. Volume 224 of Lecture Notes in Computer Science, pages 510-584. Springer Verlag, 1986.
31. A.P. Sistla. On verifying that a concurrent program satisfies a non-deterministic specification. Technical Report TR 88-378.01.1, Computer and Intelligent Systems Lab. GTE Laboratories, May 1988.
32. A.U. Shankar and S.S. Lam. An HDLC protocol specification and its verification using image protocols. ACM Transactions on Computer Systems, 1(4): 331-368, Nov. 1983.
33. E.W. Stark. Foundations of a Theory of Specification for Distributed Systems. PhD thesis, Massachussetts Inst. of Technology, 1984. Available as Report No. MIT/LCS/TR-342.
34. E.W. Stark. Proving entailment between conceptual state specifications. Theoretical Computer Science, 56: 135-154, 1988.
35. nd IEEE Int. Symp. on Logic in Computer Science, 1987.
36. J. Lundelius Welch, L. Lamport, and N. Lynch. A lattice-structured proof technique applied to a minimum spanning tree algorithm, July 1988.