Interprocedural analysis of asynchronous programs

Conference Record of the Annual ACM Symposium on Principles of Programming Languages

Volumn , Issue , 2007, Pages 339-350

  Jhala, Ranjit ^a   Majumdar, Rupak ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Asynchronous (event driven) programming; Dataflow analysis

Indexed keywords

ALGORITHMS; DATA FLOW ANALYSIS; OPTIMIZATION; PROBLEM SOLVING;

ASYNCHRONOUS PROGRAMMING; INTERPROCEDURAL DATAFLOW ANALYSIS; STANDARD OPTIMIZATIONS;

COMPUTER PROGRAMMING LANGUAGES;

EID: 34548293706     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1190216.1190266     Document Type: Conference Paper

References (32)

1. P. A. Abdulla, K. Čerāns, B. Jonsson, and Yih-Kuan Tsay. General decidability theorems for infinite-state systems. In LICS 96, pages 313-321. IEEE Press, 1996.
2. T. Agerwala and J. Misra. Assertion graphs for verifying and synthesizing programs. Technical Report 83, University of Texas, Austin, 1978.
3. T. Ball and S.K. Rajamani. The SLAM project: debugging system software via static analysis. In POPL 02: Principles of Programming Languages, pages 1-3. ACM, 2002.
4. E. M. Clarke, O. Grumberg, S. Jha, Y. Lu, and H. Veith. Counterexample-guided abstraction refinement. In CAV 00: Computer-Aided Verification, LNCS 1855, pages 154-169. Springer, 2000.
5. R. Cunningham, eel: Tools for debugging, visualization, and verification of event-driven software, 2005. Master's Thesis, UC Los Angeles.
6. R. Cunningham and E. Kohler. Making events less slippery with Eel. In HotOS-X, 2005.
7. G. Delzanno, J.-F. Raskin, and L. Van Begin. Towards the automated verification of multithreaded Java programs. In TACAS 02, LNCS 2280, pages 173-187. Springer, 2002.
8. L.E. Dickson. Finiteness of the odd perfect and primitive abundant numbers with r distinct prime factors. Amer. Journal Math., 35:413-422, 1913.
9. E.W. Dijkstra. A Discipline of Programming. Prentice-Hall, 1976.
10. M. Emmi and R. Majumdar. Decision problems for the verification of real-time software. In HSCC 06, LNCS 3927, pages 200-211. Springer, 2006.
11. J. Esparza. Decidability and complexity of Petri net problems -an introduction. In Lectures on Petri Nets I: Basic Models, LNCS 1491, pages 374-428. 1998.
12. D. Gay, P. Levis, R. von Behren, M. Welsh, E. Brewer, and D. Culler. The nesC language: A holistic approach to networked embedded systems. In PLDI 2003: Programming Languages Design and Implementation, pages 1-1.1. ACM, 2003.
13. G. Geeraerts, J.-F. Raskin, and L. Van Begin. Expand, enlarge, and check: New algorithms for the coverability problem of WSTS. In FSTTCS 04, LNCS 3328, pages 287-298. Springer, 2004.
14. S. Graf and H. Saïdi. Construction of abstract state graphs with PVS. In CAV 97: Computer Aided Verification, LNCS 1254, pages 72-83. Springer, 1997.
15. T. Harris and K. Fraser. Language support for lightweight transactions. In OOPSLA 03: Object-Oriented Pmgramming, Systems, Languages and Applications, pages 388-402, 2003.
16. T.A. Henzinger, R. Jhala, and R. Majumdar. Race checking by context inference. In PLDI 04: Pmgramming Languages Design and Implementation. ACM, 2004.
17. T.A. Henzinger, R. Jhala, R. Majumdar, and K.L. McMillan. Abstractions from proofs. In POPL 04: Principles of Programming Languages, pages 232-244. ACM, 2004.
18. T.A. Henzinger, R. Jhala, R. Majumdar, and G. Sutre. Lazy abstraction. In POPL 02: Principles of Programming Languages, pages 58-70. ACM, 2002.
19. E. Kohler, R. Morris, B. Chen, J. Jannotti, and M.F. Kaashoek. The Click modular router. ACM Transactions on Computing Systems, 18(3):263-297, 2000.
20. Libasync. http://pdos.csail.mit.edu/6.824-2004/async/.
21. Libevent. http://www.monkey.org/%7Eprovos/libevent/.
22. B.D. Lubachevsky. An approach to automating the verification of compact parallel coordination programs i. Acta Informatica, 21:125-169, 1984.
23. The mace project, http://mace.ucsd.edu/.
24. B. McCloskey, F. Zhou, D. Gay, and E. Brewer. Autolocker: Synchronization inference for atomic sections. In POPL '06: Principles of programming languages, pages 346-358. ACM, 2006.
25. V.S. Pai, P. Druschel, and W. Zwaenepoel. Flash: An efficient and portable web server. In Proc. USENIX Tech. Conf, pages 199-212. Usenix, 1999.
26. Rohit Parikh. On context-free languages. J. ACM, 13(4):570-581, 1966.
27. G. Ramalingam. Context-sensitive synchronization-sensitive analysis is undecidable. ACM TOPLAS, 22(2):416-430, 2000.
28. X Reps, S. Horwitz, and M. Sagiv. Precise interprocedural dataflow analysis via graph reachability. In POPL 95: Principles of Programming Languages, pages 49-61. ACM, 1995.
29. M.F. Ringenburg and D. Grossman. Atomcaml: first-class atomicity via rollback. In ICFP 05, pages 92-104, New York, NY, USA, 2005. ACM.
30. K. Sen and M. Vishwanathan. Model checking multithreaded programs with, asynchronous atomic methods. In CAV 06, LNCS 4314, pages 300-314. Springer, 2006.
31. M. Sharir and A. Pnueli. Two approaches to interprocedural data dalow analysis. In Program Flow Analysis: Theory and Applications, pages 189-233. Prentice-Hall, 1981.
32. N. Zeldovich, A. Yip, F. Dabek, R.T. Morris, D. Mazières, and M.F. Kaashoek. Multiprocessor support for event-driven programs. In USENIX Technical Conference, pages 239-252, 2003.