publications:
- title: "Service configuration management"
  author:
  - name: "Eelco  Dolstra"
    link: "https://researchr.org/profile/eelcodolstra/publications"
  - name: "Martin  Bravenboer"
    link: "http://martin.bravenboer.name/"
  - name: "Eelco Visser"
    link: "http://eelcovisser.org"
  year: "2005"
  doi: "http://doi.acm.org/10.1145/1109128.1109135"
  abstract: "The deployment of services --- sets of running programs that provide some useful facility on a system or network --- is typically implemented through a manual, time-consuming and error-prone process. For instance, system administrators must deploy the necessary software components, edit configuration files, start or stop processes, and so on. This is often done in an ad hoc style with no reproducibility, violating proper configuration management practices. In this paper we show that build management, software deployment and service deployment can be integrated into a single formalism. We do this in the context of the Nix software deployment system, and show that its advantages --- co-existence of versions and variants, atomic upgrades and rollbacks, and component closure --- extend naturally to service deployment. The approach also elegantly extends to distributed services. In addition, we show that the Nix expression language can simplify the implementation of crosscutting variation points in services. "
  links:
    doi: "http://doi.acm.org/10.1145/1109128.1109135"
  tags:
  - "programming languages"
  - "SCM"
  - "deployment"
  - "software components"
  - "software deployment"
  - "Nix"
  - "software component"
  - "software configuration"
  - "service configuration management"
  - "context-aware"
  - "systematic-approach"
  researchr: "https://researchr.org/publication/DolstraBV05"
  cites: 0
  citedby: 0
  pages: "83-98"
  booktitle: "Proceedings of the 12th International Workshop on Software Configuration Management, SCM 2005, Lisbon, Portugal, September 5-6, 2005"
  publisher: "ACM"
  isbn: "1-59593-310-7"
  kind: "inproceedings"
  key: "DolstraBV05"
- title: "Strictly declarative specification of sophisticated points-to analyses"
  author:
  - name: "Martin  Bravenboer"
    link: "http://martin.bravenboer.name/"
  - name: "Yannis Smaragdakis"
    link: "http://smaragd.org"
  year: "2009"
  doi: "http://doi.acm.org/10.1145/1640089.1640108"
  abstract: "We present the DOOP framework for points-to analysis of Java programs. DOOP builds on the idea of specifying pointer analysis algorithms declaratively, using Datalog: a logic-based language for defining (recursive) relations. We carry the declarative approach further than past work by describing the full end-to-end analysis in Datalog and optimizing aggressively using a novel technique specifically targeting highly recursive Datalog programs. As a result, DOOP achieves several benefits, including full order-of-magnitude improvements in runtime. We compare DOOP with Lhotak and Hendren's PADDLE, which defines the state of the art for context-sensitive analyses. For the exact same logical points-to definitions (and, consequently, identical precision) DOOP is more than 15x faster than PADDLE for a 1-call-site sensitive analysis of the DaCapo benchmarks, with lower but still substantial speedups for other important analyses. Additionally, DOOP scales to very precise analyses that are impossible with PADDLE and Whaley et al.'s bddbddb, directly addressing open problems in past literature. Finally, our implementation is modular and can be easily configured to analyses with a wide range of characteristics, largely due to its declarativeness."
  links:
    doi: "http://doi.acm.org/10.1145/1640089.1640108"
  tags:
  - "programming languages"
  - "optimization"
  - "rule-based"
  - "Java"
  - "program analysis"
  - "points-to analysis"
  - "analysis"
  - "source-to-source"
  - "logic programming"
  - "context-aware"
  - "logic"
  - "program optimization"
  - "Datalog"
  - "systematic-approach"
  - "open-source"
  researchr: "https://researchr.org/publication/BravenboerS09"
  cites: 31
  citedby: 0
  pages: "243-262"
  booktitle: "Proceedings of the 24th Annual ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications, OOPSLA 2009, October 25-29, 2009, Orlando, Florida, USA"
  editor:
  - name: "Shail Arora"
    link: "https://researchr.org/alias/shail-arora"
  - name: "Gary T. Leavens"
    link: "https://researchr.org/alias/gary-t.-leavens"
  publisher: "ACM"
  isbn: "978-1-60558-766-0"
  kind: "inproceedings"
  key: "BravenboerS09"
- title: "Exception analysis and points-to analysis: better together"
  author:
  - name: "Martin  Bravenboer"
    link: "http://martin.bravenboer.name/"
  - name: "Yannis Smaragdakis"
    link: "http://smaragd.org"
  year: "2009"
  doi: "http://doi.acm.org/10.1145/1572272.1572274"
  abstract: "Exception analysis and points-to analysis are typically done in complete separation. Past algorithms for precise exception analysis (e.g., pairing throw clauses with catch statements) use pre-computed points-to information. Past points-to analyses either unsoundly ignore exceptions, or conservatively compute a crude approximation of exception throwing (e.g., considering an exception throw as an assignment to a global variable, accessible from any catch clause). We show that this separation results in significant slowdowns or vast imprecision. The two kinds of analyses are interdependent: neither can be performed accurately without the other. The interdependency leads us to propose a joint handling for performance and precision. We show that our exception analysis is expressible highly elegantly in a declarative form, and can apply to points-to analyses of varying precision. In fact, our specification of exception analysis is \"fully precise\", as it models closely the Java exception handling semantics. The necessary approximation is provided only through whichever abstractions are used for contexts and objects in the base points-to analysis. Our combined approach achieves similar precision relative to exceptions (exception-catch links) as the best past precise exception analysis, with a runtime of seconds instead of tens of minutes. At the same time, our analysis achieves much higher precision of points-to information (an average of half as many values for each reachable variable for most of the DaCapo benchmarks) than points-to analyses that treat exceptions conservatively, all at a fraction of the execution time."
  links:
    doi: "http://doi.acm.org/10.1145/1572272.1572274"
  tags:
  - "semantics"
  - "rule-based"
  - "Java"
  - "completeness"
  - "exceptions"
  - "points-to analysis"
  - "analysis"
  - "source-to-source"
  - "object-role modeling"
  - "information models"
  - "context-aware"
  - "abstraction"
  - "systematic-approach"
  - "open-source"
  researchr: "https://researchr.org/publication/BravenboerS09-0"
  cites: 0
  citedby: 0
  pages: "1-12"
  booktitle: "Proceedings of the Eighteenth International Symposium on Software Testing and Analysis, ISSTA 2009, Chicago, IL, USA, July 19-23, 2009"
  editor:
  - name: "Gregg Rothermel"
    link: "https://researchr.org/alias/gregg-rothermel"
  - name: "Laura K. Dillon"
    link: "https://researchr.org/alias/laura-k.-dillon"
  publisher: "ACM"
  isbn: "978-1-60558-338-9"
  kind: "inproceedings"
  key: "BravenboerS09-0"
- title: "Parse Table Composition"
  author:
  - name: "Martin  Bravenboer"
    link: "http://martin.bravenboer.name/"
  - name: "Eelco Visser"
    link: "http://eelcovisser.org"
  year: "2009"
  doi: "http://dx.doi.org/10.1007/978-3-642-00434-6_6"
  abstract: "Module systems, separate compilation, deployment of binary components, and dynamic linking have enjoyed wide acceptance in programming languages and systems. In contrast, the syntax of languages is usually defined in a non-modular way, cannot be compiled separately, cannot easily be combined with the syntax of other languages, and cannot be deployed as a component for later composition. Grammar formalisms that do support modules use whole program compilation. Current extensible compilers focus on source-level extensibility, which requires users to compile the compiler with a specific configuration of extensions. A compound parser needs to be generated for every combination of extensions. The generation of parse tables is expensive, which is a particular problem when the composition configuration is not fixed to enable users to choose language extensions. In this paper we introduce an algorithm for parse table composition to support separate compilation of grammars to parse table components. Parse table components can be composed (linked) efficiently at runtime, i.e. just before parsing. While the worst-case time complexity of parse table composition is exponential (like the complexity of parse table generation itself), for realistic language combination scenarios involving grammars for real languages, our parse table composition algorithm is an order of magnitude faster than computation of the parse table for the combined grammars. "
  links:
    doi: "http://dx.doi.org/10.1007/978-3-642-00434-6_6"
  tags:
  - "parsing algorithm"
  - "programming languages"
  - "deployment"
  - "syntax definition"
  - "SDF"
  - "composition"
  - "source-to-source"
  - "parse table composition"
  - "compiler"
  - "programming"
  - "language composition"
  - "parsing"
  - "extensible language"
  - "ASF+SDF"
  - "open-source"
  - "grammar"
  - "domain-specific language"
  researchr: "https://researchr.org/publication/BravenboerV08"
  cites: 0
  citedby: 0
  pages: "74-94"
  booktitle: "Software Language Engineering, First International Conference, SLE 2008, Toulouse, France, September 29-30, 2008. Revised Selected Papers"
  editor:
  - name: "Dragan Gasevic"
    link: "http://www.sfu.ca/~dgasevic/"
  - name: "Ralf Lämmel"
    link: "http://www.uni-koblenz.de/~laemmel/Site/Home.html"
  - name: "Eric {Van Wyk}"
    link: "http://www-users.cs.umn.edu/~evw/"
  volume: "5452"
  series: "Lecture Notes in Computer Science"
  publisher: "Springer"
  isbn: "978-3-642-00433-9"
  kind: "inproceedings"
  key: "BravenboerV08"
- title: "Concrete syntax for objects: domain-specific language embedding and assimilation without restrictions"
  author:
  - name: "Martin  Bravenboer"
    link: "http://martin.bravenboer.name/"
  - name: "Eelco Visser"
    link: "http://eelcovisser.org"
  year: "2004"
  doi: "http://doi.acm.org/10.1145/1028976.1029007"
  abstract: "Application programmer's interfaces give access to domain knowledge encapsulated in class libraries without providing the appropriate notation for expressing domain composition. Since object-oriented languages are designed for extensibility and reuse, the language constructs are often sufficient for expressing domain abstractions at the semantic level. However, they do not provide the right abstractions at the syntactic level. In this paper we describe MetaBorg, a method for providing <i>concrete syntax</i> for domain abstractions to application programmers. The method consists of <i>embedding</i> domain-specific languages in a general purpose host language and <i>assimilating</i> the embedded domain code into the surrounding host code. Instead of extending the implementation of the host language, the assimilation phase implements domain abstractions in terms of existing APIs leaving the host language undisturbed. Indeed, MetaBorg can be considered a method for promoting APIs to the language level. The method is supported by proven and available technology, i.e. the syntax definition formalism SDF and the program transformation language and toolset Stratego/XT. We illustrate the method with applications in three domains: code generation, XML generation, and user-interface construction."
  links:
    doi: "http://doi.acm.org/10.1145/1028976.1029007"
  tags:
  - "programming languages"
  - "object-oriented programming"
  - "concrete object syntax"
  - "syntax definition"
  - "meta programming"
  - "assimilation"
  - "SDF"
  - "XML"
  - "XML Schema"
  - "Stratego/XT"
  - "transformation language"
  - "composition"
  - "MetaBorg"
  - "language design"
  - "reuse"
  - "code generation"
  - "subject-oriented programming"
  - "abstraction"
  - "Meta-Environment"
  - "extensible language"
  - "ASF+SDF"
  - "feature-oriented programming"
  - "concrete syntax"
  - "meta-objects"
  - "transformation"
  - "Stratego"
  - "program transformation"
  - "domain-specific language"
  researchr: "https://researchr.org/publication/BravenboerV04"
  cites: 51
  citedby: 8
  pages: "365-383"
  booktitle: "Proceedings of the 19th Annual ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications, OOPSLA 2004"
  editor:
  - name: "John M. Vlissides"
    link: "https://researchr.org/alias/john-m.-vlissides"
  - name: "Douglas C. Schmidt"
    link: "https://researchr.org/alias/douglas-c.-schmidt"
  address: "Vancouver, BC, Canada"
  publisher: "ACM"
  isbn: "1-58113-831-8"
  kind: "inproceedings"
  key: "BravenboerV04"
- title: "Rewriting Strategies for Instruction Selection"
  author:
  - name: "Martin  Bravenboer"
    link: "http://martin.bravenboer.name/"
  - name: "Eelco Visser"
    link: "http://eelcovisser.org"
  year: "2002"
  doi: "https://doi.org/10.1007/3-540-45610-4_17"
  abstract: "Instruction selection (mapping IR trees to machine instructions) can be expressed by means of rewrite rules. Typically, such sets of rewrite rules are highly ambiguous. Therefore, standard rewriting engines based on fixed, exhaustive strategies are not appropriate for the execution of instruction selection. Code generator generators use special purpose implementations employing dynamic programming. In this paper we show how rewriting strategies for instruction selection can be encoded concisely in Stratego, a language for program transformation based on the paradigm of programmable rewriting strategies. This embedding obviates the need for a language dedicated to code generation, and makes it easy to combine code generation with other optimizations. "
  links:
    doi: "https://doi.org/10.1007/3-540-45610-4_17"
  tags:
  - "programming languages"
  - "optimization"
  - "rule-based"
  - "graph transformation"
  - "Stratego/XT"
  - "instruction selection"
  - "transformation language"
  - "term rewriting"
  - "graph-rewriting"
  - "rules"
  - "programming paradigms"
  - "code generation"
  - "programming"
  - "program optimization"
  - "rewriting"
  - "compilers"
  - "compilation"
  - "rewriting strategies"
  - "transformation"
  - "Stratego"
  - "program transformation"
  researchr: "https://researchr.org/publication/BravenboerV02"
  cites: 0
  citedby: 0
  pages: "237-251"
  booktitle: "Rewriting Techniques and Applications, 13th International Conference, RTA 2002, Copenhagen, Denmark, July 22-24, 2002, Proceedings"
  editor:
  - name: "Sophie Tison"
    link: "https://researchr.org/alias/sophie-tison"
  volume: "2378"
  series: "Lecture Notes in Computer Science"
  publisher: "Springer"
  isbn: "3-540-43916-1"
  kind: "inproceedings"
  key: "BravenboerV02"
- title: "Preventing injection attacks with syntax embeddings"
  author:
  - name: "Martin  Bravenboer"
    link: "http://martin.bravenboer.name/"
  - name: "Eelco  Dolstra"
    link: "https://researchr.org/profile/eelcodolstra/publications"
  - name: "Eelco Visser"
    link: "http://eelcovisser.org"
  year: "2010"
  doi: "http://dx.doi.org/10.1016/j.scico.2009.05.004"
  abstract: "Software written in one language often needs to construct sentences in another language, such as SQL queries, XML output, or shell command invocations. This is almost always done using unhygienic string manipulation, the concatenation of constants and client-supplied strings. A client can then supply specially crafted input that causes the constructed sentence to be interpreted in an unintended way, leading to an injection attack. We describe a more natural style of programming that yields code that is impervious to injections by construction. Our approach embeds the grammars of the guest languages (e.g. SQL) into that of the host language (e.g. Java) and automatically generates code that maps the embedded language to constructs in the host language that reconstruct the embedded sentences, adding escaping functions where appropriate. This approach is generic, meaning that it can be applied with relative ease to any combination of context-free host and guest languages."
  links:
    doi: "http://dx.doi.org/10.1016/j.scico.2009.05.004"
    dblp: "http://dblp.uni-trier.de/rec/bibtex/journals/scp/BravenboerDV10"
    technicalreport: "https://researchr.org/publication/preprint-BravenboerDV-SCP-2009"
  tags:
  - "injection attack"
  researchr: "https://researchr.org/publication/BravenboerDV10"
  cites: 0
  citedby: 0
  journal: "Science of Computer Programming"
  volume: "75"
  number: "7"
  pages: "473-495"
  kind: "article"
  key: "BravenboerDV10"
- title: "Home Page"
  author:
  - name: "Martin  Bravenboer"
    link: "http://martin.bravenboer.name/"
  researchr: "https://researchr.org/publication/homepages-b-MartinBravenboer"
  cites: 0
  citedby: 0
  howpublished: "http://martin.bravenboer.name/"
  kind: "misc"
  key: "homepages-b-MartinBravenboer"
- title: "Stratego/XT Reference Manual"
  author:
  - name: "Martin  Bravenboer"
    link: "http://martin.bravenboer.name/"
  - name: "Karl Trygve Kalleberg"
    link: "http://www.ii.uib.no/~karltk/"
  - name: "Rob Vermaas"
    link: "https://researchr.org/profile/robvermaas/publications"
  - name: "Eelco Visser"
    link: "http://eelcovisser.org"
  year: "2008"
  doi: "http://releases.strategoxt.org/strategoxt-manual/strategoxt-manual-0.17pre18721-8c3vml4h/manual/"
  links:
    doi: "http://releases.strategoxt.org/strategoxt-manual/strategoxt-manual-0.17pre18721-8c3vml4h/manual/"
    "html": "http://releases.strategoxt.org/strategoxt-manual/strategoxt-manual-0.17pre18721-8c3vml4h/manual/"
  researchr: "https://researchr.org/publication/StrategoXTReferenceManual"
  cites: 0
  citedby: 0
  kind: "manual"
  key: "StrategoXTReferenceManual"
- title: "Generalized Type-Based Disambiguation of Meta Programs with Concrete Object Syntax"
  author:
  - name: "Martin  Bravenboer"
    link: "http://martin.bravenboer.name/"
  - name: "Rob Vermaas"
    link: "https://researchr.org/profile/robvermaas/publications"
  - name: "Jurgen J.  Vinju"
    link: "http://homepages.cwi.nl/~jurgenv/"
  - name: "Eelco Visser"
    link: "http://eelcovisser.org"
  year: "2005"
  doi: "http://dx.doi.org/10.1007/11561347_12"
  abstract: "In meta programming with concrete object syntax, object-level programs are composed from fragments written in concrete syntax. The use of small program fragments in such quotations and the use of meta-level expressions within these fragments (anti-quotation) often leads to ambiguities. This problem is usually solved through explicit disambiguation, resulting in considerable syntactic overhead. A few systems manage to reduce this overhead by using type information during parsing. Since this is hard to achieve with traditional parsing technology, these systems provide specific combinations of meta and object languages, and their implementations are difficult to reuse. In this paper, we generalize these approaches and present a language independent method for introducing concrete object syntax without explicit disambiguation. The method uses scannerless generalized-LR parsing to parse meta programs with embedded object-level fragments, which produces a forest of all possible parses. This forest is reduced to a tree by a disambiguating type checker for the meta language. To validate our method we have developed embeddings of several object languages in Java, including AspectJ and Java itself. "
  links:
    doi: "http://dx.doi.org/10.1007/11561347_12"
  tags:
  - "programming languages"
  - "AspectJ"
  - "object-oriented programming"
  - "concrete object syntax"
  - "rule-based"
  - "Java"
  - "syntax definition"
  - "meta programming"
  - "SDF"
  - "meta-model"
  - "disambiguation"
  - "type system"
  - "reuse"
  - "programming"
  - "subject-oriented programming"
  - "Meta-Environment"
  - "parsing"
  - "scannerless parsing"
  - "systematic-approach"
  - "ASF+SDF"
  - "feature-oriented programming"
  - "concrete syntax"
  - "meta-objects"
  - "domain-specific language"
  researchr: "https://researchr.org/publication/BravenboerVVV05"
  cites: 0
  citedby: 2
  pages: "157-172"
  booktitle: "Generative Programming and Component Engineering, 4th International Conference, GPCE 2005"
  editor:
  - name: "Robert Glück"
    link: "http://www.diku.dk/hjemmesider/ansatte/glueck/"
  - name: "Michael R. Lowry"
    link: "https://researchr.org/alias/michael-r.-lowry"
  volume: "3676"
  series: "Lecture Notes in Computer Science"
  address: "Tallinn, Estonia"
  publisher: "Springer"
  isbn: "3-540-29138-5"
  kind: "inproceedings"
  key: "BravenboerVVV05"
- title: "Preventing injection attacks with syntax embeddings"
  author:
  - name: "Martin  Bravenboer"
    link: "http://martin.bravenboer.name/"
  - name: "Eelco  Dolstra"
    link: "https://researchr.org/profile/eelcodolstra/publications"
  - name: "Eelco Visser"
    link: "http://eelcovisser.org"
  year: "2007"
  doi: "http://doi.acm.org/10.1145/1289971.1289975"
  abstract: "Software written in one language often needs to construct sentences in another language, such as SQL queries, XML output, or shell command invocations. This is almost always done using unhygienic string manipulation, the concatenation of constants and client-supplied strings. A client can then supply specially crafted input that causes the constructed sentence to be interpreted in an unintended way, leading to an injection attack. We describe a more natural style of programming that yields code that is impervious to injections by construction. Our approach embeds the grammars of the guest languages (e.g., SQL) into that of the host language (e.g., Java) and automatically generates code that maps the embedded language to constructs in the host language that reconstruct the embedded sentences, adding escaping functions where appropriate. This approach is generic, meaning that it can be applied with relative ease to any combination of host and guest languages."
  links:
    doi: "http://doi.acm.org/10.1145/1289971.1289975"
    successor: "https://researchr.org/publication/BravenboerDV10"
  tags:
  - "programming languages"
  - "syntax embedding"
  - "Java"
  - "preventing injection attacks"
  - "generic programming"
  - "injection attack"
  - "SDF"
  - "XML"
  - "embedded software"
  - "XML Schema"
  - "SQL"
  - "security"
  - "language embedding"
  - "DSL"
  - "programming"
  - "systematic-approach"
  - "ASF+SDF"
  - "grammar"
  - "query language"
  researchr: "https://researchr.org/publication/BravenboerDV07"
  cites: 0
  citedby: 4
  pages: "3-12"
  booktitle: "Generative Programming and Component Engineering, 6th International Conference, GPCE 2007"
  editor:
  - name: "Charles Consel"
    link: "https://researchr.org/alias/charles-consel"
  - name: "Julia L. Lawall"
    link: "http://www.diku.dk/hjemmesider/ansatte/julia/"
  address: "Salzburg, Austria"
  publisher: "ACM"
  isbn: "978-1-59593-855-8"
  kind: "inproceedings"
  key: "BravenboerDV07"
- title: "Guiding visitors: separating navigation from computation"
  author:
  - name: "Martin  Bravenboer"
    link: "http://martin.bravenboer.name/"
  - name: "Eelco Visser"
    link: "http://eelcovisser.org"
  year: "2001"
  abstract: "Traversals over the object structure are widely used in object-oriented programming, in particular in language processing applications. The vis- itor pattern separates computation from traversal by specifying the com- putations that should be performed at each object in a separate visitor class. This makes the implementation of dierent computations reusing the same traversal scheme possible. However, navigation through the ob- ject structure is xed in the accept methods implemented by the objects that are traversed. This makes it dicult to use other navigation orders. In this paper, we introduce the Guide pattern that describes the sep- aration of navigation from computation and object structure using a double-dispatching iterator. The pattern makes it possible to implement a whole range of navigation schemes for an object-structure. Using a self- dispatching approach based on re ective method lookup such navigation schemes can be made reusable for whole classes of object-structures (im- plementing a common interface). The eciency of this approach is pro- vided by caching method lookups. We extend the approach to generic nav- igation through arbitrary object-structures using re ective eld lookup. This results in a generalization of the Walkabout class of Palsberg and Jay with a huge performance improvement in Java, making the Walka- bout usable in practice."
  links:
    "pdf": "http://www.cs.uu.nl/research/techreps/repo/CS-2001/2001-42.pdf"
    "uu-cs-2001-42": "http://www.cs.uu.nl/research/techreps/UU-CS-2001-42.html"
  tags:
  - "programming languages"
  - "object-oriented programming"
  - "rule-based"
  - "Java"
  - "meta programming"
  - "caching"
  - "pattern language"
  - "generic programming"
  - "traversal"
  - "visitor"
  - "reuse"
  - "e-science"
  - "programming"
  - "subject-oriented programming"
  - "Meta-Environment"
  - "systematic-approach"
  - "feature-oriented programming"
  - "meta-objects"
  researchr: "https://researchr.org/publication/BravenboerV01"
  cites: 0
  citedby: 0
  institution: "Department of Information and Computing Sciences, Utrecht University"
  number: "UU-CS-2001-42"
  kind: "techreport"
  key: "BravenboerV01"
- title: "Program Transformation with Scoped Dynamic Rewrite Rules"
  author:
  - name: "Martin  Bravenboer"
    link: "http://martin.bravenboer.name/"
  - name: "Arthur van Dam"
    link: "https://researchr.org/profile/arthurvandam/publications"
  - name: "Karina Olmos"
    link: "https://researchr.org/profile/karinaolmos/publications"
  - name: "Eelco Visser"
    link: "http://eelcovisser.org"
  year: "2006"
  doi: "https://content.iospress.com/articles/fundamenta-informaticae/fi69-1-2-06"
  abstract: "The applicability of term rewriting to program transformation is limited by the lack of control over rule application and by the context-free nature of rewrite rules. The first problem is addressed by languages supporting user-definable rewriting strategies. The second problem is addressed by the extension of rewriting strategies with scoped dynamic rewrite rules. Dynamic rules are defined at run-time and can access variables available from their definition context. Rules defined within a rule scope are automatically retracted at the end of that scope. In this paper, we explore the design space of dynamic rules, and their application to transformation problems. The technique is formally defined by extending the operational semantics underlying the program transformation language Stratego, and illustrated by means of several program transformations in Stratego, including constant propagation, bound variable renaming, dead code elimination, function inlining, and function specialization. "
  links:
    doi: "https://content.iospress.com/articles/fundamenta-informaticae/fi69-1-2-06"
    "technical report": "http://www.cs.uu.nl/research/techreps/UU-CS-2005-005.html"
  tags:
  - "programming languages"
  - "semantics"
  - "rule-based"
  - "formal semantics"
  - "graph transformation"
  - "dynamic rewrite rules"
  - "Stratego/XT"
  - "transformation language"
  - "term rewriting"
  - "language design"
  - "graph-rewriting"
  - "rules"
  - "operational semantics"
  - "context-aware"
  - "access control"
  - "rewriting"
  - "design"
  - "role-based access control"
  - "rewriting strategies"
  - "transformation"
  - "Stratego"
  - "program transformation"
  researchr: "https://researchr.org/publication/BravenboerDOV06"
  cites: 0
  citedby: 4
  journal: "Fundamenta Informaticae"
  volume: "69"
  number: "1-2"
  pages: "123-178"
  kind: "article"
  key: "BravenboerDOV06"
- title: "Stratego/XT 0.17. A language and toolset for program transformation"
  author:
  - name: "Martin  Bravenboer"
    link: "http://martin.bravenboer.name/"
  - name: "Karl Trygve Kalleberg"
    link: "http://www.ii.uib.no/~karltk/"
  - name: "Rob Vermaas"
    link: "https://researchr.org/profile/robvermaas/publications"
  - name: "Eelco Visser"
    link: "http://eelcovisser.org"
  year: "2008"
  doi: "http://dx.doi.org/10.1016/j.scico.2007.11.003"
  abstract: "Stratego/XT is a language and toolset for program transformation. The Stratego language provides rewrite rules for expressing basic transformations, programmable rewriting strategies for controlling the application of rules, concrete syntax for expressing the patterns of rules in the syntax of the object language, and dynamic rewrite rules for expressing context-sensitive transformations, thus supporting the development of transformation components at a high level of abstraction. The XT toolset offers a collection of flexible, reusable transformation components, and tools for generating such components from declarative specifications. Complete program transformation systems are composed from these components."
  links:
    doi: "http://dx.doi.org/10.1016/j.scico.2007.11.003"
    "technical report (pdf)": "http://swerl.tudelft.nl/twiki/pub/Main/TechnicalReports/TUD-SERG-2008-011.pdf"
    "stratego/xt": "http://strategoxt.org"
  tags:
  - "control systems"
  - "programming languages"
  - "object-oriented programming"
  - "concrete object syntax"
  - "reusable components"
  - "rule-based"
  - "completeness"
  - "meta programming"
  - "pattern language"
  - "graph transformation"
  - "Stratego/XT"
  - "transformation language"
  - "reuse"
  - "graph-rewriting"
  - "rules"
  - "transformation system"
  - "DSL"
  - "programming"
  - "subject-oriented programming"
  - "context-aware"
  - "abstraction"
  - "Meta-Environment"
  - "rewriting"
  - "rewriting strategies"
  - "feature-oriented programming"
  - "concrete syntax"
  - "meta-objects"
  - "transformation"
  - "Stratego"
  - "program transformation"
  researchr: "https://researchr.org/publication/BravenboerKVV08"
  cites: 0
  citedby: 7
  journal: "Science of Computer Programming"
  volume: "72"
  number: "1-2"
  pages: "52-70"
  kind: "article"
  key: "BravenboerKVV08"
- title: "Mixing source and bytecode: a case for compilation by normalization"
  author:
  - name: "Lennart C. L. Kats"
    link: "http://www.lclnet.nl/"
  - name: "Martin  Bravenboer"
    link: "http://martin.bravenboer.name/"
  - name: "Eelco Visser"
    link: "http://eelcovisser.org"
  year: "2008"
  doi: "http://doi.acm.org/10.1145/1449764.1449772"
  abstract: "Language extensions increase programmer productivity by providing concise, often domain-specific syntax, and support for static verification of correctness, security, and style constraints. Language extensions can often be realized through translation to the base language, supported by preprocessors and extensible compilers. However, various kinds of extensions require further adaptation of a base compiler's internal stages and components, for example to support separate compilation or to make use of low-level primitives of the platform (e.g., jump instructions or unbalanced synchronization). To allow for a more loosely coupled approach, we propose an open compiler model based on normalization steps from a high-level language to a subset of it, the core language. We developed such a compiler for a mixed Java and (core) bytecode language, and evaluate its effectiveness for composition mechanisms such as traits, as well as statement-level and expression-level language extensions. "
  links:
    doi: "http://doi.acm.org/10.1145/1449764.1449772"
    "technical report (pdf)": "http://www.lclnet.nl/publications/TUD-SERG-2008-030.pdf"
    "project home page": "http://www.strategoxt.org/Stratego/TheDryadCompiler"
  tags:
  - "compilation by normalization"
  - "rule-based"
  - "Java"
  - "synchronization"
  - "translation"
  - "meta-model"
  - "modeling language"
  - "Stratego/XT"
  - "language modeling"
  - "composition"
  - "constraints"
  - "source-to-source"
  - "C++"
  - "Dryad"
  - "security"
  - "compiler"
  - "Meta-Environment"
  - "extensible language"
  - "systematic-approach"
  - "open-source"
  - "Stratego"
  - "JavaFront"
  - "domain-specific language"
  researchr: "https://researchr.org/publication/KatsBV08"
  cites: 44
  citedby: 3
  pages: "91-108"
  booktitle: "Proceedings of the 23rd Annual ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications, OOPSLA 2008, October 19-23, 2008, Nashville, TN, USA"
  editor:
  - name: "Gail E. Harris"
    link: "https://researchr.org/alias/gail-e.-harris"
  publisher: "ACM"
  isbn: "978-1-60558-215-3"
  kind: "inproceedings"
  key: "KatsBV08"
- title: "Stratego/XT 0.16: components for transformation systems"
  author:
  - name: "Martin  Bravenboer"
    link: "http://martin.bravenboer.name/"
  - name: "Karl Trygve Kalleberg"
    link: "http://www.ii.uib.no/~karltk/"
  - name: "Rob Vermaas"
    link: "https://researchr.org/profile/robvermaas/publications"
  - name: "Eelco Visser"
    link: "http://eelcovisser.org"
  year: "2006"
  doi: "http://doi.acm.org/10.1145/1111542.1111558"
  abstract: "Stratego/XT is a language and toolset for program transformation. The Stratego language provides rewrite rules for expressing basic transformations, programmable rewriting strategies for controlling the application of rules, concrete syntax for expressing the patterns of rules in the syntax of the object language, and dynamic rewrite rules for expressing context-sensitive transformations, thus supporting the development of transformation components at a high level of abstraction. The XT toolset offers a collection of flexible, reusable transformation components, as well as declarative languages for deriving new components. Complete program transformation systems are composed from these components. In this paper we give an overview of Stratego/XT 0.16. "
  links:
    doi: "http://doi.acm.org/10.1145/1111542.1111558"
    successor: "https://researchr.org/publication/BravenboerKVV08"
  tags:
  - "control systems"
  - "programming languages"
  - "object-oriented programming"
  - "concrete object syntax"
  - "reusable components"
  - "rule-based"
  - "completeness"
  - "meta programming"
  - "pattern language"
  - "graph transformation"
  - "Stratego/XT"
  - "transformation language"
  - "reuse"
  - "graph-rewriting"
  - "rules"
  - "transformation system"
  - "subject-oriented programming"
  - "context-aware"
  - "abstraction"
  - "Meta-Environment"
  - "rewriting"
  - "rewriting strategies"
  - "feature-oriented programming"
  - "concrete syntax"
  - "meta-objects"
  - "transformation"
  - "Stratego"
  - "program transformation"
  researchr: "https://researchr.org/publication/BravenboerKVV06"
  cites: 0
  citedby: 0
  pages: "95-99"
  booktitle: "Proceedings of the 2006 ACM SIGPLAN Workshop on Partial Evaluation and Semantics-based Program Manipulation, 2006, Charleston, South Carolina, USA, January 9-10, 2006"
  editor:
  - name: "John Hatcliff"
    link: "http://people.cis.ksu.edu/~hatcliff/newweb/"
  - name: "Frank Tip"
    link: "http://domino.research.ibm.com/comm/research_people.nsf/pages/tip.index.html"
  publisher: "ACM"
  isbn: "1-59593-196-1"
  kind: "inproceedings"
  key: "BravenboerKVV06"
- title: "Designing Syntax Embeddings and Assimilations for Language Libraries"
  author:
  - name: "Martin  Bravenboer"
    link: "http://martin.bravenboer.name/"
  - name: "Eelco Visser"
    link: "http://eelcovisser.org"
  year: "2008"
  abstract: "Language libraries extend regular libraries with domain-specific notation. More precisely, a language library is a combination of a domain-specific language embedded in the general-purpose host language, a regular library implementing the underlying functionality, and an assimilation transformation that maps embedded DSL fragments to host language code. While the basic architecture for realizing language libraries is the same for all applications, there are many design choices to be made in the design of a particular combination of library, guest language syntax, host language, and assimilation. In this paper, we give an overview of the design space for syntax embeddings and assimilations for the realization of language libraries. "
  links:
    published: "https://researchr.org/publication/BravenboerV07"
  tags:
  - "assimilation"
  - "transformation language"
  - "architecture"
  - "language design"
  - "DSL"
  - "design"
  - "transformation"
  - "domain-specific language"
  researchr: "https://researchr.org/publication/TUD-SERG-2008-042"
  cites: 0
  citedby: 0
  institution: "Software Engineering Research Group, Delft University of Technology"
  number: "TUD-SERG-2008-042"
  kind: "techreport"
  key: "TUD-SERG-2008-042"
- title: "Grammar Engineering Support for Precedence Rule Recovery and Compatibility Checking"
  author:
  - name: "Eric Bouwers"
    link: "http://www.st.ewi.tudelft.nl/~bouwers/main/"
  - name: "Martin  Bravenboer"
    link: "http://martin.bravenboer.name/"
  - name: "Eelco Visser"
    link: "http://eelcovisser.org"
  year: "2008"
  doi: "http://dx.doi.org/10.1016/j.entcs.2008.03.046"
  abstract: "A wide range of parser generators are used to generate parsers for programming languages. The grammar formalisms that come with parser generators provide different approaches for defining operator precedence. Some generators (e.g. YACC) support precedence declarations, others require the grammar to be unambiguous, thus encoding the precedence rules. Even if the grammar formalism provides precedence rules, a particular grammar might not use it. The result is grammar variants implementing the same language. For the C language, the GNU Compiler uses YACC with precedence rules, the C-Transformers uses SDF without priorities, while the SDF library does use priorities. For PHP, Zend uses YACC with precedence rules, whereas PHP-front uses SDF with priority and associativity declarations. The variance between grammars raises the question if the precedence rules of one grammar are compatible with those of another. This is usually not obvious, since some languages have complex precedence rules. Also, for some parser generators the semantics of precedence rules is defined operationally, which makes it hard to reason about their effect on the defined language. We present a method and tool for comparing the precedence rules of different grammars and parser generators. Although it is undecidable whether two grammars define the same language, this tool provides support for comparing and recovering precedence rules, which is especially useful for reliable migration of a grammar from one grammar formalism to another. We evaluate our method by the application to non-trivial mainstream programming languages, such as PHP and C."
  links:
    doi: "http://dx.doi.org/10.1016/j.entcs.2008.03.046"
  tags:
  - "programming languages"
  - "semantics"
  - "rule-based"
  - "syntax definition"
  - "YACC"
  - "precedence rule"
  - "SDF"
  - "Stratego/XT"
  - "language engineering"
  - "grammar engineering"
  - "PHP"
  - "rules"
  - "C++"
  - "migration"
  - "compiler"
  - "programming"
  - "operational semantics"
  - "priority"
  - "parsing"
  - "scannerless parsing"
  - "systematic-approach"
  - "ASF+SDF"
  - "grammar"
  - "Stratego"
  researchr: "https://researchr.org/publication/BouwersBV08"
  cites: 0
  citedby: 1
  journal: "Electronic Notes in Theoretical Computer Science"
  volume: "203"
  number: "2"
  pages: "85-101"
  kind: "article"
  key: "BouwersBV08"
- title: "Declarative, formal, and extensible syntax definition for AspectJ"
  author:
  - name: "Martin  Bravenboer"
    link: "http://martin.bravenboer.name/"
  - name: "Éric Tanter"
    link: "http://pleiad.dcc.uchile.cl/people/etanter"
  - name: "Eelco Visser"
    link: "http://eelcovisser.org"
  year: "2006"
  doi: "http://doi.acm.org/10.1145/1167473.1167491"
  abstract: " Aspect-Oriented Programming (AOP) is attracting attention from both research and industry, as illustrated by the ever-growing popularity of AspectJ, the de facto standard AOP extension of Java. From a compiler construction perspective AspectJ is interesting as it is a typical example of compositional language, ie a language composed of a number of separate languages with different syntactical styles: in addition to plain Java, AspectJ includes a language for defining pointcuts and one for defining advices. Language composition represents a non-trivial challenge for conventional parsing techniques. First, combining several languages with different lexical syntax leads to considerable complexity in the lexical states to processed. Second, as new language features for AOP are being explored, many research proposals are concerned with further extending the AspectJ language, resulting in a need for an extensible syntax definition.This paper shows how scannerless parsing elegantly addresses the issues encountered by conventional techniques when parsing AspectJ . We present the design of a modular, extensible, and formal definition of the lexical and context-free aspects of the AspectJ syntax in the Syntax Definition Formalism SDF, which is implemented by a scannerless, generalized-LR parser (SGLR). We introduce grammar mixins as a novel application of SDF's modularity features, which allows the declarative definition of different keyword policies and combination of extensions. We illustrate the modular extensibility of our definition with syntax extensions taken from current research on aspect languages. Finally, benchmarks show the reasonable performance of scannerless generalized-LR parsing for this grammar. "
  links:
    doi: "http://doi.acm.org/10.1145/1167473.1167491"
  tags:
  - "programming languages"
  - "AspectJ"
  - "object-oriented programming"
  - "Java"
  - "syntax definition"
  - "SDF"
  - "lexical syntax"
  - "design complexity"
  - "composition"
  - "design research"
  - "language design"
  - "aspect oriented programming"
  - "compiler"
  - "programming"
  - "subject-oriented programming"
  - "context-aware"
  - "language composition"
  - "parsing"
  - "design"
  - "scannerless parsing"
  - "extensible language"
  - "ASF+SDF"
  - "feature-oriented programming"
  - "SGLR"
  - "grammar"
  researchr: "https://researchr.org/publication/BravenboerTV06"
  cites: 0
  citedby: 1
  pages: "209-228"
  booktitle: "Proceedings of the 21th Annual ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications, OOPSLA 2006, October 22-26, 2006, Portland, Oregon, USA"
  editor:
  - name: "Peri L. Tarr"
    link: "http://portal.acm.org/author_page.cfm?id=81100131551&coll=GUIDE&dl=GUIDE&trk=0&CFID=51133021&CFTOKEN=87963901"
  - name: "William R. Cook"
    link: "http://www.cs.utexas.edu/~wcook/"
  publisher: "ACM"
  isbn: "1-59593-348-4"
  kind: "inproceedings"
  key: "BravenboerTV06"
- title: "Preventing injection attacks with syntax embeddings"
  author:
  - name: "Martin  Bravenboer"
    link: "http://martin.bravenboer.name/"
  - name: "Eelco  Dolstra"
    link: "https://researchr.org/profile/eelcodolstra/publications"
  - name: "Eelco Visser"
    link: "http://eelcovisser.org"
  year: "2010"
  month: "July"
  abstract: "Software written in one language often needs to construct sentences in another language, such as SQL queries, XML output, or shell command invocations. This is almost always done using unhygienic string manipulation, the concatenation of constants and client-supplied strings. A client can then supply specially crafted input that causes the constructed sentence to be interpreted in an unintended way, leading to an injection attack. We describe a more natural style of programming that yields code that is impervious to injections by construction. Our approach embeds the grammars of the guest languages (e.g. SQL) into that of the host language (e.g. Java) and automatically generates code that maps the embedded language to constructs in the host language that reconstruct the embedded sentences, adding escaping functions where appropriate. This approach is generic, meaning that it can be applied with relative ease to any combination of context-free host and guest languages."
  links:
    published: "https://researchr.org/publication/BravenboerDV10"
  tags:
  - "programming languages"
  - "Java"
  - "generic programming"
  - "injection attack"
  - "XML"
  - "embedded software"
  - "XML Schema"
  - "SQL"
  - "programming"
  - "context-aware"
  - "systematic-approach"
  - "grammar"
  - "query language"
  researchr: "https://researchr.org/publication/preprint-BravenboerDV-SCP-2009"
  cites: 0
  citedby: 0
  type: "Preprint"
  kind: "techreport"
  key: "preprint-BravenboerDV-SCP-2009"
- title: "Designing Syntax Embeddings and Assimilations for Language Libraries"
  author:
  - name: "Martin  Bravenboer"
    link: "http://martin.bravenboer.name/"
  - name: "Eelco Visser"
    link: "http://eelcovisser.org"
  year: "2007"
  doi: "http://dx.doi.org/10.1007/978-3-540-69073-3_5"
  abstract: "Language libraries extend regular libraries with domain-specific notation. More precisely, a language library is a combination of a domain-specific language embedded in the general-purpose host language, a regular library implementing the underlying functionality, and an assimilation transformation that maps embedded DSL fragments to host language code. While the basic architecture for realizing language libraries is the same for all applications, there are many design choices to be made in the design of a particular combination of library, guest language syntax, host language, and assimilation. In this paper, we give an overview of the design space for syntax embeddings and assimilations for the realization of language libraries. "
  links:
    doi: "http://dx.doi.org/10.1007/978-3-540-69073-3_5"
    technicalreport: "https://researchr.org/publication/TUD-SERG-2008-042"
  tags:
  - "syntax embedding"
  - "syntax definition"
  - "assimilation"
  - "transformation language"
  - "architecture"
  - "language design"
  - "DSL"
  - "language libraries"
  - "design"
  - "transformation"
  - "domain-specific language"
  researchr: "https://researchr.org/publication/BravenboerV07"
  cites: 24
  citedby: 1
  pages: "34-46"
  booktitle: "Models in Software Engineering, Workshops and Symposia at MoDELS 2007, Nashville, TN, USA, September 30 - October 5, 2007, Reports and Revised Selected Papers"
  editor:
  - name: "Holger Giese"
    link: "https://researchr.org/alias/holger-giese"
  volume: "5002"
  series: "Lecture Notes in Computer Science"
  publisher: "Springer"
  isbn: "978-3-540-69069-6"
  kind: "inproceedings"
  key: "BravenboerV07"
- title: "Exercises in free syntax. Syntax definition, parsing, and assimilation of language conglomerates"
  author:
  - name: "Martin  Bravenboer"
    link: "http://martin.bravenboer.name/"
  year: "2008"
  month: "January"
  links:
    "thesis": "http://martin.bravenboer.name/thesis.html"
  tags:
  - "syntax definition"
  - "assimilation"
  - "parsing"
  researchr: "https://researchr.org/publication/Bra08"
  cites: 168
  citedby: 1
  school: "Utrecht University"
  address: "Utrecht, The Netherlands"
  advisor:
  - name: "S. Doaitse Swierstra"
    link: "http://www.cs.uu.nl/staff/doaitse.html"
  - name: "Eelco Visser"
    link: "http://eelcovisser.org"
  kind: "phdthesis"
  key: "Bra08"
- title: "MetaBorg in Action: Examples of Domain-Specific Language Embedding and Assimilation Using Stratego/XT"
  author:
  - name: "Martin  Bravenboer"
    link: "http://martin.bravenboer.name/"
  - name: "René de Groot"
    link: "http://strategoxt.org/Main/ReneDeGroot"
  - name: "Eelco Visser"
    link: "http://eelcovisser.org"
  year: "2006"
  doi: "http://dx.doi.org/10.1007/11877028_10"
  abstract: "General-purpose programming languages provide limited facilities for expressing domain-specific concepts in a natural manner. All domain concepts need to be captured using the same generic syntactic and semantic constructs. Generative programming methods and program transformation techniques can be used to overcome this lack of abstraction in general-purpose languages. In this tutorial we describe the MetaBorg method for embedding domain-specific languages, tailored syntactically and semantically to the application domain at hand, in a general-purpose language. MetaBorg is based on Stratego/XT, a language and toolset for the implementation of program transformation systems, which is used for the definition of syntactic embeddings and assimilation of the embedded constructs into the surrounding code. We illustrate MetaBorg with three examples. JavaSwul is a custom designed language for implementing graphical user-interfaces, which provides high-level abstractions for component composition and event-handling. JavaRegex is a new embedding of regular expression matching and string rewriting. JavaJava is an embedding of Java in Java for generating Java code. For these cases we show how Java programs in these domains become dramatically more readable, and we give an impression of the implementation of the language embeddings. "
  links:
    doi: "http://dx.doi.org/10.1007/11877028_10"
  tags:
  - "generative programming"
  - "programming languages"
  - "rule-based"
  - "transformation engineering"
  - "Java"
  - "generic programming"
  - "assimilation"
  - "graph transformation"
  - "Stratego/XT"
  - "language engineering"
  - "domain-specific language embedding"
  - "transformation language"
  - "composition"
  - "MetaBorg"
  - "language design"
  - "graph-rewriting"
  - "transformation system"
  - "language embedding"
  - "DSL"
  - "programming"
  - "abstraction"
  - "language composition"
  - "rewriting"
  - "transformation"
  - "Stratego"
  - "program transformation"
  - "domain-specific language"
  researchr: "https://researchr.org/publication/BravenboerGV06"
  cites: 0
  citedby: 3
  pages: "297-311"
  booktitle: "Generative and Transformational Techniques in Software Engineering, International Summer School, GTTSE 2005, Braga, Portugal, July 4-8, 2005. Revised Papers"
  editor:
  - name: "Ralf Lämmel"
    link: "http://www.uni-koblenz.de/~laemmel/Site/Home.html"
  - name: "João Saraiva"
    link: "http://di.uminho.pt/~jas"
  - name: "Joost Visser"
    link: "http://www.di.uminho.pt/~joost.visser/"
  volume: "4143"
  series: "Lecture Notes in Computer Science"
  publisher: "Springer"
  isbn: "3-540-45778-X"
  kind: "inproceedings"
  key: "BravenboerGV06"