Analyzing the communication topology of concurrent programs

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Analyzing the communication topology of concurrent programs

Full text

Pdf (1.11 MB)

Source

ACM/SIGPLAN Workshop Partial Evaluation and Semantics-Based Program Manipulation archive
Proceedings of the 1995 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation table of contents

La Jolla, California, United States

Pages: 202 - 213

Year of Publication: 1995

ISBN:0-89791-720-0

Author

Christopher Colby

Computer Science Department, Carnegie Mellon University, Pittsburgh, PA

Sponsor

SIGPLAN: ACM Special Interest Group on Programming Languages

Publisher

ACM New York, NY, USA

Bibliometrics

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

Additional Information:

references cited by 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/215465.215592 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.

	BMT92	Dave Berry , Robin Milner , David N. Turner, A semantics for ML concurrency primitives, Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.119-129, January 19-22, 1992, Albuquerque, New Mexico, United States [doi>10.1145/143165.143191]
	CC77	Patrick Cousot , Radhia Cousot, Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints, Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.238-252, January 17-19, 1977, Los Angeles, California [doi>10.1145/512950.512973]
	CC80	Patrick Cousot , Radhia Cousot, Semantic Analysis of Communicating Sequential Processes (Shortened Version), Proceedings of the 7th Colloquium on Automata, Languages and Programming, p.119-133, July 14-18, 1980
	CC92	P. Cousot and It. Cousot. Abstract interpretation frameworks Journal of Logzc and Computation, 2(4)511-547, 1992
	CH92	Jyh-Herng Chow , William Ludwell Harrison, III, Compile-time analysis of parallel programs that share memory, Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.130-141, January 19-22, 1992, Albuquerque, New Mexico, United States [doi>10.1145/143165.143194]
	Col	Chrmtopher Colby Analysis of synchronization and ahasing with abstract interpretation Unpublished
	Deu92	Alain Deutsch Operatzonal Models of Programming Languages and Representations of Relations on Regular Languages with Apphcatzon to the Static Determination of Dynamic Abasing Propertzes of Data. PhD thesm, LIX, Ecole Potytechmque, Palmseau, France, 1992.
	Har89	Williams Ludwell Harrison The interprocedural analysis and automatic parallehsatlon of scheme programs L,sp and Symbohc Computation, 2(3) 176-396, October 1989
	Hei92	Nevm Hemtze. Set Based Program Analysis PhD thesis, Carnegie Mellon University, Pittsburgh, Pennsylvama, 1992.
	JM82	Neil D. Jones , Steven S. Muchnick, A flexible approach to interprocedural data flow analysis and programs with recursive data structures, Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.66-74, January 25-27, 1982, Albuquerque, Mexico [doi>10.1145/582153.582161]
	JW94	Suresh Jagannathan , Stephen Weeks, Analyzing stores and references in a parallel symbolic language, Proceedings of the 1994 ACM conference on LISP and functional programming, p.294-305, June 27-29, 1994, Orlando, Florida, United States
	Mer91	Nicolas Mercouroff, An Algorithm for Analyzing Communicating Processes, Proceedings of the 7th International Conference on Mathematical Foundations of Programming Semantics, p.312-325, March 25-28, 1991
	MTH90	Robin Milner , Mads Tofte , Robert Harper, The definition of Standard ML, MIT Press, Cambridge, MA, 1990
	NN94	Hanne Riis Nielson , Flemming Nielson, Higher-order concurrent programs with finite communication topology (extended abstract), Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.84-97, January 16-19, 1994, Portland, Oregon, United States [doi>10.1145/174675.174538]
	Rep92	John Iteppy. High-Order Concurrency. PhD thesis, Cornetl University, Ithaca, New York, June 1992

CITED BY 9

	Naoki Kobayashi, A partially deadlock-free typed process calculus, ACM Transactions on Programming Languages and Systems (TOPLAS), v.20 n.2, p.436-482, March 1998
	John Reppy , Yingqi Xiao, Specialization of CML message-passing primitives, ACM SIGPLAN Notices, v.42 n.1, January 2007
	Christopher Colby , Peter Lee, Trace-based program analysis, Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.195-207, January 21-24, 1996, St. Petersburg Beach, Florida, United States
	Mihnea Marinescu , Benjamin Goldberg, Partial-evaluation techniques for concurrent programs, ACM SIGPLAN Notices, v.32 n.12, p.47-62, Dec. 1997
	Christopher Colby , Patrice Godefroid , Lalita Jategaonkar Jagadeesan, Automatically closing open reactive programs, ACM SIGPLAN Notices, v.33 n.5, p.345-357, May 1998
	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
	David A. Schmidt, Trace-Based Abstract Interpretation of Operational Semantics, Lisp and Symbolic Computation, v.10 n.3, p.237-271, May 1998
	Patrice Godefroid, Software Model Checking: The VeriSoft Approach, Formal Methods in System Design, v.26 n.2, p.77-101, March 2005
	Paolo Di Blasio , Kathleen Fisher , Carolyn Talcott, A Control-Flow Analysis for a Calculus of Concurrent Objects, IEEE Transactions on Software Engineering, v.26 n.7, p.617-634, July 2000