### Abstract

Original language | Undefined |
---|---|

Title of host publication | 10th International Conference on Software Engineering and Formal Methods (SEFM 2012) |

Editors | George Eleftherakis, Mike Hinchey, Mike Holcombe |

Place of Publication | Berlin |

Publisher | Springer |

Pages | 33-47 |

Number of pages | 15 |

ISBN (Print) | 978-3-642-33825-0 |

DOIs | |

Publication status | Published - Oct 2012 |

Event | 10th International Conference on Software Engineering and Formal Methods, SEFM 2012 - Thessaloniki, Greece Duration: 1 Oct 2012 → 5 Oct 2012 Conference number: 10 |

### Publication series

Name | Lecture Notes in Computer Science |
---|---|

Publisher | Springer Verlag |

Volume | 7504 |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Conference

Conference | 10th International Conference on Software Engineering and Formal Methods, SEFM 2012 |
---|---|

Abbreviated title | SEFM |

Country | Greece |

City | Thessaloniki |

Period | 1/10/12 → 5/10/12 |

### Keywords

- METIS-289716
- IR-82012
- EWI-22311
- Program model
- Control flow graph
- Program Analysis

### Cite this

*10th International Conference on Software Engineering and Formal Methods (SEFM 2012)*(pp. 33-47). (Lecture Notes in Computer Science; Vol. 7504). Berlin: Springer. https://doi.org/10.1007/978-3-642-33826-7_3

}

*10th International Conference on Software Engineering and Formal Methods (SEFM 2012).*Lecture Notes in Computer Science, vol. 7504, Springer, Berlin, pp. 33-47, 10th International Conference on Software Engineering and Formal Methods, SEFM 2012, Thessaloniki, Greece, 1/10/12. https://doi.org/10.1007/978-3-642-33826-7_3

**Sound Control-Flow Graph Extraction for Java Programs with Exceptions.** / Amighi, A.; de Carvalho Gomes, Pedro; Gurov, Dilian; Huisman, Marieke.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - Sound Control-Flow Graph Extraction for Java Programs with Exceptions

AU - Amighi, A.

AU - de Carvalho Gomes, Pedro

AU - Gurov, Dilian

AU - Huisman, Marieke

N1 - 10.1007/978-3-642-33826-7_3

PY - 2012/10

Y1 - 2012/10

N2 - We present an algorithm to extract control-flow graphs from Java bytecode, considering exceptional flows. We 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. Thus, any temporal safety property that holds for the extracted control-flow graph also holds for the original program. This makes the extracted graphs suitable for performing various static analyses, in particular model checking. The extraction proceeds in two phases. First, we translate Java bytecode into BIR, a stack-less intermediate representation. The BIR transformation is developed as a module of Sawja, a novel static analysis framework for Java bytecode. Besides Sawja’s efficiency, the resulting intermediate representation is more compact than the original bytecode and provides an explicit representation of exceptions. These features make BIR a natural starting point for sound control-flow graph extraction. Next, we formally define the transformation from BIR to control-flow graphs, which (among other features) considers the propagation of uncaught exceptions within method calls. We 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. The control-flow graph extraction algorithm is implemented in the \textsc{ConFlEx} tool. A number of test-cases show the efficiency and the utility of the implementation.

AB - We present an algorithm to extract control-flow graphs from Java bytecode, considering exceptional flows. We 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. Thus, any temporal safety property that holds for the extracted control-flow graph also holds for the original program. This makes the extracted graphs suitable for performing various static analyses, in particular model checking. The extraction proceeds in two phases. First, we translate Java bytecode into BIR, a stack-less intermediate representation. The BIR transformation is developed as a module of Sawja, a novel static analysis framework for Java bytecode. Besides Sawja’s efficiency, the resulting intermediate representation is more compact than the original bytecode and provides an explicit representation of exceptions. These features make BIR a natural starting point for sound control-flow graph extraction. Next, we formally define the transformation from BIR to control-flow graphs, which (among other features) considers the propagation of uncaught exceptions within method calls. We 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. The control-flow graph extraction algorithm is implemented in the \textsc{ConFlEx} tool. A number of test-cases show the efficiency and the utility of the implementation.

KW - METIS-289716

KW - IR-82012

KW - EWI-22311

KW - Program model

KW - Control flow graph

KW - Program Analysis

U2 - 10.1007/978-3-642-33826-7_3

DO - 10.1007/978-3-642-33826-7_3

M3 - Conference contribution

SN - 978-3-642-33825-0

T3 - Lecture Notes in Computer Science

SP - 33

EP - 47

BT - 10th International Conference on Software Engineering and Formal Methods (SEFM 2012)

A2 - Eleftherakis, George

A2 - Hinchey, Mike

A2 - Holcombe, Mike

PB - Springer

CY - Berlin

ER -