Sciweavers

89 search results - page 13 / 18
» Canonical Abstract Syntax Trees
Sort
View
AOSD
2003
ACM
15 years 3 months ago
A case for statically executable advice: checking the law of demeter with AspectJ
We define a generic join point model for checking the Law of Demeter (LoD). Join points are trees, pointcuts are predicates over join points, and advice is checked statically sim...
Karl J. Lieberherr, David H. Lorenz, Pengcheng Wu
RE
2005
Springer
15 years 3 months ago
Reverse Engineering Goal Models from Legacy Code
A reverse engineering process aims at reconstructing el abstractions from source code. This paper presents a novel reverse engineering methodology for recovering stakeholder goal ...
Yijun Yu, Yiqiao Wang, John Mylopoulos, Sotirios L...
SAS
2000
Springer
15 years 1 months ago
Polymorphic versus Monomorphic Flow-Insensitive Points-to Analysis for C
Abstract We carry out an experimental analysis for two of the design dimensions of flow-insensitive points-to analysis for C: polymorphic versus monomorphic and equality-based vers...
Jeffrey S. Foster, Manuel Fähndrich, Alexande...
PEPM
2010
ACM
15 years 6 months ago
Clone detection and elimination for Haskell
Duplicated code is a well known problem in software maintenance and refactoring. Code clones tend to increase program size and several studies have shown that duplicated code make...
Christopher Brown, Simon Thompson
LICS
2007
IEEE
15 years 4 months ago
Static Name Control for FreshML
FreshML extends ML with constructs for declaring and ting abstract syntax trees that involve names and statically scoped binders. It is impure: name generation is an observable si...
François Pottier