Partial-evaluation techniques for concurrent programs

Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation

Volumn , Issue , 1997, Pages 47-62

  Marinescu, Mihnea ^a   Goldberg, Benjamin ^a  

^a POLYTECHNIC UNIVERSITY   (United States)

Author keywords

Binding time analysis; Concurrency; CSP; Nondeterminism; Partial evaluation

Indexed keywords

COMMUNICATION; COMPUTER PROGRAMMING LANGUAGES; DATA TRANSFER; SEMANTICS; SYNCHRONIZATION; ALGORITHMS; COMPUTATIONAL LINGUISTICS; DATA STRUCTURES;

BINDING TIME ANALYSIS; CONCURRENCY; CSP; NON-DETERMINISM; PARTIAL EVALUATION;

APPLICATION PROGRAMS; COMPUTER SOFTWARE;

BINDING TIME ANALYSIS; CONCURRENCY; NONDETERMINISM; PARTIAL EVALUATION;

EID: 0030720231     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/258993.259002     Document Type: Conference Paper

References (32)

1. P. America and J. Rutten. A parallel object oriented language: Design and semantic foundations. In J. W. de Bakker, editor, Languages for Parallel Architectures. John Willey, 1989.
2. A. Berlin. Partial evaluation applied to numerical computation. In The 1990 ACM Conference on LISP and Functional Programming, pages 139-150, 1990.
3. C. Consel and O. Danvy. Tutorial notes in partial evaluation. In The 20th Annual ACM Symposium on Principles of Programming Languages, pages 493-501, 1993.
4. C. Colby and P. Lee. Trace-based program analysis. In The 23th Annual ACM Symposium on Principles of Programming Languages, pages 195-207, 1996.
5. C. Colby. Analyzing the communication topology of concurrent programs. In The ACM Symposium on Partial Evaluation and Semantic-Based Program Manipulation, pages 202-214, 1995.
6. C. Consel, C. Pu, and J. Walpole. Incremental specialization: The key to high performance, modularity and portability in operating systems. In The ACM Symposium on Partial Evaluation and Semantic-Based Program Manipulation, pages 44-46, 1993.
7. N. de Francesco and A. Santone. Unfold/Fold Transformations of Concurrent Processes. In LNCS nr. Î140, pages 167-181. Springer Verlag, 1996.
8. H. Fujita, A. Okamura, and K. Furukawa. Partial evaluation of GHC programs based on the UR-set with constraints. In Logic Programming 5th International Conference and Symposium, pages 924-941, 1988.
9. R. Glück and M. H. Sørensen. A roadmap to metacomputation by supercompilation. In Partial Evaluation, LNCS nr. 1110, pages 137-160. Springer Verlag, 1996.
10. M. Gupta and E. Schonberg. Static analysis to reduce synchronization costs in data-parallel programs. In The 23th Annual ACM Symposium on Principles of Programming Languages, pages 322-332, 1996.
11. C.A.R. Hoare. Communicating Sequential Processes. CACM, 21(8):666-677, 1978.
12. C.A.R. Hoare. Communicating Sequential Processes. Prentice Hall, 1985.
13. N. Jones, C. Gomard, and P. Sestoft. Partial Evaluation and Automatic Program Generation. Prentice Hall, 1993.
14. N. Jones. What not to do when writing an interpreter for specialization. In Partial Evaluation, LNCS nr. 1110, pages 216-237. Springer Verlag, 1996.
15. (INMOS Ltd.). Occam Programming Manual. Prentice Hall, 1984.
16. D. May. Occam. Sigplan Notices, 13(4), 1983.
17. N. Mercouroff. An algorithm for analyzing communicating processes. In Mathematical Foundations of Programming Semantics, LNCS nr. 598, pages 312-325. Springer Verlag, 1991.
18. U. Meyer. Techniques for partial evaluation of imperative languages. In Symposium on Partial Evaluation and Semantics-Based Program Manipulation, pages 94-105, 1991.
19. R. Milner. Communication and Concurrency. Prentice Hall, 1989.
20. T. Mogensen. Partially static structures in a self-applicable partial evaluator. In D. Bj0rner, A. Ershov, and N. Jones, editors, Partial Evaluation and Mixed Computation, pages 325-347. North Holland, 1988.
21. P.D. Mosses. Denotational semantics. In van Leeuwen, editor, Handbook of Theoretical Computer Science. M.I.T. Press, 1990.
22. H.R. Nielson and F. Nielson. Higher-order concurrent programs with finite communication topology. In The 21st Annual ACM Symposium on Principles of Programming Languages, pages 84-97, 1994.
23. V. Nirkhe and W. Pugh. Partial evaluation of high-level imperative languages, with applications in hard real-time systems. In The 19th Annual ACM Symposium on Principles of Programming Languages, pages 269-280, 1992.
24. D. Park. Concurrency and automata on infinite sequences. In LNCS nr. 104, pages 167-173. Springer Verlag, 1981.
25. C. Pu, C. Consel, et al Optimistic incremental specialization: Steamlining a commercial operating system. In ACM Symposium on Operating Systems Principles, 1995.
26. P. Pepper. Deductive Derivation of Parallel Programs. In Parallel Algorithm Derivation and Program Transformation, pages 1-53. Kluwer Academic Publishers, 1993.
27. G.D. Plotkin. An operational semantics for CSP. In D. Bj0rner, editor, Formal Description of Programming Concepts II, pages 199-225. North Holland, 1983.
28. J.H. Reppy. CML: A Higher-Order Concurrent Language. In ACM Symposium Programming Language Design and Implementation, 1991.
29. S. Romanenko. Arity raiser and its use in program specialization. In N. Jones, editor, ESOP'90, LNCS nr. 432, pages 341-360. Springer Verlag, 1990.
30. J. Reif and S. Smolka. Data flow analysis of distributed communicating processes. International Journal of Parallel Programming, 19(l):l-30, 1990.
31. V.F. Turchin. Program transformations with metasystem transition. Journal of Functional Programming, 3(3):283-313, 1993.
32. G Winskel. The Formal Semantics of Programming Languages, pages 297-336. MIT Press, 1993.