Macrofication: Refactoring by Reverse Macro Expansion

Schuster, Christopher; Disney, Tim; Flanagan, Cormac

doi:10.1007/978-3-662-49498-1_25

Cited by 3 publications

(3 citation statements)

References 38 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The notion of a "macrofication", i.e., the idea of refactoring source code by introducing macros in an automated manner, has already been proposed (Schuster, Disney, and Flanagan 2016). The motivation for reversing macro expansion, or what we call macro instantiation, is improved readability and maintenance.…”

Section: Related Workmentioning

confidence: 99%

Minimal Macro-Based Rewritings of Formal Languages: Theory and Applications in Ontology Engineering (and Beyond)

Kindermann,

George,

Parsia

et al. 2024

AAAI

View full text Add to dashboard Cite

In this paper, we introduce the problem of rewriting finite formal languages using syntactic macros such that the rewriting is minimal in size. We present polynomial-time algorithms to solve variants of this problem and show their correctness. To demonstrate the practical relevance of the proposed problems and the feasibility and effectiveness of our algorithms in practice, we apply these to biomedical ontologies authored in OWL. We find that such rewritings can significantly reduce the size of ontologies by capturing repeated expressions with macros. This approach not only offers valuable assistance in enhancing ontology quality and comprehension but can also be seen as a general methodology for evaluating features of rewriting systems (including syntactic macros, templates, or other forms of rewriting rules), which can be analyzed in terms of their influence on computational problems.

show abstract

Section: Related Workmentioning

confidence: 99%

Minimal Macro-Based Rewritings of Formal Languages: Theory and Applications in Ontology Engineering (and Beyond)

Kindermann,

George,

Parsia

et al. 2024

AAAI

View full text Add to dashboard Cite

show abstract

“…Some other approaches rely on code metrics, e.g., too many methods in a class [39]- [42]; and conceptual information retrieved from the source code vocabulary [43], [44]. In different way, Schuster et al proposed refactoring at compilation time [45]. Their idea is to match a pattern-template macro with code fragments and replaces them with equivalent but simpler pattern.…”

Section: Related Workmentioning

confidence: 99%

Recommending source code locations for system specific transformations

Santos

Paixão²,

Anquetil³

et al. 2017

2017 IEEE 24th International Conference on Software Analysis, Evolution and Reengineering (SANER)

View full text Add to dashboard Cite

From time to time, developers perform sequences of code transformations in a systematic and repetitive way. This may happen, for example, when introducing a design pattern in a legacy system: similar classes have to be introduced, containing similar methods that are called in a similar way. Automation of these sequences of transformations has been proposed in the literature to avoid errors due to their repetitive nature. However, developers still need support to identify all the relevant code locations that are candidate for transformation. Past research showed that these kinds of transformation can lag for years with forgotten instances popping out from time to time as other evolutions bring them into light. In this paper, we evaluate three distinct code search approaches ("structural", based on Information Retrieval, and AST based algorithm) to find code locations that would require similar transformations. We validate the resulting candidate locations from these approaches on real cases identified previously in literature. The results show that looking for code with similar roles, e.g., classes in the same hierarchy, provides interesting results with an average recall of 87% and in some cases the precision up to 70%.

show abstract

“…This is captured by a bidirectional transformation. The bidirectional pattern is found in a broad range of applications, including parsing [30,17], refactoring [31], code generation [27,21], and model transformation [32] and XML transformation [25].…”

Section: Introductionmentioning

confidence: 99%

Composing Bidirectional Programs Monadically

Xia

Orchard

Wang

2019

Programming Languages and Systems

View full text Add to dashboard Cite

Software frequently converts data from one representation to another and vice versa. Naïvely specifying both conversion directions separately is error prone and introduces conceptual duplication. Instead, bidirectional programming techniques allow programs to be written which can be interpreted in both directions. However, these techniques often employ unfamiliar programming idioms via restricted, specialised combinator libraries. Instead, we introduce a framework for composing bidirectional programs monadically, enabling bidirectional programming with familiar abstractions in functional languages such as Haskell. We demonstrate the generality of our approach applied to parsers/printers, lenses, and generators/predicates. We show how to leverage compositionality and equational reasoning for the verification of round-tripping properties for such monadic bidirectional programs.

show abstract

Macrofication: Refactoring by Reverse Macro Expansion

Cited by 3 publications

References 38 publications

Minimal Macro-Based Rewritings of Formal Languages: Theory and Applications in Ontology Engineering (and Beyond)

Minimal Macro-Based Rewritings of Formal Languages: Theory and Applications in Ontology Engineering (and Beyond)

Recommending source code locations for system specific transformations

Composing Bidirectional Programs Monadically

Contact Info

Product

Resources

About