An efficient algorithm for computing MHP information for concurrent java programs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1687 LNCS, Issue , 1999, Pages 338-354

  Naumovich, Gleb ^a   Avrunin, George S ^a   Clarke, Lori A ^a  

^a Biologically Inspired Neural and Dynamical Systems Laboratory   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPLICATION PROGRAMS; DATA TRANSFER; JAVA PROGRAMMING LANGUAGE;

CONCURRENT JAVA PROGRAMS; CONCURRENT PROGRAM; EXPERIMENTAL COMPARISON; JAVA PROGRAM; MAY HAPPEN IN PARALLELS; PROGRAM OPTIMIZATION; PROGRAM UNDERSTANDING; REACHABILITY ANALYSIS;

PROGRAM DEBUGGING;

EID: 84887435787     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48166-4_21     Document Type: Conference Paper

References (21)

1. http://vislab-www.nps.navy.mil/java/course/sourcecode.
2. http://www.hensa.ac.uk/parallel/groups/wotug/java/applets.
3. http://www.kai.com/assurej.
4. D. Callahan and J. Subhlok. Static analysis of low-level synchronization. In Proceedings of the ACMSIGPLAN and SIGOPSWorkshop on Parallel and Distributed Debugging, number 1, pages 100-111, Jan. 1989.
5. J. C. Corbett. Constructing compact models of concurrent Java programs. In Proceedings of the ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA-98), pages 1-10, Mar. 1998.
6. E. Duesterwald and M. L. Sofia. Concurrency analysis in the presence of procedures using a data flow framework. In Proceedings of the ACM SIGSOFT Fourth Workshop on Software Testing, Analysis, and Verification, pages 36-48, Oct. 1991.
7. M. Hecht. Flow Analysis of Computer Programs. North-Holland, New York, 1977.
8. S. Horwitz, T. Reps, and M. Sagiv. Demand interprocedural dataflowanalysis. In Proceedings of the Third ACM SIGSOFT Symposium on the Foundations of Software Engineering, pages 104-115, Oct. 1995.
9. J. Krinke. Static slicing of threaded programs. In Proceedings of theACMSIGPLAN/SIGSOFT Workshop on Program Analysis for Software Tools and Engineering, pages 35-41, June 1998.
10. W. Landi and B. Ryder. Pointer-induced aliasing:Aproblem taxonomy. In Conference Record of the 18th Annual ACM Symposium on Principles of Programming Languages (POPL '91), pages 93-103, Jan. 1991.
11. D. Lea. Concurrent Programming in Java. Addison-Wesley, Reading, MA, 1997.
12. D. Lea. Concurrent programming in Java. Design principles and patterns, online supplement. http://gee.cs.oswego.edu/dl/cpj/index.html, Sept. 1998.
13. D. L. Long and L. A. Clarke. Task interaction graphs for concurrency analysis. In Proceedings of the 11th International Conference on Software Engineering, pages 44-52, May 1989.
14. S. Masticola and B. Ryder. A model of Ada programs for static deadlock detection in polynomial time. In Proceedings of the Workshop on Parallel and Distributed Debugging, pages 97-107, May 1991.
15. S. Masticola and B. Ryder. Non-concurrency analysis. In Proceedings of the Fourth ACM SIGPLAN Symposium on Principles & Practice of Parallel Programming, pages 129-138, May 1993.
16. S. P. Masticola, T. J. Marlowe, and B. G. Ryder. Lattice frameworks for multisource and bidirectional data flow problems. ACM Transactions on Programming Languages and Systems, 17(5):777-803, September 1995.
17. G. Naumovich and G. S. Avrunin. A conservative data flow algorithm for detecting all pairs of statements that may happen in parallel. In Proceedings of the Sixth ACMSIGSOFT Symposium on the Foundations of Software Engineering, pages 24-34, Nov. 1998.
18. G. Naumovich, G. S. Avrunin, and L. A. Clarke. An efficient algorithm for computing MHP information for concurrent Java programs. Technical Report 98-44, University of Massachusetts, Amherst, Oct. 1998. http://laser.cs.umass.edu/ abstracts/98-044.html.
19. G. Naumovich, G. S. Avrunin, and L. A. Clarke. Data flow analysis for checking properties of concurrent Java programs. In Proceedings of the 21st International Conference on Software Engineering, pages 399-410, May 1999.
20. J. Plevyak and A. A. Chien. Precise concrete type inference for object-oriented languages. In ACM SIGPLAN Proceedings of the 1994 Conference on Object-Oriented Programming, pages 324-340, Oct. 1994.
21. R. N. Taylor. Complexity of analyzing the synchronization structure of concurrent programs. Acta Informatica, 19:57-84, 1983.