A Relational Notation for State Transition Systems

IEEE Transactions on Software Engineering

Volumn 16, Issue 7, 1990, Pages 755-775

  Lam, Simon S ^a   Shankar, A Udaya ^b  

^a Department of Computer Sciences ^*  (United States)

^b UNIVERSITY OF MARYLAND   (United States)

Author keywords

Auxiliary variables; communication protocols; distributed systems; fairness; projection mapping; refinement; specification; temporal logic

Indexed keywords

COMPUTER SYSTEMS, DIGITAL--DISTRIBUTED;

RELATIONAL NOTATION; STATE TRANSITION SYSTEMS;

COMPUTER SOFTWARE;

EID: 0025464940     PISSN: 00985589     EISSN: None     Source Type: Journal    
DOI: 10.1109/32.56101     Document Type: Article

References (35)

1. M. Abadi and L. Lamport, “The existence of refinement mappings,” Digital Systems Research Center, Palo Alto, CA, Tech. Rep., Aug. 1988.
2. CCITT, Recommendations Z. 101 to Z. 104. Red Book, Geneva, 1985 (Standard Definition Language).
3. K. L. Calvert and S. S. Lam, “Formal methods for protocol conversion,” IEEE J. Select. Areas Commun., vol. 8, no. 1, Jan. 1990.
4. K. M. Chandy and J. Misra, Parallel Program Design: A Foundation. Reading, MA: Addison-Wesley, 1988.
5. E. M. Clarke and E. A. Emerson, “Synthesis of synchronization skeletons for branching time temporal logic,” in Proc. Workshop Logic of Programs (LNCS 131). New York: Springer Verlag, 1981.
6. B. T. Hailpern and S. Owicki, “Modular verification of computer communication protocols.” IEEE Trans. Commun., vol. COM-31, no. 1. Jan. 1983.
7. E. C. R. Hehner, “Predicative programming, part 1 and part II,” Commun. ACM, vol. 27, no. 2, Feb. 1984.
8. C. A. R. Hoare, Communication Sequential Processes. Englewood Cliffs, NJ: Prentice-Hall. 1985.
9. IBM Corp., Systems Network Architecture Format and Protocol Reference Manual: Architecture Logic, IBM Form No. SC32-3112-2, 1980.
10. Estelle—A Formal Description Technique Based on an Extended State Transition Model, ISO/TC97/SC21/WG16-1 N422, Feb. 1985.
11. S. S. Lam, “Protocol conversion,” IEEE Trans. Software Eng., vol. 14, no. 3, Mar. 1988.
12. S. S. Lam and A. U. Shankar, “Protocol verification via projections,” IEEE Trans. Software Eng., vol. SE-10, no. 4, July 1984.
13. —, “Specifying modules to satisfy interfaces: A state transition approach,” presented at the 26th Lake Arrowhead Workshop on How Will We Specify Concurrent Systems in the Year 2000?, Sept. 1987; full version available as Tech. Rep. TR-88-30, Dep. Comput. Sci., Univ. Texas at Austin, Aug. 1988 (revised Jan. 1990).
14. L. Lamport, “What good is temporal logic?” in Proc. Information Processing 83, IFIP, 1983.
15. —, “Specifying concurrent program modules,” ACM Trans. Program. Lang. Syst., vol. 5, no. 2, Apr. 1983.
16. —, “What it means for a concurrent program to satisfy a specification: Why no one has specified priority,” in Proc. 12th ACM Symp. Principles of Programming Languages, New Orleans, LA, Jan. 1985.
17. —, “A simple approach to specifying concurrent systems,” Commun. ACM, vol. 32, no. 1, Jan. 1989.
18. N. A. Lynch and M. R. Tuttle, “Hierarchical correctness proofs for distributed algorithms,” in Proc. ACM Symp. Principles of Distributed Computing, Vancouver, B.C., Canada, Aug 1987; full version available as Tech. Rep. MIT/LCS/TR-387, Lab. Comput. Sci., M.I.T., Apr. 1987.
19. Z. Manna and A. Pnueli, “Adequate proof principles for invariance and liveness properties of concurrent programs,” Sci. Comput. Program., vol. 4, 1984.
20. Z. Manna and R. Waldinger, The Logical Basis for Computer Programming. Reading, MA: Addison-Wesley, 1985.
21. R. Milner, A Calculus of Communication Systems (LNCS 92). New York: Springer Verlag, 1980.
22. S. L. Murphy and A. U. Shankar, “A verified connection management protocol for the transport layer,” in Proc. ACM S1GCOMM ’87 Workshop, Stowe, VT, Aug. 1987.
23. —, “Service specification and protocol construction for the transport layer,” in Proc. ACM SIGCOMM ‘88 Symp., Stanford Univ., Aug. 1988.
24. S. Owicki and D. Gries, “Verifying properties of parallel programs: An axiomatic approach,” Commun. ACM, vol. 19, no. 5, May 1976.
25. S. Owicki and L. Lamport, “Proving liveness properties of concurrent systems,” ACM Trans. Program. Lang. Syst., vol. 4, no. 3, 1982.
26. T. F. Piatkowski, “The state of the art in protocol engineering,” in Proc. ACM Sigcomm ‘86 Symp., Stowe, VT, 1986.
27. A. Pnueli, “Applications of temporal logic to the specification and verification of reactive systems: A survey of current trends,” in Current Trends in Concurrency: Overviews and Tutorials (LNCS 224), J. W. deBakker et al. Eds. New York: Springer-Verlag, 1986.
28. K. Sabnani, “An algorithmic procedure for protocol verification,” IEEE Trans. Commun., vol. 36, no. 8, Aug. 1988.
29. J. Scheid and S. Holtsberg, Ina Jo Specification Language Reference Manual, System Development Group, Unisys Corp., Santa Monica, CA, Sept. 1988.
30. A. U. Shankar, “Verified data transfer protocols with variable flow control,” ACM Trans. Comput. Syst., vol. 7, no. 3, Aug. 1989; an abbreviated version appears in Proc. ACM SIGCOMM ’86, Stowe, VT, Aug. 1986.
31. A. U. Shankar and S. S. Lam, “An HDLC protocol specification and its verification using image protocols,” ACM Trans. Comput. Syst., vol. 1, no. 4, Nov. 1983.
32. —, “Time-dependent communication protocols,” in Tutorial: Principles of Communication and Networking Protocols, S. S. Lam, Ed. Washington, DC: IEEE Computer Society, 1984.
33. —, “Time-dependent distributed systems: Proving safety, liveness, and real-time properties,” Distributed Comput., vol. 2, no. 2, 1987.
34. —, “A stepwise refinement heuristic for protocol construction,” Dep. Comput. Sci., Univ. Maryland, Tech. Rep. CS-TR-1812, Mar. 1987 (revised Mar. 1989).
35. C. H. West, “A general technique for communications protocol validation,” IBM J. Res. Develop., vol. 22, July 1978.