Featherweight X10: A core calculus for async-finish parallelism

Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP

Volumn , Issue , 2010, Pages 25-36

  Lee, Jonathan K ^a   Palsberg, Jens ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Operational semantics; Parallelism; Static analysis

Indexed keywords

CONTEXT-SENSITIVE; CORE CALCULUS; DEADLOCK FREEDOM; FALSE POSITIVE; OPEN PROBLEMS; OPERATIONAL SEMANTICS; PARALLEL ANALYSIS; POLYNOMIAL-TIME; TYPE INFERENCES; TYPE SYSTEMS;

CALCULATIONS; CONTEXT SENSITIVE LANGUAGES; LINGUISTICS; POLYNOMIAL APPROXIMATION; SEMANTICS; STATIC ANALYSIS; THEOREM PROVING;

PARALLEL PROGRAMMING;

EID: 77749268186     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1693453.1693459     Document Type: Conference Paper

References (21)

1. Martín Abadi and Gordon D. Plotkin. A model of cooperative threads. In POPL, pages 29-40, 2009.
2. Shivali Agarwal, Rajkishore Barik, Vivek Sarkar, and R. K. Shyamasundar. May-happen-in-parallel analysis of X10 programs. In PPoPP, pages 183-193, 2007.
3. Rajkishore Barik. Efficient computation of may-happen-in-parallel information for concurrent Java programs. In LCPC, pages 152-169, 2005.
4. Rajkishore Barik and Vivek Sarkar. Interprocedural load elimination for optimization of parallel programs. In PACT, 2009.
5. Philippe Charles, Christopher Donawa, Kemal Ebcioglu, Christian Grothoff, Allan Kielstra, Vivek Sarkar, and Christoph Von Praun. X10: An object-oriented approach to non-uniform cluster computing. In OOPSLA, pages 519-538, 2005.
6. Jong-Deok Choi, Keunwoo Lee, Alexey Loginov, Robert O'Callahan, Vivek Sarkar, and Manu Sridharan. Efficient and precise datarace detection for multithreaded object-oriented programs. In PLDI, pages 258-269, 2002.
7. Evelyn Duesterwald and Mary Lou Soffa. Concurrency analysis in the presence of procedures using a data-flow framework. In Symposium on Testing, Analysis, and Verification, pages 36-48, 1991.
8. Atsushi Igarashi, Benjamion Pierce, and Philip Wadler. Featherweight Java: A minimal core calculus for Java and GJ. In OOPSLA, pages 132-146, 1999.
9. Vineet Kahlon. Boundedness vs. unboundedness of lock chains: Characterizing decidability of pairwise CFL-reachability for threads communicating via locks. In LICS, pages 27-36, 2009.
10. A. J. Kfoury, Michael A. Arbib, and Robert N. Moll. A Programming Approach to Computability. Springer-Verlag, 1982.
11. Dexter Kozen, Jens Palsberg, and Michael I. Schwartzbach. Efficient inference of partial types. Journal of Computer and System Sciences, 49(2):306-324, 1994.
12. Jonathan K. Lee and Jens Palsberg. Featherweight X10: a core calculus for async-finish parallelism. The full version of our PPoPP'10 paper with three appendices containing detailed proofs is available at http://www.cs.ucla.edu/ ~palsberg/paper/ppopp10.pdf.
13. Lin Li and Clark Verbrugge. A practical MHP information analysis for concurrent Java programs. In LCPC, pages 194-208, 2004.
14. Stephen P. Masticola and Barbara G. Ryder. Non-concurrency analysis. In PPoPP, pages 129-138, 1993.
15. Mayur Naik and Alex Aiken. Conditional must not aliasing for static race detection. In POPL, pages 327-338, 2007.
16. Gleb Naumovich and George S. Avrunin. A conservative data flow algorithm for detecting all pairs of statement that may happen in parallel. In SIGSOFT FSE, pages 24-34, 1998.
17. Gleb Naumovich, George S. Avrunin, and Lori A. Clarke. An efficient algorithm for computing HP information for concurrent Java programs. In ESEC / SIGSOFT FSE, pages 338-354, 1999.
18. Vijay A. Saraswat and Radha Jagadeesan. Concurrent clustered programming. In CONCUR, pages 353-367, 2005.
19. Richard N. Taylor. Complexity of analyzing the synchronization structure of concurrent programs. Acta Inf., 19:57-84, 1983.
20. Christoph von Praun and Thomas R. Gross. Static conflict analyis for multi-threaded object-oriented programs. In PLDI, pages 115-128, 2003.
21. Andrew Wright and Matthias Felleisen. A syntactic approach to type soundness. Information and Computation, 115(1):38-94, 1994.