Advanced

Extending Attribute Grammars with Collection Attributes - Evaluation and Applications

Magnusson, Eva LU ; Ekman, Torbjörn LU and Hedin, Görel LU (2007) SCAM 2007 - Seventh IEEE International Working Conference on Source Code Analysis And Manipulation In Seventh IEEE International Working Conference on Source Code Analysis and Manipulation, SCAM 2007. p.69-78
Abstract
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... (More)
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. (Less)
Please use this url to cite or link to this publication:
author
organization
publishing date
type
Chapter in Book/Report/Conference proceeding
publication status
published
subject
keywords
source code analysis, Attribute grammars, metrics, collection attributes
in
Seventh IEEE International Working Conference on Source Code Analysis and Manipulation, SCAM 2007.
pages
10 pages
publisher
IEEE--Institute of Electrical and Electronics Engineers Inc.
conference name
SCAM 2007 - Seventh IEEE International Working Conference on Source Code Analysis And Manipulation
external identifiers
  • WOS:000251240100007
  • Scopus:47749088929
ISBN
0-7695-2880-5
DOI
10.1109/SCAM.2007.4362899
language
English
LU publication?
yes
id
d4da1052-b40e-4792-ad3e-a8d549093b4c (old id 634097)
date added to LUP
2007-12-18 10:05:04
date last changed
2016-10-13 04:38:40
@misc{d4da1052-b40e-4792-ad3e-a8d549093b4c,
  abstract     = {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.<br/><br>
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.},
  author       = {Magnusson, Eva and Ekman, Torbjörn and Hedin, Görel},
  isbn         = {0-7695-2880-5},
  keyword      = {source code analysis,Attribute grammars,metrics,collection attributes},
  language     = {eng},
  pages        = {69--78},
  publisher    = {ARRAY(0x951de98)},
  series       = {Seventh IEEE International Working Conference on Source Code Analysis and Manipulation, SCAM 2007.},
  title        = {Extending Attribute Grammars with Collection Attributes - Evaluation and Applications},
  url          = {http://dx.doi.org/10.1109/SCAM.2007.4362899},
  year         = {2007},
}