Sound Control-Flow Graph Extraction for Java Programs with Exceptions

A. Amighi, Pedro de Carvalho Gomes, Dilian Gurov, Marieke Huisman

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    12 Citations (Scopus)
    76 Downloads (Pure)


    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.
    Original languageUndefined
    Title of host publication10th International Conference on Software Engineering and Formal Methods (SEFM 2012)
    EditorsGeorge Eleftherakis, Mike Hinchey, Mike Holcombe
    Place of PublicationBerlin
    Number of pages15
    ISBN (Print)978-3-642-33825-0
    Publication statusPublished - Oct 2012
    Event10th International Conference on Software Engineering and Formal Methods, SEFM 2012 - Thessaloniki, Greece
    Duration: 1 Oct 20125 Oct 2012
    Conference number: 10

    Publication series

    NameLecture Notes in Computer Science
    PublisherSpringer Verlag
    ISSN (Print)0302-9743
    ISSN (Electronic)1611-3349


    Conference10th International Conference on Software Engineering and Formal Methods, SEFM 2012
    Abbreviated titleSEFM


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

    Cite this