Eichberg, Michael and Kübler, Florian and Helm, Dominik and Reif, Michael and Salvaneschi, Guido and Mezini, Mira (2018):
Lattice Based Modularization of Static Analyses.
In: Companion Proceedings for the ISSTA/ECOOP 2018 Workshops, pp. 113-118,
ACM, SOAP 2018, Amsterdam, Netherlands, DOI: 10.1145/3236454.3236509,
[Conference or Workshop Item]
Abstract
Static analyses which compute conceptually independent information, e.g., class immutability or method purity are typically developed as standalone, closed analyses. Complementary information that could improve the analyses is either ignored by making a sound over-approximation or it is also computed by the analyses, but at a rudimentary level. For example, an immutability analysis requires field mutability information, alias/escape information, and information about the concurrent behavior of methods to correctly classify classes like java.lang.String or java.util.BigDecimal. As a result, without properly supporting the integration of independently developed, mutually benefiting analysis, many analyses will not correctly classify relevant entities.
We propose to use explicitly reified lattices that encode the information about a source code element's properties (e.g., a method's purity or a class' immutability) as the sole interface between mutually dependent analyses. This enables the composition of multiple analyses. Our case study shows that using such an approach enables highly scalable, lightweight implementations of modularized static analyses.
Item Type: | Conference or Workshop Item |
---|---|
Erschienen: | 2018 |
Creators: | Eichberg, Michael and Kübler, Florian and Helm, Dominik and Reif, Michael and Salvaneschi, Guido and Mezini, Mira |
Title: | Lattice Based Modularization of Static Analyses |
Language: | English |
Abstract: | Static analyses which compute conceptually independent information, e.g., class immutability or method purity are typically developed as standalone, closed analyses. Complementary information that could improve the analyses is either ignored by making a sound over-approximation or it is also computed by the analyses, but at a rudimentary level. For example, an immutability analysis requires field mutability information, alias/escape information, and information about the concurrent behavior of methods to correctly classify classes like java.lang.String or java.util.BigDecimal. As a result, without properly supporting the integration of independently developed, mutually benefiting analysis, many analyses will not correctly classify relevant entities. We propose to use explicitly reified lattices that encode the information about a source code element's properties (e.g., a method's purity or a class' immutability) as the sole interface between mutually dependent analyses. This enables the composition of multiple analyses. Our case study shows that using such an approach enables highly scalable, lightweight implementations of modularized static analyses. |
Title of Book: | Companion Proceedings for the ISSTA/ECOOP 2018 Workshops |
Publisher: | ACM |
Uncontrolled Keywords: | Engineering; E1 |
Divisions: | 20 Department of Computer Science 20 Department of Computer Science > Software Technology DFG-Collaborative Research Centres (incl. Transregio) DFG-Collaborative Research Centres (incl. Transregio) > Collaborative Research Centres Profile Areas Profile Areas > Cybersecurity (CYSEC) LOEWE LOEWE > LOEWE-Zentren LOEWE > LOEWE-Zentren > CRISP - Center for Research in Security and Privacy DFG-Collaborative Research Centres (incl. Transregio) > Collaborative Research Centres > CRC 1119: CROSSING – Cryptography-Based Security Solutions: Enabling Trust in New and Next Generation Computing Environments |
Event Title: | SOAP 2018 |
Event Location: | Amsterdam, Netherlands |
Date Deposited: | 20 Dec 2018 16:34 |
DOI: | 10.1145/3236454.3236509 |
Official URL: | https://dl.acm.org/citation.cfm?id=3236509 |
Export: | |
Suche nach Titel in: | TUfind oder in Google |
![]() |
Send an inquiry |
Options (only for editors)
![]() |
Show editorial Details |