Compositional reachability analysis of finite-state distributed systems with user-specified constraints

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Compositional reachability analysis of finite-state distributed systems with user-specified constraints

Full text

Pdf (842 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: 140 - 150

Year of Publication: 1995

ISBN:0-89791-716-2

Also published in ...

Authors

S. C. Cheung	Department of Computer Science, Hong Kong University of Science and Technology, Clear Water Bay, Hong Kong
J. Kramer	Department of Computing, Imperial College of Science, Technology and Medicine, London SW7 2BZ, UK

Sponsor

SIGSOFT: ACM Special Interest Group on Software Engineering

Publisher

ACM New York, NY, USA

Bibliometrics

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

Additional Information:

references cited by index terms collaborative colleagues

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.222149 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	S. C. Cheung , J. Kramer, Enhancing compositional reachability analysis with context constraints, Proceedings of the 1st ACM SIGSOFT symposium on Foundations of software engineering, p.115-125, December 08-10, 1993, Los Angeles, California, United States
	2	S. C. Cheung , J. Kramer, An integrated method for effective behaviour analysis of distributed systems, Proceedings of the 16th international conference on Software engineering, p.309-320, May 16-21, 1994, Sorrento, Italy
	3	Shing Chi Cheung , J. Kramer, Tractable Dataflow Analysis for Distributed Systems, IEEE Transactions on Software Engineering, v.20 n.8, p.579-593, August 1994 [doi>10.1109/32.310668]
	4	Patrice Godefroid , Pierre Wolper, Using Partial Orders for the Efficient Verification of Deadlock Freedom and Safety Properties, Proceedings of the 3rd International Workshop on Computer Aided Verification, p.332-342, July 01-04, 1991
	5	Susanne Graf , Bernhard Steffen, Compositional Minimization of Finite State Systems, Proceedings of the 2nd International Workshop on Computer Aided Verification, p.186-196, June 18-21, 1990
	6	D. Helmbold and D. Luckham, "Debugging Ada Tasking Programs," IEEE Software, vol. 2, pp. 47-57, March 1985.
	7	C. A. R. Hoare, Communicating sequential processes, Prentice-Hall, Inc., Upper Saddle River, NJ, 1985
	8	Gerard J. Holzmann , Patrice Godefroid , Didier Pirottin, Coverage Preserving Reduction Strategies for Reachability Analysis, Proceedings of the IFIP TC6/WG6.1 Twelth International Symposium on Protocol Specification, Testing and Verification XII, p.349-363, June 22-25, 1992
	9	J. Kramer, J. Magee, K. Ng, and M. Sloman, "The System Architect's Assistant for Design and Construction of Distributed Systems," in Proc. 4th IEEE Workshop on Future Trends of Distributed Computing Systems, Lisbon, September 1993.
	10	Jawahar Malhotra , Robert M. Shapiro , Scott A. Smolka , Alessandro Giacalone, Winston: A Toll for Hierarchical Design and Simulation of Concurrent Systems, Proceedings of the BCS-FACS Workshop on Specification and Verification of Concurrent Systems, p.140-152, July 06-08, 1988
	11	R. Milner, J. Parrow, and D. Walker, "A Calculus of Mobile Processes Part I and II," Technical Report, University of Edinburgh, June 1989.
	12	K. K. Sabnani, A. M. Lapone, and M. U. Uyar, "An Algorithmic Procedure for Checking Safety Properties of Protocols," IEEE Transactions on Communications, vol. 37, pp. 940-948, September 1989.
	13	K. C. Tai and V. Koppol, "Hierarchy-Based Incremental Reachability Analysis of Communication Protocols," in Proc. IEEE International Conference on Network Protocols, San Francisco, California, October 1993.
	14	Kuo-Chung Tai , Pramod V. Koppol, An incremental approach to reachability analysis of distributed programs, Proceedings of the 7th international workshop on Software specification and design, December 06-07, 1993, Redondo Beach, California
	15	Antti Valmari, Stubborn sets for reduced state generation, Proceedings on Advances in Petri nets 1990, p.491-515, March 1991
	16	W, J, Yeh, "Controlling State Explosion in Reachability Analysis," Technical Report, SERC-TR- 147-P, SERC, Purdue University, December 1993.
	17	Wei Jen Yeh , Michal Young, Compositional reachability analysis using process algebra, Proceedings of the symposium on Testing, analysis, and verification, p.49-59, October 08-10, 1991, Victoria, British Columbia, Canada [doi>10.1145/120807.120812]

CITED BY 8

	Pramod V. Koppol , Kuo-Chung Tai, An incremental approach to structural testing of concurrent software, ACM SIGSOFT Software Engineering Notes, v.21 n.3, p.14-23, May 1996
	Shing C. Cheung , Jeff Kramer, Checking subsystem safety properties in compositional reachability analysis, Proceedings of the 18th international conference on Software engineering, p.144-154, March 25-29, 1996, Berlin, Germany
	Shing Chi Cheung , Jeff Kramer, Context constraints for compositional reachability analysis, ACM Transactions on Software Engineering and Methodology (TOSEM), v.5 n.4, p.334-377, Oct. 1996
	Pramod V. Koppol , Richard H. Carver , Kuo-Chung Tai, Incremental Integration Testing of Concurrent Programs, IEEE Transactions on Software Engineering, v.28 n.6, p.607-623, June 2002
	Shing Chi Cheung , Jeff Kramer, Checking safety properties using compositional reachability analysis, ACM Transactions on Software Engineering and Methodology (TOSEM), v.8 n.1, p.49-78, Jan. 1999
	Fei Xie , James C. Browne, Verified systems by composition from verified components, ACM SIGSOFT Software Engineering Notes, v.28 n.5, September 2003
	Michael E. Ruth , Shengru Tu, Empirical studies of a decentralized regression test selection framework for web services, Proceedings of the 2008 workshop on Testing, analysis, and verification of web services and applications, p.8-14, July 21-21, 2008, Seattle, Washington
	Michael E. Ruth, Concurrency in a decentralized automatic regression test selection framework for web services, Proceedings of the 15th ACM Mardi Gras conference: From lightweight mash-ups to lambda grids: Understanding the spectrum of distributed computing requirements, applications, tools, infrastructures, interoperability, and the incremental adoption of key capabilities, January 29-February 03, 2008, Baton Rouge, Louisiana