ACM Home Page
Please provide us with feedback. Feedback
Efficient and precise modeling of exceptions for the analysis of Java programs
Full text PdfPdf (1.16 MB)
Source Workshop on Program Analysis for Software Tools and Engineering archive
Proceedings of the 1999 ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering table of contents
Toulouse, France
Pages: 21 - 31  
Year of Publication: 1999
ISBN:1-58113-137-2
Also published in ...
Authors
Jong-Deok Choi  IBM Research, Thomas J. Watson Research Center, P.O. Box 704, Yorktown Heights, NY
David Grove  IBM Research, Thomas J. Watson Research Center, P.O. Box 704, Yorktown Heights, NY
Michael Hind  IBM Research, Thomas J. Watson Research Center, P.O. Box 704, Yorktown Heights, NY
Vivek Sarkar  IBM Research, Thomas J. Watson Research Center, P.O. Box 704, Yorktown Heights, NY
Sponsors
SIGSOFT: ACM Special Interest Group on Software Engineering
SIGPLAN: ACM Special Interest Group on Programming Languages
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 49,   Citation Count: 40
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/316158.316171
What is a DOI?

ABSTRACT

The Factored Control Flow Graph, FCFG, is a novel representation of a program's intraprocedural control flow, which is designed to efficiently support the analysis of programs written in languages, such as Java, that have frequently occurring operations whose execution may result in exceptional control flow. The FCFG is more compact than traditional CFG representations for exceptional control flow, yet there is no loss of precision in using the FCFG. In this paper, we introduce the FCFG representation and outline how standard forward and backward data flow analysis algorithms can be adapted to work on this representation. We also present empirical measurements of FCFG sizes for a large number of methods obtained from a variety of Java programs, and compare these sizes with those of a traditional CFG representation.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
Bowen Alpern, Anthony Cocchi, Derek Lieber, Mark Mergen, and Vivek Sarkar. Jalapeiio - a compiler-supported Java virtual machine for servers. In ACM SIGPLAN Workshop on Compiler Support for System Software, pages 36-46, May 1999. INRIA Technical Report #0228.
3
4
 
5
Craig Chambers. The Cecil language: Specification and rationale. Technical Report UW-CSE-93-03-05, Department of Computer Science and Engineering. University of Washington, March 1993. Revised, March 1997.
 
6
7
8
 
9
J. A. Fisher. Trace scheduling: A technique for global microcode compaction. IEEE Transactions on Computers, 7(C-30):478-490, July 1981.
 
10
Robert Fitzgerald, Todd B. Knoblock, Erik Ruf, Bjarne Steensgaard, and David Tarditi. Marmot: An optimizing compiler for Java. Technical Report MSR-TR-99-33, Microsoft Research, June 1999.
 
11
12
 
13
14
 
15
16
 
17
18
 
19
Micha Sharir and Amir Pnueli. Two approaches to interprocedural data flow analysis. In Steven S. Muchnick and Neil D. Jones, editors, Program Flow Analysis: Theory and Applications, chapter 7, pages 189-234. Prentice-Hall, 1981.
 
20

CITED BY  40

Collaborative Colleagues:
Jong-Deok Choi: colleagues
David Grove: colleagues
Michael Hind: colleagues
Vivek Sarkar: colleagues