research-article

TACAI: an intermediate representation based on abstract interpretation

Authors:

Florian Kübler,

Michael Eichberg,

Mira MeziniAuthors Info & Claims

SOAP 2020: Proceedings of the 9th ACM SIGPLAN International Workshop on the State Of the Art in Program Analysis

Pages 2 - 7

https://doi.org/10.1145/3394451.3397204

Published: 15 June 2020 Publication History

Abstract

Most Java static analysis frameworks provide an intermediate presentation (IR) of Java Bytecode to facilitate the development of static analyses. While such IRs are often based on three-address code, the transformation itself is a great opportunity to apply optimizations to the transformed code, such as constant propagation.

In this paper, we propose TACAI, a refinable IR that is based on abstract interpretation results of a method's bytecode. Exchanging the underlying abstract interpretation domains enables the creation of various IRs of different precision levels. Our evaluation shows that TACAI can be efficiently computed and provides slightly more precise receiver-type information than Soot's Shimple representation. Furthermore, we show how exchanging the underlying abstract domains directly impacts the generated IR.

Supplementary Material

MP4 File (3394451.3397204.mp4)

Video Presentation

Download
54.79 MB

References

[1]

Eric Bodden. 2018. The secret sauce in efficient and precise static analysis: the beauty of distributive, summary-based static analyses (and how to master them). In Companion Proceedings for the ISSTA/ECOOP 2018 Workshops. ACM, 85–93.

Digital Library

[2]

Rastislav Bodík, Rajiv Gupta, and Vivek Sarkar. 2000. ABCD: eliminating array bounds checks on demand. In ACM SIGPLAN Notices, Vol. 35. ACM, 321–333.

Digital Library

[3]

Ron Cytron, Jeanne Ferrante, Barry K Rosen, Mark N Wegman, and F Kenneth Zadeck. 1991. Efficiently computing static single assignment form and the control dependence graph. ACM Transactions on Programming Languages and Systems (TOPLAS) 13, 4 (1991), 451–490.

Digital Library

[4]

Jeffrey Dean, David Grove, and Craig Chambers. 1995. Optimization of object-oriented programs using static class hierarchy analysis. In European Conference on Object-Oriented Programming. Springer, 77– 101.

Digital Library

[5]

Delphine Demange, Thomas Jensen, and David Pichardie. 2010. A provably correct stackless intermediate representation for Java bytecode. In Asian Symposium on Programming Languages and Systems. Springer, 97–113.

[6]

JB Dietrich, Henrik Schole, Li Sui, and Ewan Tempero. 2017. XCorpus– An executable Corpus of Java Programs. (2017).

[7]

Michael Eichberg and Ben Hermann. 2014. A software product line for static analyses: the OPAL framework. In SOAP@PLDI. ACM, 2:1–2:6.

[8]

Michael Eichberg, Ben Hermann, Mira Mezini, and Leonid Glanz. 2015. Hidden truths in dead software paths. In Proceedings of the 2015 10th Joint Meeting on Foundations of Software Engineering. 474–484.

Digital Library

[9]

IBM. [n.d.]. WALA Framework. http://wala.sourceforge.net/. [Online; accessed 19-APRIL-2018].

[10]

Steven Muchnick et al. 1997. Advanced compiler design implementation. Morgan Kaufmann.

[11]

Yannis Smaragdakis. [n.d.]. DOOP Framework. https://bitbucket.org/ yanniss/doop/. [Online; accessed 23-August-2018].

[12]

Vijay Sundaresan, Laurie Hendren, Chrislain Razafimahefa, Raja Vallée-Rai, Patrick Lam, Etienne Gagnon, and Charles Godin. 2000.

[13]

Practical virtual method call resolution for Java. ACM SIGPLAN Notices 35, 10 (2000), 264–280.

[14]

Raja Vallée-Rai, Phong Co, Etienne Gagnon, Laurie Hendren, Patrick Lam, and Vijay Sundaresan. 2010. Soot: A Java bytecode optimization framework. In CASCON First Decade High Impact Papers. IBM Corp., 214–224.

Digital Library

[15]

Raja Vallee-Rai and Laurie J Hendren. 1998. Jimple: Simplifying Java bytecode for analyses and transformations. (1998).

[16]

Abstract 1 Introduction 2 Approach 3 Evaluation 4 Related Work 5 Conclusion Acknowledgments References

Cited By

Zhang HPei YLiang SXing ZTan SChristakis MPradel M(2024)Characterizing and Detecting Program Representation Faults of Static Analysis FrameworksProceedings of the 33rd ACM SIGSOFT International Symposium on Software Testing and Analysis10.1145/3650212.3680398(1772-1784)Online publication date: 11-Sep-2024
https://dl.acm.org/doi/10.1145/3650212.3680398
Helm DRoth TKeidel SReif MMezini MChristakis MPradel M(2024)Unimocg: Modular Call-Graph Algorithms for Consistent Handling of Language FeaturesProceedings of the 33rd ACM SIGSOFT International Symposium on Software Testing and Analysis10.1145/3650212.3652109(51-62)Online publication date: 11-Sep-2024
https://dl.acm.org/doi/10.1145/3650212.3652109

Index Terms

TACAI: an intermediate representation based on abstract interpretation
1. Software and its engineering
  1. Software organization and properties
    1. Software functional properties
      1. Formal methods
        Automated static analysis
2. Theory of computation
  1. Semantics and reasoning
    1. Program reasoning
      1. Program analysis

Recommendations

Precise null-pointer analysis

In Java, C or C++, attempts to dereference the null value result in an exception or a segmentation fault. Hence, it is important to identify those program points where this undesired behaviour might occur or prove the other program points (and possibly ...
An Efficient, Parametric Fixpoint Algorithm for Analysis of Java Bytecode

Abstract interpretation has been widely used for the analysis of object-oriented languages and, in particular, Java source and bytecode. However, while most existing work deals with the problem of finding expressive abstract domains that track ...
Abstract Interpretation of Java Bytecode in Sturdy
FTfJP 2024: Proceedings of the 26th ACM International Workshop on Formal Techniques for Java-like Programs

We develop a framework of definitional abstract interpreters for Java bytecode in Sturdy. Specifically, we provide a generic interpreter that abstractly executes Java bytecode but resorts to configurable analysis components for abstracting values and ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SOAP 2020: Proceedings of the 9th ACM SIGPLAN International Workshop on the State Of the Art in Program Analysis

June 2020

19 pages

ISBN:9781450379977

DOI:10.1145/3394451

Copyright © 2020 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGPLAN: ACM Special Interest Group on Programming Languages

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 15 June 2020

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

PLDI '20

Sponsor:

SIGPLAN

PLDI '20: 41st ACM SIGPLAN International Conference on Programming Language Design and Implementation

June 15, 2020

London, UK

Acceptance Rates

Overall Acceptance Rate 11 of 11 submissions, 100%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

1
Total Citations
View Citations
200
Total Downloads

Downloads (Last 12 months)21
Downloads (Last 6 weeks)2

Reflects downloads up to 27 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Zhang HPei YLiang SXing ZTan SChristakis MPradel M(2024)Characterizing and Detecting Program Representation Faults of Static Analysis FrameworksProceedings of the 33rd ACM SIGSOFT International Symposium on Software Testing and Analysis10.1145/3650212.3680398(1772-1784)Online publication date: 11-Sep-2024
https://dl.acm.org/doi/10.1145/3650212.3680398
Helm DRoth TKeidel SReif MMezini MChristakis MPradel M(2024)Unimocg: Modular Call-Graph Algorithms for Consistent Handling of Language FeaturesProceedings of the 33rd ACM SIGSOFT International Symposium on Software Testing and Analysis10.1145/3650212.3652109(51-62)Online publication date: 11-Sep-2024
https://dl.acm.org/doi/10.1145/3650212.3652109

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten