Sawja: Static Analysis Workshop for Java

Hubert, Laurent; Barré, Nicolas; Besson, Frédéric; Demange, Delphine; Jensen, Thomas; Monfort, Vincent; Pichardie, David; Turpin, Tiphaine

doi:10.1007/978-3-642-18070-5_7

Cited by 15 publications

(20 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We do not provide comparative data with other extraction tools, such as Soot [22], or Wala [14] because this would demand the implementation of similar extraction rules from their intermediate representations. However, experimental results from Sawja [11] show that it outperforms Soot in all tests w.r.t. the transformation into their respective intermediate representations, and outperforms Wala w.r.t.…”

Section: Methodsmentioning

confidence: 93%

Sound Control-Flow Graph Extraction for Java Programs with Exceptions

Amighi

Gomes

Gurov

et al. 2012

Software Engineering and Formal Methods

View full text Add to dashboard Cite

Abstract. 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 ConFlEx tool. A number of test-cases show the efficiency and the utility of the implementation.

show abstract

Section: Methodsmentioning

confidence: 93%

Sound Control-Flow Graph Extraction for Java Programs with Exceptions

Amighi

Gomes

Gurov

et al. 2012

Software Engineering and Formal Methods

View full text Add to dashboard Cite

show abstract

“…To get type annotations, we have ported the NIT implementation [25] to the Sawja platform [24] thus benefiting from a Bytecode Intermediate Language [19] that is closed to the idealised language of Section 2. For the time being, we do not generate VCs for BIR instructions that do not have a direct counterpart in our idealised language.…”

Section: Methodsmentioning

confidence: 99%

Result Certification of Static Program Analysers with Automated Theorem Provers

Besson

Cornilleau

Jensen

2014

Verified Software: Theories, Tools, Experiments

Self Cite

View full text Add to dashboard Cite

Abstract. The automation of the deductive approach to program verification crucially depends on the ability to efficiently infer and discharge program invariants. In an ideal world, user-provided invariants would be strengthened by incorporating the result of static analysers as untrusted annotations and discharged by automated theorem provers. However, the results of object-oriented analyses are heavily quantified and cannot be discharged, within reasonable time limits, by state-of-the-art automated theorem provers. In the present work, we investigate an original approach for verifying automatically and efficiently the result of certain classes of object-oriented static analyses using off-the-shelf automated theorem provers. We propose to generate verification conditions that are generic enough to capture, not a single, but a family of analyses which encompasses Java bytecode verification and Fähndrich and Leino typesystem for checking null pointers. For those analyses, we show how to generate tractable verification conditions that are still quantified but fall in a decidable logic fragment that is reducible to the Effectively Propositional logic. Our experiments confirm that such verification conditions are efficiently discharged by off-the-shelf automated theorem provers.

show abstract

“…Existing general purpose analysis frameworks for Java e.g., [32,19,17] cannot be applied directly to Java Card. Firstly, existing frameworks do not provide a CAP front-end -this is a non-negligible engineering issue.…”

Section: Overview Of the Static Analysis Enginementioning

confidence: 99%

SawjaCard: A Static Analysis Tool for Certifying Java Card Applications

2014

Self Cite

View full text Add to dashboard Cite

This paper describes the design and implementation of a static analysis tool for certifying Java Card applications, according to security rules defined by the smart card industry. Java Card is a dialect of Java designed for programming multi-application smart cards and the tool, called SawjaCard, has been specialised for the particular Java Card programming patterns. The tool is built around a static analysis engine which uses a combination of numeric and heap analysis. It includes a model of the Java Card libraries and the Java Card firewall. The tool has been evaluated on a series of industrial applets and is shown to automate a substantial part of the validation process.

show abstract

Sawja: Static Analysis Workshop for Java

Cited by 15 publications

References 22 publications

Sound Control-Flow Graph Extraction for Java Programs with Exceptions

Sound Control-Flow Graph Extraction for Java Programs with Exceptions

Result Certification of Static Program Analysers with Automated Theorem Provers

SawjaCard: A Static Analysis Tool for Certifying Java Card Applications

Contact Info

Product

Resources

About