Javascript verkar inte påslaget? - Vissa delar av Lunds universitets webbplats fungerar inte optimalt utan javascript, kontrollera din webbläsares inställningar.
Du är här

Extending Attribute Grammars with Collection Attributes - Evaluation and Applications

Publiceringsår: 2007
Språk: Engelska
Sidor: 69-78
Publikation/Tidskrift/Serie: Seventh IEEE International Working Conference on Source Code Analysis and Manipulation, SCAM 2007.
Dokumenttyp: Konferensbidrag
Förlag: IEEE--Institute of Electrical and Electronics Engineers Inc.


Collection attributes, as defined by Boyland, can be used as a mechanism for concisely specifying cross-reference-like properties such as callee sets, subclass sets, and sets of variable uses.

We have implemented collection attributes in our declarative meta programming system JastAdd, and used them for a variety of applications including devirtualization analysis, metrics, and flow analysis. We propose a series of evaluation algorithms for collection attributes, and compare their performance and applicability. The key design criteria for our algorithms are 1) that they work well with demand evaluation, i.e., defined properties are computed only if they are actually needed for a particular source code analysis problem and a particular source program, and 2) that they work in the presence of circular (fixed-point) definitions that are common for many source code analysis problems, e.g., flow analysis. We show that the best algorithms work well on large practical problems, including the analysis of large Java programs.


  • Computer Science
  • source code analysis
  • Attribute grammars
  • metrics
  • collection attributes


SCAM 2007 - Seventh IEEE International Working Conference on Source Code Analysis And Manipulation
  • LUCAS-lup-obsolete
  • ISBN: 0-7695-2880-5

Box 117, 221 00 LUND
Telefon 046-222 00 00 (växel)
Telefax 046-222 47 20
lu [at] lu [dot] se

Fakturaadress: Box 188, 221 00 LUND
Organisationsnummer: 202100-3211
Om webbplatsen