Demand-driven evaluation of collection attributes

Summary, in English

n order to make attribute grammars useful for complicated analysis tasks, a number of extensions to the original Knuth formalism have been suggested. One such extension is the collection attribute mechanism, which allows the value of an attribute to be defined as a combination of contributions from distant nodes in the abstract syntax tree. Another extension that has proven useful is circular attributes, evaluated using fixed-point iteration. In this paper we show how collection attributes and the combined formalism, circular collection attributes, have been implemented in our declarative meta programming system JastAdd, and how they can be used for a variety of applications including devirtualization analysis, metrics and flow analysis. A number of evaluation algorithms are introduced and compared for applicability and efficiency. The key design criterion for our algorithms is that they work well with demand evaluation, i.e., defined properties are computed only if they are actually needed for a particular program. We show that the best algorithms work well on large practical problems including the analysis of large Java programs.

• Författare: Eva Magnusson; Torbjörn Ekman; Görel Hedin
• Avdelning/ar: Institutionen för datavetenskap; Programvaruteknik
• Publiceringsår: 2009
• Språk: Engelska
• Sidor: 291-322
• Publikation/Tidskrift/Serie: Automated Software Engineering
• Volym: 16
• Issue: 2
• Länkar: http://dx.doi.org/10.1007/s10515-009-0046-z
• Dokumenttyp: Artikel i tidskrift
• Förlag: Springer
• Ämne: Computer Science
• Nyckelord: Attribute grammars - Collection attributes - Circular attributes - Fixed-point computations - Source code analysis
• Status: Published
• Projekt: Embedded Applications Software Engineering
• ISBN/ISSN/Övrigt: ISSN: 1573-7535