Data flow analysis of concurrent systems that use the rendezvous model of synchronization

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Data flow analysis of concurrent systems that use the rendezvous model of synchronization

Full text

Pdf (1.09 MB)

Source

International Symposium on Software Testing and Analysis archive
Proceedings of the symposium on Testing, analysis, and verification table of contents

Victoria, British Columbia, Canada

Pages: 21 - 35

Year of Publication: 1991

ISBN:0-89791-449-X

Authors

Douglas Long	Department of Computer Science, Lafayette College, Easton, Pennsylvania
Lori A. Clarke	Software Development Laboratory, Computer and Information Science Department, University of Massachusetts, Amherst, Massachusetts

Sponsor

SIGSOFT: ACM Special Interest Group on Software Engineering

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 7, Downloads (12 Months): 31, Citation Count: 13

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/120807.120810 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.

	ADW89	G. Avrunin , J. Wileden , L. Dillon, Experiments in automated analysis of concurrent software systems, ACM SIGSOFT Software Engineering Notes, v.14 n.8, p.124-130, Dec. 1989
	All74	F.E. Allen. Information Processing 74, chapter Introprocedural Data Flow Analysis, pages 398-402. North Holland Pub. Co,, Amsterdam, 1974.
	Bar78	Jeffrey M. Barth, A practical interprocedural data flow analysis algorithm, Communications of the ACM, v.21 n.9, p.724-736, Sept. 1978 [doi>10.1145/359588.359596]
	BH78	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]
	CT91	Richard H. Carver , Kuo-Chung Tai, Replay and Testing for Concurrent Programs, IEEE Software, v.8 n.2, p.66-74, March 1991 [doi>10.1109/52.73751]
	Dil88	K. Dillon. Symbolic Execution- Based Verification of Ada Tasking Programs. In Third Int. Conference on Ada Appiicatiom and Environments, pages 3-13, May 1988.
	FO76	Lloyd D. Fosdick , Leon J. Osterweil, Data Flow Analysis in Software Reliability, ACM Computing Surveys (CSUR), v.8 n.3, p.305-330, Sept. 1976 [doi>10.1145/356674.356676]
	Hec77	Matthew S. Hecht, Flow Analysis of Computer Programs, Elsevier Science Inc., New York, NY, 1977
	HK88	L. J. Harrison and R. A. Kemmerer. An Interleaving Symbolic Execution Approach for the Formal Verification of Ada Programs with Tasking. In Proceedings of the Third International IEEE Conference on Ada Applications and Environments, pages 3-13, May 1988.
	HL85	D. Helmbold and D. Luckham. Debugging Ada tasking programs. IEEE Software, 2(2):47-57, March 1985.
	Hoa78	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]
	HS89	M. Harrold , M. Soffa, Interprocedual data flow testing, Proceedings of the ACM SIGSOFT '89 third symposium on Software testing, analysis, and verification, p.158-167, December 13-15, 1989, Key West, Florida, United States
	LC89	Douglas L. Long , Lori A. Clarke, Task interaction graphs for concurrency analysis, Proceedings of the 11th international conference on Software engineering, p.44-52, May 1989, Pittsburgh, Pennsylvania, United States [doi>10.1145/74587.74592]
	McD89	Charles E. McDowell, A practical algorithm for static analysis of parallel programs, Journal of Parallel and Distributed Computing, v.6 n.3, p.515-536, June 1989 [doi>10.1016/0743-7315(89)90004-X]
	MR90	S.P. Masticola and B.G. Ryder. Static Infinite Wait Anomaly Detection in Polynomial Time. Tech Report LCSR-TR-141, Laboratory for Computer Science Research, Hill Center for the Mathematical Sciences, Busch Campus, Rutgers University, New Brunswick, NJ 08903, January 1990.
	OO90	Kurt M. Olender , Leon J. Osterweil, Cecil: A Sequencing Constraint Language for Automatic Static Analysis Generation, IEEE Transactions on Software Engineering, v.16 n.3, p.268-280, March 1990 [doi>10.1109/32.48935]
	Ref83	Reference Manual for the Ada Programming Language, Washington DC. United States Department of Defense, January 1983.
	RL89	D. Rosenblum , D. Luckham, Testing the correctness of tasking supervisors with TSL specifications, ACM SIGSOFT Software Engineering Notes, v.14 n.8, p.187-196, Dec. 1989
	Ros79	Barry K. Rosen, Data Flow Analysis for Procedural Languages, Journal of the ACM (JACM), v.26 n.2, p.322-344, April 1979 [doi>10.1145/322123.322135]
	SC88	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]
	Tai86	Kuo-Chung Tai, A graphical notation for describing executions of concurrent Ada programs, ACM SIGAda Ada Letters, v.VI n.1, p.94-103, Jan. 1986 [doi>10.1145/382256.382803]
	Tay83a	R. N. Taylor. Complexity of analyzing the synchronization structure of concurrent programs. Acta Informatica, 19:57-84, 1983.
	Tay83b	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]
	TO80	R.N. Taylor and L.J. Osterweil. Anomaly Detection in Concurrent Software by Static Data Flow Analysis. IEEE Transactions on Software Engineering, SE-6(3):265-277, May 1980.
	YT86	M. Young and R.N. Taylor. Combining Static Concurrency Analysis With Symbolic Execution. In Proceedings of the Workshop on Software Testing, pages 170-178, July 1986. Published by IEEE Computer Society Press.
	YT88	M. Young , R. M. Taylor, Combining Static Concurrency Analysis with Symbolic Execution, IEEE Transactions on Software Engineering, v.14 n.10, p.1499-1511, October 1988 [doi>10.1109/32.6195]
	YTFB89	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

CITED BY 13

	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
	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
	Jens Knoop , Bernhard Steffen , Jürgen Vollmer, Parallelism for free: efficient and optimal bitvector analyses for parallel programs, ACM Transactions on Programming Languages and Systems (TOPLAS), v.18 n.3, p.268-299, May 1996
	Stephen P. Masticola , Thomas J. Marlowe , Barbara G. Ryder, Lattice frameworks for multisource and bidirectional data flow problems, ACM Transactions on Programming Languages and Systems (TOPLAS), v.17 n.5, p.777-803, Sept. 1995
	Jens Knoop , Bernhard Steffen, Code motion for explicitly parallel programs, ACM SIGPLAN Notices, v.34 n.8, p.13-24, Aug. 1999
	Patrice Godefroid, Model checking for programming languages using VeriSoft, Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.174-186, January 15-17, 1997, Paris, France
	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
	Stephen P. Masticola , Barbara G. Ryder, Non-concurrency analysis, ACM SIGPLAN Notices, v.28 n.7, p.129-138, July 1993
	Christopher Colby , Patrice Godefroid , Lalita Jategaonkar Jagadeesan, Automatically closing open reactive programs, ACM SIGPLAN Notices, v.33 n.5, p.345-357, May 1998
	Patrice Godefroid , Robert S. Hanmer , Lalita Jategaonkar Jagadeesan, Model checking without a model: an analysis of the heart-beat monitor of a telephone switch using VeriSoft, ACM SIGSOFT Software Engineering Notes, v.23 n.2, p.124-133, March 1998
	Radu Rugina , Martin C. Rinard, Pointer analysis for structured parallel programs, ACM Transactions on Programming Languages and Systems (TOPLAS), v.25 n.1, p.70-116, January 2003
	Satish Chandra , Patrice Godefroid , Christopher Palm, Software model checking in practice: an industrial case study, Proceedings of the 24th International Conference on Software Engineering, May 19-25, 2002, Orlando, Florida
	Patrice Godefroid, Software Model Checking: The VeriSoft Approach, Formal Methods in System Design, v.26 n.2, p.77-101, March 2005