Finding Bugs in Program Generators by Dynamic Analysis of Syntactic Language Constraints1

Conference paper (2014)

Authors

S.T. Erdweg Technische Universität Darmstadt

V.A. Vergu Programming Languages -

Mira Mezini Technische Universität Darmstadt

Eelco Visser Programming Languages -

Research Group

Programming Languages () (TU Delft)

Spoofax Dynamic analysis Program transformation Abstract syntax tree Generative programming SugarJ Typesmart constructors Well-formedness checks

To reference this document use:

http://resolver.tudelft.nl/uuid:04eb78c4-3d55-41a6-8271-e52692a18db1

More Info

expand_more

Published Date

2014

Language

English

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Faculty

Electrical Engineering, Mathematics and Computer Science

Department

Software Technology

Research Group

Programming Languages

Abstract

Program generators and transformations are hard to implement correctly, because the implementation needs to generically describe how to construct programs, for example, using templates or rewrite rules. We apply dynamic analysis to program generators in order to support developers in finding bugs and identifying the source of the bug. Our analysis focuses on syntactic language constraints and checks that generated programs are syntactically well-formed. To retain a language's grammar as the unique specification of the language's syntax, we devised mechanisms to derive the analysis from the grammar. Moreover, we designed a run-time system to support the modular activation/deactivation of the analysis, so that generators do not require adaption. We have implemented the analysis for the Stratego term-rewriting language and applied it in case studies based on Spoofax and SugarJ.