Sound control-flow graph extraction for java programs with exceptions

Q: What are the future works mentioned in the paper "Sound control-flow graph extraction for java programs with exceptions" ?

Future Work. In addition, the authors will study how to adapt the algorithm to various generalizations of the program model, including data and multi-threading [ 12 ], and how to customize it for other types of instructions ( besides method calls and exceptions ).

Question

1. What contributions have the authors mentioned in the paper "Sound control-flow graph extraction for java programs with exceptions" ?

2. What are the future works mentioned in the paper "Sound control-flow graph extraction for java programs with exceptions" ?

3. What are the main features of Java bytecode?

4. What is the function that generates a CFG from a BIR method?

Accepted Answer

The authors present an algorithm to extract control-flow graphs from Java bytecode, considering exceptional flows.. The authors then establish its correctness: the behavior of the extracted graphs is shown to be a sound over-approximation of the behavior of the original programs.. First, the authors translate Java bytecode into BIR, a stack-less intermediate representation.. Besides Sawja ’ s efficiency, the resulting intermediate representation is more compact than the original bytecode and provides an explicit representation of exceptions.. Next, the authors formally define the transformation from BIR to control-flow graphs, which ( among other features ) considers the propagation of uncaught exceptions within method calls.. The authors prove the correctness of the two-phase extraction by suitably combining the properties of the two transformations with those of an idealized control-flow graph extraction algorithm, whose correctness has been proved directly.

Accepted Answer

Future Work.. In addition, the authors will study how to adapt the algorithm to various generalizations of the program model, including data and multi-threading [ 12 ], and how to customize it for other types of instructions ( besides method calls and exceptions ).

Accepted Answer

Java bytecode has several aspects of an object-oriented language that make the extraction of control-flow graphs complex, such as inheritance, exceptions, and virtual method calls.

Accepted Answer

It uses the transformation function bG, that takes as input a program counter and instruction from a BIR method, plus its exception table.

Accepted Answer

Instruction putfield f outputs a set of BIR instructions: [notnull e] guards if e is a valid reference; the auxiliary function FSavegenerates a sequence of assignments to temporary variables; followed by the assignment to the field e.f.

Accepted Answer

The authors use a standard notion of control-flow graph behavior based on pushdown automata, where configurations are pairs of control nodes and stacks of method invocations.

Accepted Answer

the JVM can raise (implicit) run-time exceptions, such as NullPointerException and IndexOutOfBoundsException, and to keep track of where such exceptions can be raised requires much care.

Accepted Answer

BIR supports the analysis of implicitly thrown exceptions by generating assertions that indicate when the next instruction might raise a run-time exception, following the approach proposed for the Jalapeño compiler [7].

Accepted Answer

The symbolic execution of the individual instructions is defined by a function BC2BIRinstr that, given a program counter, a JBC instruction and an abstract stack, outputs a sequence of BIR instructions and a modified abstract stack.

Accepted Answer

They show that the resulting program is semantics-preserving with respect to observable events, such as raising exceptions, and sequences of method invocations.

Accepted Answer

In the definition of the direct extraction algorithm [3], one can observe that all auxiliary instructions give rise to an internal transfer edge only.

Accepted Answer

A common approach is to generate an abstract model from the code, only preserving the information that is relevant for the class of properties of interest.

Sound control-flow graph extraction for java programs with exceptions

Chat with Paper

AI Agents for this Paper

Most frequently asked questions

1. What contributions have the authors mentioned in the paper "Sound control-flow graph extraction for java programs with exceptions" ?

2. What are the future works mentioned in the paper "Sound control-flow graph extraction for java programs with exceptions" ?

3. What are the main features of Java bytecode?

4. What is the function that generates a CFG from a BIR method?

5. What is the auxiliary function for the transformation of a BIR?

6. What is the definition of a control flow graph?

7. What is the way to analyze exceptions?

8. What is the main reason why the BIR algorithm is used?

9. What is the function that executes the instructions?

10. What are the results of Demange et al.?

11. What is the main theorem of the direct algorithm?

12. What is the common approach to extract control flow graphs from code?

Figures

Citations

Formal Verification of Object-Oriented Software : International Conference, FoVeOOS 2010, Paris, France, June 28-30, 2010, Revised Selected Papers

Recursion aware modeling and discovery for hierarchical software event log analysis

Recursion Aware Modeling and Discovery For Hierarchical Software Event Log Analysis (Extended)

Automatic security verification of mobile app configurations

Sound Control Flow Graph Extraction from Incomplete Java Bytecode Programs

References

Communicating and Mobile Systems: the Pi-Calculus

Communicating and Mobile Systems: the π-calculus,

Fast static analysis of C++ virtual function calls

Practical virtual method call resolution for Java

REFERENCES 59 Practical virtual method call resolution for Java

Related Papers (5)

Compositional verification of sequential programs with procedures

Sawja: static analysis workshop for java

The temporal logic of programs

CVPP: a tool set for compositional verification of control-flow safety properties

Program Models for Compositional Verification