Abstract Interpretation of Program Transformations using Regular Tree Grammars

Title

Abstract Interpretation of Program Transformations using Regular Tree Grammars

 Author

Hidskes, Jente (TU Delft Electrical Engineering, Mathematics and Computer Science)

Contributor

Erdweg, Sebastian (mentor)
Keidel, Sven (mentor)
Visser, Eelco (graduation committee)
Panichella, Annibale (graduation committee)

Degree granting institution

Delft University of Technology

 Programme

Computer Science | Software Technology

 Date

2018-11-02

 Abstract

Many program transformation languages simplify the implementation of program transformations. However, they give only weak static guarantees about the generated code such as well-sortedness. Well-sortedness guarantees that a program transformation does not generate syntactically ill-formed code, but it is too imprecise for many other scenarios. In this paper, we present a static analysis that allows developers of program transformations to reason about their transformations on a more fine-grained level, namely that of syntactic shape. Specifically, we present an abstract interpreter for the Stratego program transformation language that approximates the syntactic shape of transformed code using regular tree grammars. As a baseline, we also present an abstract interpreter that guarantees well-sortedness. We prove parts of both abstract interpreters sound.

 Subject

Abstract interpretation
Regular tree grammar
Program transformation
Static analysis

 To reference this document use:

http://resolver.tudelft.nl/uuid:f634ef6a-68d1-4d38-9474-db8cdb12425f

 Part of collection

Student theses

 Document type

master thesis

 Rights

© 2018 Jente Hidskes
Files
PDF Abstract_Interpretation_o ... ammars.pdf 196.96 KB
Close viewer