Liveness conditions in model-based service specifications

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Liveness conditions in model-based service specifications: a case study

Full text

Pdf (977 KB)

Source

Foundations of Software Engineering archive
Proceedings of the 3rd ACM SIGSOFT symposium on Foundations of software engineering table of contents

Washington, D.C., United States

Pages: 62 - 71

Year of Publication: 1995

ISBN:0-89791-716-2

Also published in ...

Author

Alan Fekete

Department of Computer Science, University of Sydney, Australia

Sponsor

SIGSOFT: ACM Special Interest Group on Software Engineering

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 8, Citation Count: 0

Additional Information:

references index terms collaborative colleagues peer to peer

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/222124.222140 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Martín Abadi , Leslie Lamport, Open systems in TLA, Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing, p.81-90, August 14-17, 1994, Los Angeles, California, United States [doi>10.1145/197917.197960]
	2	J. C. M. Baeten , W. P. Weijland, Process algebra, Cambridge University Press, New York, NY, 1991
	3	Tommaso Bolognesi , Ed Brinksma, Introduction to the ISO specification language LOTOS, Computer Networks and ISDN Systems, v.14 n.1, p.25-59, March, 1987 [doi>10.1016/0169-7552(87)90085-7]
	4	K. Mani Chandy, Parallel program design: a foundation, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1988
	5	Roger Duke , Graeme Smith, Temporal logic and Z specifications, Australian Computer Journal, v.21 n.2, p.62-66, May 1989
	6	Martin S. Feather , Axel van Lamsweerde, Succeedings of the seventh international workshop on software specification and design, ACM SIGSOFT Software Engineering Notes, v.19 n.3, p.18-22, July 1994 [doi>10.1145/182824.182826]
	7	Alan Feteke, Formal Models of Communication Services: A Case Study, Computer, v.26 n.8, p.37-47, August 1993 [doi>10.1109/2.223535]
	8	Ian Hayes, Specification case studies, Prentice Hall International (UK) Ltd., Hertfordshire, UK, 1987
	9	C. A. R. Hoare, Communicating sequential processes, Prentice-Hall, Inc., Upper Saddle River, NJ, 1985
	10	Gerard J. Holzmann, Design and validation of computer protocols, Prentice-Hall, Inc., Upper Saddle River, NJ, 1990
	11	Bengt Jonsson, Compositional specification and verification of distributed systems, ACM Transactions on Programming Languages and Systems (TOPLAS), v.16 n.2, p.259-303, March 1994 [doi>10.1145/174662.174665]
	12	Robert M. Keller, Formal verification of parallel programs, Communications of the ACM, v.19 n.7, p.371-384, July 1976 [doi>10.1145/360248.360251]
	13	Leslie Lamport, The temporal logic of actions, ACM Transactions on Programming Languages and Systems (TOPLAS), v.16 n.3, p.872-923, May 1994 [doi>10.1145/177492.177726]
	14	Nancy A. Lynch , Hagit Attiya, Using mappings to prove timing properties, Distributed Computing, v.6 n.2, p.121-139, September 1992 [doi>10.1007/BF02252683]
	15	Nancy A. Lynch , Mark R. Tuttle, Hierarchical correctness proofs for distributed algorithms, Proceedings of the sixth annual ACM Symposium on Principles of distributed computing, p.137-151, August 10-12, 1987, Vancouver, British Columbia, Canada [doi>10.1145/41840.41852]
	16	Lynch, N., and Tuttle, M., "An Introduction to Input/Output Automata" CWI Quaterly, 2(3):219-246, September 1989.
	17	Zohar Manna , Amir Pnueli, The temporal logic of reactive and concurrent systems, Springer-Verlag New York, Inc., New York, NY, 1992
	18	R. Milner, Communication and concurrency, Prentice-Hall, Inc., Upper Saddle River, NJ, 1989
	19	Nick Reingold , Da-Wei Wang , Lenore D. Zuck, Games I/O Automata Play (Extended Abstract), Proceedings of the Third International Conference on Concurrency Theory, p.325-339, August 24-27, 1992
	20	A. Udaya Shankar , Simon S. Lam, A stepwise refinement heuristic for protocol construction, ACM Transactions on Programming Languages and Systems (TOPLAS), v.14 n.3, p.417-461, July 1992 [doi>10.1145/129393.129394]