A Constraint Language for Static Semantic Analysis Based on Scope Graphs with Proofs

In previous work, we introduced scope graphs as a formalism for describing program binding structure and performing name resolution in an AST-independent way. In this paper, we show how to use scope graphs to build static semantic analyzers. We use constraints extracted from the AST to specify facts about binding, typing, and initialization. We...

Measuring Library Stability Through Historical Version Analysis

Preprint of paper published in: ICSM 2012 - Proceedings of the IEEE International Conference on Software Maintenance, 23-28 September 2012; doi:10.1109/ICSM.2012.6405296 Backward compatibility is a major concern for any library developer. In this paper, we evaluate how stable a set of frequently used third-party libraries is in terms of method...

Declaratively Defining Domain-Specific Language Debuggers

Tool support is vital to the effectiveness of domain-specific languages. With language workbenches, domain-specific languages and their tool support can be generated from a combined, high-level specification. This paper shows how such a specification can be extended to describe a debugger for a language. To realize this, we introduce a meta...

Code Generation by Model Transformation: A Case Study in Transformation Modularity

Preprint of paper published in: Theory and Practice of Model Transformations (ICMT 2008), Lecture Notes in Computer Science 5063; doi:10.1007/978-3-540-69927-9_13 The realization of model-driven software development requires effective techniques for implementing code generators for domain-specific languages. This paper identifies techniques for...