The Ekeko/X Program Transformation Tool

Roover, Coen De; Inoue, Katsuro

doi:10.1109/scam.2014.32

Cited by 10 publications

(8 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The .QL language [49] is powering a commercial quality assessment tool suite that computes metrics and violations of coding rules [50]. Ekeko [31] powers academic prototypes for tracing [51] and automating [52,53] changes to source code, and has been used in a large corpus study about the maintenance of automated functional tests [54]. Soul [29] powers, among others, a tool for enforcing design regularities in code [55] or for performing annotation-aware refactorings [56].…”

Section: Discussionmentioning

confidence: 99%

AspectJ code analysis and verification with GASR

Fabry

Roover

Noguera

et al. 2016

Journal of Systems and Software

Self Cite

View full text Add to dashboard Cite

• We argue for a general-purpose source code analysis tool that is aware of aspects.• We present the logic program querying tool GASR, the first such tool..• We discuss its implementation along with its library of logical predicates.• We show how it can automatically verify previously published aspectual assumptions. AbstractAspect-oriented programming languages extend existing languages with new features for supporting modularization of crosscutting concerns. These features however make existing source code analysis tools unable to reason over this code. Consequently, all code analysis efforts of aspect-oriented code that we are aware of have either built limited analysis tools or were performed manually. Given the significant complexity of building them or manual analysis, a lot of duplication of effort could have been avoided by using a general-purpose tool.To address this, in this paper we present Gasr: a source code analysis tool that reasons over AspectJ source code, which may contain metadata in the form of annotations. Gasr provides multiple kinds of analyses that are general enough such that they are reusable, tailorable and can reason over annotations. We demonstrate the use of Gasr in two ways: we first automate the recognition of previously identified aspectual source code assumptions. Second, we turn implicit assumptions into explicit assumptions through annotations and automate their verification. In both uses Gasr performs detection and verification of aspect assumptions on two well-known case studies that were manually investigated in earlier work. Gasr finds already known aspect assumptions and adds instances that had been previously overlooked.

show abstract

Section: Discussionmentioning

confidence: 99%

AspectJ code analysis and verification with GASR

Fabry

Roover

Noguera

et al. 2016

Journal of Systems and Software

Self Cite

View full text Add to dashboard Cite

show abstract

“…Pattern matching is a key component on which are built rewrite engines [15], refactoring engines [4], [16] (with support for pre-and post-conditions), powerful search engines [14], clone detection engine [17]. .…”

Section: A Pattern Matchingmentioning

confidence: 99%

“…To express inferred typing, two main approaches have been taken: query-by-example [24] and syntactic patterns [25], [14].…”

Section: Inferred Typingmentioning

confidence: 99%

“…Here condition and anyStatement are metavariables that will match any valid IR construct (not all IR constructs of the language) and the rest of the pattern is the standard syntax of the language to match (here Java). To forgo the IR requirement, syntactic patterns have been introduced (sometimes named "code templates") to build upon the syntax of languages instead of their IRs [12], [13], [14].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A Reflexive and Automated Approach to Syntactic Pattern Matching in Code Transformations

Lecerf¹,

Brant²,

Goubier³

et al. 2018

2018 IEEE International Conference on Software Maintenance and Evolution (ICSME)

View full text Add to dashboard Cite

Empowering software engineers often requires to let them write code transformations. However existing automated or tool-supported approaches force developers to have a detailed knowledge of the internal representation of the underlying tool. While this knowledge is time consuming to master, the syntax of the language, on the other hand, is already well known to developers and can serve as a strong foundation for pattern matching. Pattern languages with metavariables (that is variables holding abstract syntax subtrees once the pattern has been matched) have been used to help programmers define program transformations at the language syntax level. The question raised is then the engineering cost of metavariable support. Our contribution is to show that, with a GLR parser, such patterns with metavariables can be supported by using a form of runtime reflexivity on the parser internal structures. This approach allows one to directly implement such patterns on any parser generated by a parser generation framework, without asking the pattern writer to learn the AST structure and node types. As a use case for that approach we describe the implementation built on top of the SmaCC (Smalltalk Compiler Compiler) GLR parser generator framework. This approach has been used in production for source code transformations on a large scale. We will express perspectives to adapt this approach to other types of parsing technologies.

show abstract

“…In this tool demonstration paper, we present an extension to EKEKO/X [4], our template-based search and transformation tool for Java. 12 This extension consist of two components, both aiming to assist EKEKO/X users: the first component is a suite of mutation operators, which gradually grew in our own experience of writing templates.…”

Section: Introductionmentioning

confidence: 99%

Automated Generalization and Refinement of Code Templates with Ekeko/X

Molderez

Roover

2016

2016 IEEE 23rd International Conference on Software Analysis, Evolution, and Reengineering (SANER)

Self Cite

View full text Add to dashboard Cite

Code templates are an intuitive means to specify source code snippets of interest, such as all instances of a bug, groups of snippets that need to be refactored or transformed, or instances of design patterns. While intuitive, it is not always straightforward to write a template that produces only the desired matches. A template could produce either more snippets than desired, or too few. To assist the users of EKEKO/X, our template-based search and transformation tool for Java, we have extended it with two components: The first is a suite of mutation operators that simplifies the process of modifying templates. The second is a system that can automatically suggest a sequence of mutations to a given template, such that it matches only with a set of desired snippets. In this tool paper, we highlight the key design decisions in implementing these two components of EKEKO/X, and demonstrate their use by walking through an example sequence of mutations suggested by the system.

show abstract

The Ekeko/X Program Transformation Tool

Cited by 10 publications

References 17 publications

AspectJ code analysis and verification with GASR

AspectJ code analysis and verification with GASR

A Reflexive and Automated Approach to Syntactic Pattern Matching in Code Transformations

Automated Generalization and Refinement of Code Templates with Ekeko/X

Contact Info

Product

Resources

About