Task interaction graphs for concurrency analysis

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Task interaction graphs for concurrency analysis

Full text

Pdf (951 KB)

Source

International Conference on Software Engineering archive
Proceedings of the 11th international conference on Software engineering table of contents

Pittsburgh, Pennsylvania, United States

Pages: 44 - 52

Year of Publication: 1989

ISBN:0-8186-1941-4

Authors

Douglas L. Long	Department of Computer Science, Wellesley College, Wellesley, Massachusetts
Lori A. Clarke	Software Development Laboratory, Department of Computer & Information Science, University of Massachusetts, Amherst, Massachusetts

Sponsor

SIGSOFT: ACM Special Interest Group on Software Engineering

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 4, Downloads (12 Months): 17, Citation Count: 28

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	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/74587.74592 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.

	Ada83	Reference Manual for the Ada Programming Language (ANSI/MIL-STD-iSiSA), United States Department of Defense, Washington, D.C., January 1983.
	Avru85	George S. Avrunin, Laura K. Dillon, Jack C. Wileden, and WiIliam E. Riddle. Constrained Expressions: Adding Analysis Capabilities to Design Methods for Concurrent Software Systems. Dept. of Comp. and Info. Science, University of Massachusetts, Amherst, Technical Report 85-13, May 1985.
	Brin78	Per Brinch Hansen, Distributed processes: a concurrent programming concept, Communications of the ACM, v.21 n.11, p.934-941, Nov. 1978 [doi>10.1145/359642.359651]
	Bris79	G. Bristow , C. Drey , B. Edwards , W. Riddle, Anomaly detection in concurrent programs, Proceedings of the 4th international conference on Software engineering, p.265-273, September 17-19, 1979, Munich, Germany
	DeMi79	Richard DeMiIIo and Raymond Miller. Implicit Com- -putation of Synchronization Primitives. Information Processing Letters, 9( 1):35-38, July 1979.
	Dill88	Laura K. Dillon. Symbolic Execution-Based Verification of Ada Tasking Programs. Proceedings of the Third International IEEE Conference on Ada Applications and Environments, 3-13, May 1988.
	Helm85	David Helmbold and David Luckham. Debugging Ada Tasking Programs. IEEE Software, 2(2):47-57, March 1985.
	Hoar78	C. A. R. Hoare, Communicating sequential processes, Communications of the ACM, v.21 n.8, p.666-677, Aug. 1978 [doi>10.1145/359576.359585]
	Kemm88	L.J. Harrison and R.A. Kemmerer. An Interleaving Symbolic Execution Approach for the Formal Verification of Ada Programs with Tasking. Proceedings of the Third International IEEE Conference on Ada Applications and Environments, 3-13, May 1988.
	Long88	Douglas L. Long , Lori A. Clarke, Task Interaction Graph: An Intermediate Representation for Concurrency, University of Massachusetts, Amherst, MA, 1988
	Morg87	E. Timothy Morgan , Rami R. Razouk, Interactive state-space analysis of concurrent systems, IEEE Transactions on Software Engineering, v.13 n.10, p.1080-1091, October 1, 1987 [doi>10.1109/TSE.1987.232850]
	Shat88	S. M. Shatz , W. K. Cheng, A Petri net framework for automated analysis of Ada tasking behavior, Journal of Systems and Software, v.8 n.5, p.343-359, Dec. 1988 [doi>10.1016/0164-1212(88)90027-1]
	Tai85	K.C. Tai. On Testing Concurrent Programs. Proceedings of COMPSAC 85, 310-317, October 1985.
	Tayl80	Richard N. Taylor and Leon J. Osterweil. Anomaly Detection In Concurrent Software By Static Data Flow Analysis. IEEE Transactions on Software Engineering, SE-6(3):265-278, May 1980.
	Tayl83a	Richard N. Taylor. Complexity of Analyzing the Synchronization Structure of Concurrent Programs. Acta Inform&x, 19:57-84, 1983.
	Tayl83b	Richard N. Taylor, A general-purpose algorithm for analyzing concurrent programs, Communications of the ACM, v.26 n.5, p.361-376, May 1983 [doi>10.1145/69586.69587]
	Wamp85	Gordon K. Wampler. A Static Concurrency Analysis Tool for Ada (SCA). Master's Dissertation, University of California, Irvine, 1985.
	Youn86	MichaI Young and Richard N. Taylor. Combining Static Concurrency Analysis With Symbolic Execution. In Proceedings of the Workshop on Software Testing:170-178, IEEE Computer Society Press, July 1986.

CITED BY 28

	Matthew B. Dwyer , Lori A. Clarke , Kari A. Nies, A compact Petri net representation for concurrent programs, Proceedings of the 17th international conference on Software engineering, p.147-157, April 24-28, 1995, Seattle, Washington, United States
	Michal Young , Richard N. Taylor , David L. Levine , Kari A. Nies , Debra Brodbeck, A concurrency analysis tool suite for Ada programs: rationale, design, and preliminary experience, ACM Transactions on Software Engineering and Methodology (TOSEM), v.4 n.1, p.65-106, Jan. 1995
	Gleb Naumovich , George S. Avrunin , Lori A. Clarke, An efficient algorithm for computing MHP information for concurrent Java programs, ACM SIGSOFT Software Engineering Notes, v.24 n.6, p.338-354, Nov. 1999
	Mauro Pezzè , Richard N. Taylor , Michal Young, Graph models for reachability analysis of concurrent programs, ACM Transactions on Software Engineering and Methodology (TOSEM), v.4 n.2, p.171-213, April 1995
	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
	Anneliese von Mayrhauser , Shao-Ming Simon Hsueh, An Ada deadlock testing algorithm based on control and communication flow graphs, Proceedings of the conference on TRI-Ada '92, p.450-457, November 16-20, 1992, Orlando, Florida, United States
	Eric Y. T. Juan , Jeffrey J. P. Tsai , Tadao Murata, Compositional verification of concurrent systems using Petri-net-based condensation rules, ACM Transactions on Programming Languages and Systems (TOPLAS), v.20 n.5, p.917-979, Sept. 1998
	David L. Levine , Richard N. Taylor, Metric-driven reengineering for static concurrency analysis, ACM SIGSOFT Software Engineering Notes, v.18 n.3, p.40-50, July 1993
	R. Kadia, Issues encountered in building a flexible software development environment: lessons from the Arcadia project, ACM SIGSOFT Software Engineering Notes, v.17 n.5, p.169-180, Dec. 1992
	A. T. Chamillard , Lori A. Clarke, Improving the accuracy of Petri net-based analysis of concurrent programs, ACM SIGSOFT Software Engineering Notes, v.21 n.3, p.24-38, May 1996
	Douglas Long , Lori A. Clarke, Data flow analysis of concurrent systems that use the rendezvous model of synchronization, Proceedings of the symposium on Testing, analysis, and verification, p.21-35, October 08-10, 1991, Victoria, British Columbia, Canada
	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
	James C. Corbett, An empirical evaluation of three methods for deadlock analysis of Ada tasking programs, Proceedings of the 1994 ACM SIGSOFT international symposium on Software testing and analysis, p.204-215, August 17-19, 1994, Seattle, Washington, United States
	Stephen P. Masticola , Barbara G. Ryder, A model of Ada programs for static deadlock detection in polynomial times, ACM SIGPLAN Notices, v.26 n.12, p.97-107, Dec. 1991
	M. Young , R. Taylor , K. Forester , D. Brodbeck, Integrated concurrency analysis in a software development enviornment, ACM SIGSOFT Software Engineering Notes, v.14 n.8, p.200-209, Dec. 1989
	S. Duri , U. Buy , R. Devarapalli , S. M. Shatz, Using state space reduction methods for deadlock analysis in Ada tasking, ACM SIGSOFT Software Engineering Notes, v.18 n.3, p.51-60, July 1993
	Michael Young , Richard N. Taylor, Rethinking the taxonomy of fault detection techniques, Proceedings of the 11th international conference on Software engineering, p.53-62, May 1989, Pittsburgh, Pennsylvania, United States
	Evelyn Duesterwald , Mary Lou Soffa, Concurrency analysis in the presence of procedures using a data-flow framework, Proceedings of the symposium on Testing, analysis, and verification, p.36-48, October 08-10, 1991, Victoria, British Columbia, Canada
	David P. Helmbold , Charles E. McDowell, Computing reachable states of parallel programs, ACM SIGPLAN Notices, v.26 n.12, p.76-84, Dec. 1991
	Douglas L. Long , Lori A. Clarke , Joseph Fialli, Ada language considerations for concurrency analysis, Proceedings of the sixth Washington Ada symposium on Ada, p.75-80, July 1989, McLean, Virginia, United States
	S. Duri , U. Buy , R. Devarapalli , S. M. Shatz, Application and experimental evaluation of state space reduction methods for deadlock analysis in Ada, ACM Transactions on Software Engineering and Methodology (TOSEM), v.3 n.4, p.340-380, Oct. 1994
	Richard N. Taylor , David L. Levine , Cheryl D. Kelly, Structural Testing of Concurrent Programs, IEEE Transactions on Software Engineering, v.18 n.3, p.206-215, March 1992
	Sol M. Shatz , Shengru Tu , Tadao Murata , Sastry Duri, An Application of Petri Net Reduction for Ada Tasking Deadlock Analysis, IEEE Transactions on Parallel and Distributed Systems, v.7 n.12, p.1307-1322, December 1996
	James C. Corbett, Evaluating Deadlock Detection Methods for Concurrent Software, IEEE Transactions on Software Engineering, v.22 n.3, p.161-180, March 1996
	M. Notomi , T. Murata, Hierarchical Reachability Graph of Bounded Petri Nets for Concurrent-Software Analysis, IEEE Transactions on Software Engineering, v.20 n.5, p.325-336, May 1994
	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
	Christian Rehn, Dynamic mapping of cooperating tasks to nodes in a distributed system, Future Generation Computer Systems, v.22 n.1, p.35-45, January 2006
	Matthew B. Dwyer , Lori A. Clarke, A Compact Petri Net Representation and Its Implications for Analysis, IEEE Transactions on Software Engineering, v.22 n.11, p.794-811, November 1996