Extensible intraprocedural flow analysis at the abstract syntax tree level

Summary, in English

We have developed a new approach for implementing precise intraprocedural control-flow and dataflow analyses at the abstract syntax tree level. Our approach is declarative, making use of reference attribute grammars augmented with circular attributes and collection attributes. This results in concise executable specifications of the analyses, allowing extensions both to the language and with further source code analyses.



To evaluate the new approach, we have implemented control flow, dataflow and dead assignment analyses for Java, by extending the JastAdd Extensible Java Compiler. We have compared our results to several well-known analysis frameworks and tools, using a set of Java programs as benchmarks. These results show that our approach performs well concerning both efficiency and preciseness.

• Författare: Emma Söderberg; Torbjörn Ekman; Görel Hedin; Eva Magnusson
• Avdelning/ar: Institutionen för datavetenskap; ELLIIT: the Linköping-Lund initiative on IT and mobile communication; eSSENCE: The e-Science Collaboration; Programvaruteknik
• Publiceringsår: 2013
• Språk: Engelska
• Sidor: 1809-1827
• Publikation/Tidskrift/Serie: Science of Computer Programming
• Volym: 78
• Issue: 10
• Länkar: http://dx.doi.org/10.1016/j.scico.2012.02.002
• Dokumenttyp: Artikel i tidskrift
• Förlag: Elsevier
• Ämne: Computer Science
• Status: Published
• Projekt: ELLIIT LU P05: Scalable Language Tools for Cyber-Physical Systems
• ISBN/ISSN/Övrigt: ISSN: 0167-6423