Task-level analysis for a language with async/finish parallelism

Proceedings of the ACM SIGPLAN Conference on Languages, Compilers, and Tools for Embedded Systems (LCTES)

Volumn , Issue , 2011, Pages 21-30

  Albert, Elvira ^a   Arenas, Puri ^a   Genaim, Samir ^a   Zanardini, Damiano ^b  

^a UNIVERSIDAD COMPLUTENSE DE MADRID   (Spain)

^b UNIVERSIDAD POLITÉCNICA DE MADRID   (Spain)

Author keywords

Java; Parallelism; Resource consumption; Static analysis; X10

Indexed keywords

ACCURATE ESTIMATION; DISTRIBUTED LANGUAGES; INPUT DATAS; JAVA; PARALLEL LANGUAGES; PARALLEL PROGRAM; PARALLELISM; RESOURCE CONSUMPTION; STATIC KNOWLEDGE; TASK LEVELS; UPPER BOUND; X10;

EMBEDDED SYSTEMS; PARALLEL ARCHITECTURES; PARALLEL PROGRAMMING; PROGRAM COMPILERS; PROGRAM DEBUGGING;

STATIC ANALYSIS;

EID: 79955669454     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1967677.1967681     Document Type: Conference Paper

References (27)

1. M. Abadi and G. D. Plotkin. A model of cooperative threads. In Proc. of POPL'09, pages 29-40. ACM, 2009.
2. E. Albert, P. Arenas, S. Genaim, and G. Puebla. Closed-Form Upper Bounds in Static Cost Analysis. Journal of Automated Reasoning, 46(2):161-203, 2011.
3. E. Albert, P. Arenas, S. Genaim, G. Puebla, and D. Zanardini. Cost Analysis of Java Bytecode. In Proc. of ESOP'07, volume 4421 of LNCS, pages 157-172. Springer, 2007. (Pubitemid 350259490)
4. E. Albert, P. Arenas, S. Genaim, G. Puebla, and D. Zanardini. COSTA: Design and Implementation of a Cost and Termination Analyzer for Java Bytecode. In Proc. of FMCO'07, volume 5382 of LNCS, pages 113-133. Springer, 2008.
5. E. Albert, S. Genaim, and M. Gómez-Zamalloa. Parametric Inference of Memory Requirements for Garbage Collected Languages. In Proc. of ISMM'10, pages 121-130. ACM Press, 2010.
6. A. W. Appel. Ssa is Functional Programming. SIGPLAN Notices, 33(4):17-20, 1998. (Pubitemid 128456634)
7. V. Braberman, F. Fernández, D. Garbervetsky, and S. Yovine. Parametric Prediction of Heap Memory Requirements. In Proc. of ISMM'08, pages 141-150. ACM Press, 2008.
8. P. Charles, C. Grothoff, V. A. Saraswat, C. Donawa, A. Kielstra, K. Ebcioglu, C. von Praun, and V. Sarkar. X10: An Object-Oriented Approach to Non-Uniform Cluster computing. In Proc. of OOPSLA' 05, pages 519-538. ACM, 2005.
9. W-N. Chin, H.H. Nguyen, C. Popeea, and S. Qin. Analysing Memory Resource Bounds for Low-Level Programs. In Proc. of ISMM'08, pages 151-160. ACM Press, 2008.
10. R. DeLine and K.R.M. Leino. BoogiePL: A typed procedural language for checking object-oriented programs. Technical Report MSR-TR- 2005-70, Microsoft Research, 2005.
11. M. Fähndrich. Static Verification for Code Contracts. In Proc. of SAS'10, volume 6337 of LNCS, pages 2-5. Springer, 2010.
12. S. Gulwani, K. K. Mehra, and T. M. Chilimbi. Speed: precise and efficient static estimation of program computational complexity. In Proc. of POPL'09, pages 127-139. ACM, 2009.
13. J. Hoffmann and M. Hofmann. Amortized Resource Analysis with Polynomial Potential. In Proc. of ESOP'10, volume 6012 of LNCS, pages 287-306. Springer, 2010.
14. M. Hofmann and S. Jost. Type-Based Amortised Heap-Space Analysis. In Proc. of ESOP'06, volume 3924 of LNCS, pages 22-37. Springer, 2006. (Pubitemid 44019549)
15. N.D. Jones, C.K. Gomard, and P. Sestoft. Partial Evaluation and Automatic Program Generation. Prentice Hall, New York, 1993.
16. J. K. Lee and J. Palsberg. Featherweight X10: A Core Calculus for Async-Finish Parallelism. In Proc. of PPoPP'10, pages 25-36. ACM, 2010.
17. Antoine Miné. Field-sensitive value analysis of embedded c programs with union types and pointer arithmetics. In Proc. of LCTES'06, pages 54-63. ACM, 2006.
18. C. Otto, M. Brockschmidt, C. von Essen, and J. Giesl. Automated Termination Analysis of Java Bytecode by Term Rewriting. In Proc. of RTA'10, volume 6 of LIPIcs, pages 259-276, 2010.
19. R. Raman, J. Zhao, V. Sarkar, M. T. Vechev, and E. Yahav. Efficient data race detection for async-finish parallelism. In Proc. of RV'10, volume 6418 of LNCS, pages 368-383. Springer, 2010.
20. V. A. Saraswat and R. Jagadeesan. Concurrent Clustered Programming. In Proc. of CONCUR'05, volume 3653 of LNCS, pages 353-367. Springer, 2005. (Pubitemid 41520752)
21. F. Spoto, F. Mesnard, and É. Payet. A Termination Analyser for Java Bytecode based on Path-Length. Transactions on Programming Languages and Systems, 32(3), 2010.
22. W. Zou T. Wei, J. Mao and Y. Chen. A new algorithm for identifying loops in decompilation. In Proc. of SAS'07, volume 4634 of LNCS, pages 170-183, 2007.
23. L. Unnikrishnan and S. Stoller. Parametric heap usage analysis for functional programs. In Proc. of ISMM'09, pages 139-148. ACM Press, 2009.
24. L. Unnikrishnan, S. D. Stoller, and Y. A. Liu. Optimized Live Heap Bound Analysis. In Proc. of VMCAI'03, volume 2575 of LNCS, pages 70-85. Springer, 2003.
25. R. Vallee-Rai, L. Hendren, V. Sundaresan, P. Lam, E. Gagnon, and P. Co. Soot - a Java Optimization Framework. In Proc. of CASCON' 99, pages 125-135. IBM, 1999.
26. M. T. Vechev, E. Yahav, R. Raman, and V. Sarkar. Automatic Verification of Determinism for Structured Parallel Programs. In Proc. of SAS'10, volume 6337 of LNCS, pages 455-471. Springer, 2010.
27. B. Wegbreit. Mechanical Program Analysis. Communications of the ACM, 18(9), 1975.