Arie van Deursen - Paul Klint - Joost Visser
CWI, P.O. Box 94079, 1090 GB Amsterdam, The
In all branches of science and engineering one can distinguish between approaches that are generic and those that are specific. A generic approach provides a general solution for many problems in a certain area, but such a solution may be suboptimal. A specific approach provides a much better solution for a smaller set of problems. One of the incarnations of this dichotomy in computer science is the topic of this annotated bibliography: domain-specific languages versus generic programming languages.
Of course, this is not a new topic. The older programming languages (Cobol, Fortran, Lisp) all came into existence as dedicated languages for solving problems in a certain area (respectively business processing, numeric computation and symbolic processing). Gradually they have evolved into general purpose languages and over and over again the need for more specialized language support to solve problems in well-defined application domains has resurfaced. Over time, the following solutions have been tried:
Although many domain-specific languages have been designed and used over the years, the systematic study of domain-specific languages has only started more recently. This bibliography has grown out of our own research needs to make an inventory of the field and provides references to research that deals with the following topics: terminology (Section 2), risks and opportunities (Section 3), example DSLs (Section 4), DSL design methodology (Section 5), and DSL implementation strategies (Section 6). The papers listed are annotated with summaries, which in turn are cross-referenced to related papers.
Although these topics are the subject of current research and progress is being made in addressing them, we expect that they will remain important for several years to come.
The question what exactly is a domain-specific language is subject to debate. We propose the following definition:
A domain-specific language (DSL) is a programming language or executable specification language that offers, through appropriate notations and abstractions, expressive power focused on, and usually restricted to, a particular problem domain.The key characteristic of DSLs according to this definition is their focussed expressive power.
Our definition inherits the vagueness of one of its defining terms: problem domain. Rather than attempting to define this volatile notion as well, we list and categorize a number of domains for which DSLs have actually been built in Section 4. Moreover, we refer to , which contains an interesting discussion contrasting a ``domain as the real world'' point of view as adopted in the artificial intelligence community, with a ``domain as a set of systems'' approach, as used in the systematic software reuse research community.
DSLs are usually small, offering only a restricted suite of notations and abstractions. In the literature they are also called micro-languages and little languages . Sometimes, however, they contain an entire general-purpose language (GPL) as a sublanguage, thus offering domain-specific expressive power in addition to the expressive power of the GPL. This situation occurs when DSLs are implemented as embedded languages (see Section 6). Languages such as Cobol or Fortran, which could be viewed as languages tailored towards the domain of business and scientific programming, respectively, are generally not regarded as DSLs, because they are not small and because their expressive power is not restricted to these domains.
Domain-specific languages are usually declarative. Consequently, they can be viewed as specification languages, as well as programming languages. Many DSLs are supported by a DSL compiler which generates applications from DSL programs. In this case, the DSL compiler is referred to as application generator in the literature , and the DSL as application-specific language. Other DSLs, such as YACC  or ASDL , are not aimed at programming (specifying) complete applications, but rather at generating libraries or components. Also, DSLs exist for which execution consists in generating documents (TEX), or pictures (PIC ). A common term for DSLs geared towards building business data processing systems is 4th Generation Language (4GL).
Related to domain-specific programming is end-user programming, which happens when end-users perform simple programming tasks using a macro or scripting language. A typical example is spreadsheet programming using the Excel macro-language.
Adopting a DSL approach to software engineering involves both risks and opportunities. The well-designed DSL manages to find the proper balance between these two. The benefits of DSLs include:
Comparisons of the DSL approach to other approaches to software generation are made in [20,22,47]. In  the costs and benefits of DSLs are analyzed from the perspective of software maintenance. In , DSLs are categorized as one of the main approaches to software reuse, and a detailed comparison is made to other reuse techniques.
Literally hundreds of DSLs are in existence today. Of these, only a subset is actually described in the software engineering or programming language literature. Best-known are classical examples like PIC, SCATTER, CHEM, LEX, YACC, and Make, which are described in . Other well-known examples are SQL, BNF, and HTML. We have included references to various example domain-specific languages. Their domains can be grouped into the following areas:
@ - [Software Engineering] Financial products [12,22,24], behavior control and coordination [9,10], software architectures , and databases . [Systems Software] Description and analysis of abstract syntax trees [77,19,51], video device driver specifications , cache coherence protocols , data structures in C , and operating system specialization . [Multi-Media] Web computing [14,35,4,33], image manipulation , 3D animation , and drawing . [Telecommunications] String and tree languages for model checking , communication protocols , telecommunication switches , and signature computing . [Miscellaneous] Simulation [2,13], mobile agents , robot control , solving partial differential equations , and digital hardware design .
A collection of several papers on DSLs can be found in .
The development of a domain-specific language typically involves the following steps (see [17,24]):@ - [Analysis] (1) Identify the problem domain. (2) Gather all relevant knowledge in this domain. (3) Cluster this knowledge in a handful of semantic notions and operations on them. (4) Design a DSL that concisely describes applications in the domain. [Implementation] (5) Construct a library that implements the semantic notions. (6) Design and implement a compiler that translates DSL programs to a sequence of library calls. [Use] (7) Write DSL programs for all desired applications and compile them.
The aim of the analysis steps (1) through (4) is to build up a thorough understanding of the underlying application domain. Guidelines for acquiring such an understanding are provided by the research area of domain analysis which investigates ways of modeling domains. Following , a domain analyst is a person who examines the needs and requirements of a collection of systems which seem ``similar''. Neighbors emphasizes that this is work that only can be done by a person who has built many systems for different customers in the same problem area. The domain analyst is like a systems analyst, except that the goal is to support the development of families of related systems, not just one-of-a-kind productions .
Domain engineering  refers to the activity of systematically modeling domains. Domain engineering originates from research in the area of software reuse, and can be used when constructing domain-specific reusable libraries, frameworks or languages. A recent domain engineering survey is provided by [20, Chapter 3]. Several domain engineering methodologies exists, of which ODM (Organizational Domain Modeling [69,70]), FODA (Feature-Oriented Domain Analysis ), and DSSA (Domain-Specific Software Architectures ) are best known.
Strongly related to domain engineering is the notion of program families which are sets of similar programs [52,18]. At Lucent, a systematic approach to the development of families is in use, the Family-Oriented Abstraction, Specification and Translation (FAST) approach, which has been successfully applied to over 25 different domains . Program families are in turn related to software product lines. These emphasize features shared by all products, and are focused on the needs of a selected market [21,53,78].
A prerequisite to developing a DSL is mature domain knowledge. For that reason, a DSL is viewed as the final and most mature phase of the evolution of an object-oriented application framework [66,22]. For the same reason, the existence of legacy systems implementing domain concepts will be of use when developing a DSL for that domain . Reverse engineering techniques may be used to distill domain knowledge from such legacy systems -- an overview of such techniques is provided by [16,25].
The implementation steps (5) and (6) of the previous section can be carried out using several approaches:
The main advantage of building a compiler or interpreter is that the implementation is completely tailored towards the DSL and no concessions are necessary regarding notation, primitives and the like. Also, error detection, static analysis, and optimizations can be done at the domain level, for example using an effect system as in .
Clearly, an important problem is the cost of building such a compiler or interpreter from scratch, and the lack of reuse from other (DSL) implementations, although some DSL tool sets (for example InfoWiz ) are particularly designed to overcome such problems.
As an alternative to implementing a DSL from scratch, a DSL can be implemented by extending a given base language. For instance,  describes an extension of (a restricted version of) a general-purpose language with domain-specific constructs. The main advantage of this approach is that all features of the base language remain available and need not be re-implemented.
When implementing domain-specific extensions of a base language, the implementation of the base language can be reused in three different ways:
An advantage of this approach is that the compiler or interpreter of the base language is reused as is for the DSL. The main limitation is in the expressiveness of the syntactic mechanisms in the base language. In many cases, the optimal domain-specific notation has to be compromised to fit the limitations of the base language. Typical examples of this approach are  (a robot control language embedded in Haskell) and  (a PIC-like drawing language embedded in ML). The concept of domain-specific embedded language was coined by Hudak .
Apart from building a dedicated DSL compiler or interpreter, or reusing the implementation of an underlying base language, other implementation techniques may be used. For instance, in aspect-oriented programming  a DSL is used to describe an aspect of a system's behavior that is orthogonal to its main functionality. An aspect weaver is then used to generate domain-specific code and merge it with the main code.
In this paper, we have given a survey of the literature on domain-specific languages. We covered terminology, risks and opportunities, example DSLs, and design and implementation issues, listing relevant references for each of these topics. The references themselves are annotated with a summary of the most important results discussed in each paper.
For up to date information on the topic of domain-specific languages, we refer to the series of DSL conferences organized by USENIX [64,27], which most likely will have successors in the years to come.
Another valuable source of up to date information may be the web. A searchable domain engineering bibliography, with abstracts, is available at http://www.iese.fhg.de/pubs_and_links/spl/bibliography/. An online bibliography on the topic of generative programming can be found at http://home.t-online.de/home/Ulrich.Eisenecker/gpref.htm. Finally, http://www.irisa.fr/compose/dsl/ provides a survey of domain-specific languages in general.
Standard text on compiler construction.
Describes the language SHIFT for hybrid system simulation. Main application area is traffic simulation. Implemented by translation to C and a run-time library with solvers for various kinds of differential equations.
Outlines a framework to synthesize domain analysis methods, and to compare between different methods. The paper advocates an incremental, evolving approach towards developing domain models.
Describes the language Mawl that is intended for implementing form-based information services for different devices (web browser, interactive voice response service). The main contributions of this language are: (1) separation of user-interface code and service logic, (2) static type checking, (3) device-independence, (4) automatic generation of low-level CGI code, (5) automatic generation of HTML templates, and (6) automatic generation of usage statistics.
Envisions a framework for stepwise synthesis of domain-specific applications from informal specifications. The framework applies search techniques to explore possible refinements of an initial specification, given a base of domain and programming knowledge (facts and heuristics).
Reports on the design and implementation of Promela++, a DSL for protocol construction and validation. Promela++ adds domain-specific constructs to restricted C, and supports validation and optimization on the domain-level.
Demonstrates and advocates the use of ``little languages''. Takes PIC as an example, as well as a number of little languages from which PIC input is generated (SCATTER, CHEM), and little languages that were used to implement PIC (LEX, YACC, Make). Contrasts three approaches: interactive systems, subroutine libraries, and little languages. Discusses DSL design principles.
Introduces the Syntax Definition Formalism SDF, the Algebraic Specification Formalism ASF, and their combination, ASF+SDF, which can be used to describe the syntax and semantics of (domain-specific) languages. Contains several language definition case studies. See also [12,23].
Describes how a language based on process algebra is used in the TOOLBUS coordination architecture for building heterogeneous, distributed software systems. See also .
Many object-oriented languages contain only implicit constraints on the order of application of the methods in a class. This paper introduces the Behaviour Description Language (BDL) which uses a process-oriented notation to describe this ordering. BDL is translated to C, with ESTEREL as intermediary. The resulting C code is linked with a C++ program and acts as controller for the execution of C++ classes. See also .
Describes the language Hancock that is intended for signature computations on the data collected from telephone calls. A signature is a user profile with applications ranging from fraude detection to marketing. Typical issues are the large volume of data, the complex traversal patterns of these data and the different levels of precision for signatures. Hancock is translated to C combined with several run-time libraries. The major benefit of this DSL is a separation of concerns (traversal patterns, efficiency, signature computations). As a result programmers can concentrate on the signature computation, since the other concerns are taken care of by the DSL compiler. The major reason to design a DSL (as opposed to using a library) were the traversal patterns that cannot be captured in a library. The paper concludes with a description of the design process used.
Provides an overview of some industrial applications of the language prototyping environment ASF+SDF. The RISLA case study, involving a language for describing financial products, is discussed in considerable detail, covering pure RISLA, modular RISLA, and RISQUEST, a language for generating questionnaires used when composing new products. From a modular RISLA product description, COBOL code is generated for accessing a library of COBOL functions providing operations on cash flows, balances, intervals, and the like. See also [22,24].
Discusses the design of a DSL for parallel discrete event simulation. On the basis of this experience a number of observations are made regarding DSL design principles. Most notably, the use of a strong effect system is advocated to do static checking on the domain level, and to determine applicability of optimizations.
Access to the resources of the World-Wide Web is usually obtained though manual browsers. Service combinators are intended for writing programs that reproduce human browsing behaviour, including reactions to slow transmission rates and various kinds of failure. Based on a concurrent programming model, the paper gives both an informal and formal treatment of a DSL for Web computing.
The problem of cache coherence occurs when local replica of shared data are made in a distributed system in order to improve its scalability and performance. Writing the code to support coherence protocols is error-prone. This paper describes experience with the language Teapot for describing these protocols. Teapot programs can be translated to (1) C code that implements the protocol, or (2) input for an automatic verifier. Two case studies and overall experience with this approach are discussed.
Overview of reverse engineering techniques, which also can be used to distill domain knowledge from legacy system. See also [25,70].
Uses the term ``application generators'' to refer to DSL compilers. Gives a compiler generator architecture diagram. Describes relationships between roles of customers, domain engineers and system engineers. Lists pros and cons of application generators. Describes ``Stage'', an application-generator development tool. Describes a methodology for building an application generator.
A software family is a set of similar systems with possibly many different variations. Scope, commonality, and variability (SCV) analysis gives software engineers a systematic way of thinking about and identifying the product family they are creating. The paper describes the Family-Oriented Abstraction, Specification, and Translation (FAST) approach, which has been used with immediate payoff in over 25 domains at Lucent Technologies.
Introduces a Prolog-based query language for analyzing abstract syntax trees of C/C++ programs.
Gives a comprehensive discussion of a range of programming techniques that involve some sort of code generation step, such as aspect-oriented, subject-oriented, and adaptive programming, composition filters, and domain-specific languages. Chapter 3 of this book provides a survey of domain-engineering methods.
Argues that economic motives should be used for scoping software product lines, rather than more traditional domain engineering methods. The paper proposes PuLSE, which iteratively refines business objectives towards more operational evaluation criteria.
Contrasts domain-specific languages with object-oriented frameworks by comparing two projects in the financial engineering domain: RISLA (DSL) and the ET++SwapsManager (OO framework). See also .
Describes the use of ASF+SDF as a meta-language for the specification of syntax and semantics. After introducing ASF+SDF, a number of language specification case studies are presented, and various styles for writing language specifications are illustrated. Moreover, different techniques for generating tools from these are presented. See also .
Domain-specific languages (DSLs) have the potential to make software maintenance simpler: domain-experts can directly use the DSL to make required routine modifications. At the negative side, however, more substantial changes may become more difficult: such changes may involve altering the domain-specific language. This will require compiler technology knowledge, which not every commercial enterprise has easily available. The paper describes and uses the experience of the RISLA language for interest rate products to discuss the role of DSLs in software maintenance, the opportunities introduced by using them, and techniques for controlling the risks involved. See also .
Overview of parsing, transformation, and program understanding techniques that can be used when searching for domain knowledge in legacy systems. See also [16,70].
Discusses a domain-specific programming style for the domain of partial differential equations, using an expression style directly obtained from the underlying algebraic theory. The use of this style permits optimizations beyond the scope of current compiler optimizations.
Describes a multi-media extension for Haskell and discusses the merits of Haskell as basis for domain-specific extensions.
Describes the extensible ANSI C compiler framework MAGIK, which allows the dynamic incorporation of user-defined compiler extensions. The extensions can transform, optimize or inspect the generated intermediate representation. The approach gives safe access to compiler internals and supports full optimization of application-specific language extensions. Implemented on top of lcc. See also .
Presents Khepera, a tool kit for rapid implementation and long-term maintenance of DSLs via source-to-source transformation separated into three phases: parsing, AST transformation, and pretty-printing.
Introduction to a special issue on (domain-specific) object-oriented frameworks, which are defined as reusable, semi-complete applications that can be specialized to produce custom applications. Covers classification, strengths and weaknesses, and future trends. See also .
Covers a query language to describe data-intensive web sites. Three programming tasks are distinguished to build such sites: accessing and integrating the data available in the site, building the site's structure, and generating the HTML representation of the site. The solution proposed is a declarative query language (StruQL) to define the site's content and structure, a template language to define the HTML representation and an extension of the query language with functions to describe dynamic behaviour and to promote reusability of queries. Reengineering an existing AT&T web site using this approach has resulted in less, more maintainable, code with more functionality. The initial learning curve of the new language is more than compensated for by the advantages gained.
Proposes cc, a family of languages for concurrent constraint programming, as a framework for DSL construction. Two approaches are explained by example: building a DSL on top of cc, and extending cc with domain-specific constructs.
The current architecture of the Web is based on a client/server model in which most of the computation is done at the server side, while the client side is a browser that only displays the results of server computations. SGML/XML is used as meta-language for describing the interactions between heterogeneous agents on the Web. Essentially, a grammar is defined of all possible interactions and this grammar steers the behaviour of each agent. See  for a fully process-based approach to this problem.
Describes an extension of Tcl  for mobile agents.
A language is presented for annotating C libraries with information that is exploited by an optimizing compiler. Domain-specific information is conveyed by annotations that in effect define (i) a dataflow analysis problem on the various library procedures, and (ii) procedure specializations that are to be triggered by the outcome of the analysis. The approach aims at giving libraries some of the compiler support enjoyed by DSLs.
Discusses language prototyping tools (LPT) in general, as well as the specific LPT Kodiyak. Lists application areas of LPTs and benefits of applying them. Gives a brief description of Kodiyak and reports on experience with it.
Surveys a number of database query and update languages, as prime examples of application generators (DSL compilers), and hypothesizes a `generic' database language. Discusses the possibilities of combining such a language with a general purpose language. Outlines AdaRel, an extension of Ada with relational database programming constructs.
Argues that a DSL is the ``ultimate abstraction'', capturing precisely the semantics of the application domain, but also that designing and implementing languages is difficult and resists evolution. Proposes the notion of embedded DSLs, which inherit the infrastructructure from some other language, and discusses the importance of modular monadic interpreters, instrumentation, and partial evaluation.
Verilog, a digital hardware design language, is extended with facilities for generating and manipulating hardware descriptions by embedding it into the general purpose language Scheme. The extended language features early error detection and high customizability.
Introduced the notion of object-oriented frameworks. A framework is defined as a set of classes that embodies an abstract design for solutions to a family of related problems, and supports reuse at a larger granularity than classes. In a white-box framework, application-specific behavior is obtained via method overriding or by adding new methods to the framework's classes. In a black-box, support for extensibility is provided by defining interfaces for components that can be plugged into the framework via object composition, thus better hiding the implementation details of the framework. See also [32,66]
Describes FPIC, a reconstruction of the original PIC embedded in ML.
FODA is a domain engineering approach emphasizing feature analysis. A feature is defined as a prominent, user-visible characteristic of a software system. FODA aims at building up a feature model, consisting of a features diagram (hierarchical decomposition of mandatory, alternative, or optional features), feature definitions, composition rules for features, and a rationale for features indicating the trade-offs. See also [20,70]
Presents a novel programming technique, called aspect-oriented programming (AOP). This technique consists in describing each aspect (e.g. basic functionality, communication, coordination) of a system's behaviour in a (little) language that allows it to be expressed in its most natural form. An aspect weaver merges these separate aspect descriptions into a single, efficient program. An important benefit of AOP is that it allows high-level domain-specific programming for performance-critical domains. See also 
Reports the results of an experiment in which a template-based approach and a DSL approach to software generation were compared. Several subjects were monitored while performing a number of development and maintenance tasks using alternatively template technology and DSL technology. Flexibility, productivity, reliability, and usability were measured. The DSL approach scored better on all counts.
Describes design and implementation of FIDO, a language to express large finite-state automata on large alphabets. Typical application is in verification and model checking.
Categorizes, describes and compares existing approaches to software reuse, among which DSLs (or application generators). Compared to the other approaches DSLs reduce the intellectual effort required to obtain an executable system from its specification. Limited availability and difficulty of building DSLs of optimal specificity/generality are listed as disadvantages of DSLs.
Describes how PRL5, an application-oriented, declarative language used to maintain the integrity of databases in the AT&T 5ESS telecommunications switch, evolved from an earlier, imperative domain-specific language, PRL, which in turn replaced a combination of English and C. The constraint descriptions expressed in PRL5 can be used in more than one way, whereas a program to check constraints is useful only for performing that particular computation. A key lesson is that domain-specific languages should not be designed to describe computation, but to express useful facts from which one or more computations can be derived.
Explains how a DSL (SQL is taken as example) can be embedded in Haskell by (i) coding an abstract syntax of the DSL as a Haskell datatype (ii) writing a code generator in Haskell that maps the abstract syntax to the concrete syntax, and (iii) making Haskell call an external server which compiles and executes the generated DSL code.
Proceedings of a workshop originating from the ESPRIT ARES project, which investigates software architectures for families of embedded systems.
Describes recommendations and lessons learned from managing a reusability project at Boeing in the area of real-time training systems for flight crews. Product-line development separates the software-development process into two separate life cycles: domain engineering, which aims to create reusable assets, and application engineering, which fields systems using those assets. Lessons learned include that product-line development demands careful strategic planning, a mature development process, and the ability to overcome organizational resistance.
Gives a categorization of DSLs for describing software architectures.
Three kinds of source-to-source transformations for optimizing MATLAB programs are proposed and shown to be effective. The transformations yield performance benefits additional to those obtained by (optimizing) compilation, and may be useful for other DSLs that are high-level, untyped, and interpreted.
Describes and advocates the development of DSLs as jargons: domain-specific extensions of a tiny common base language. According to a new programming paradigm (infocentrism) the application semantics for these jargons can be programmed by providing actions for the constructs specific to the jargon only; the traversal semantics is inherited from the base language. Because all jargons share the base syntax and semantics, it is easy to combine and reuse their definitions as well as their tools. The InfoWiz technology which supports the development of jargons is discussed.
Discusses the use of jargons (see ) in the domain of configuration control.
The Draco approach starts by capturing domain analysis information in a DSL. The objects and operations of this DSL are refined into various DSLs of lower levels of abstraction, and finally into executable languages. These refinements capture design information (implementation decisions). The Draco system supports the development and reuse of constellations of DSLs and refinements. It offers tactics for refinement selection as well as automatic consistency checking of the resulting system specification.
Discusses scripting languages, such as Perl, Tcl, and Visual Basic, which are designed for gluing applications, assuming the existence of a set of components that just need to be connected together. Emphasizes that scripting languages should be typeless and interpreted.
Discusses the importance of monads in the implementation of tasks in Frob (see ), which help to achieve modularity and reusability.
Describes two domain-specific extensions of Haskell: Frob a language for robot control and Fran a language for reactive animations.
A language design system is presented which allows a user to design a DSL by selecting language features from menus. After selection, an implementation of the DSL can be generated. The system relies on domain designers to provide a definition of the design space, as well as specification components for all possible language features.
Discusses the use of DSLs in the domain of operating system specialization. A high-level DSL is envisioned to describe application behavior, which will be compiled into a low-level DSL describing customized operating system behavior.
Building on techniques for dynamic program slicing and program dicing, a fault localization technique for incremental spreadsheet debugging is developed. Using various kinds of visual clues, the technique is integrated into a spreadsheet environment.
Discusses 9 stages of framework development. An object-oriented framework evolves gradually, starting from three examples, moving via a white-box framework, component library, pluggable objects, to a black-box framework. The final, and most mature, stage is when the domain knowledge is sufficiently stable to merit the development of a domain-specific language or visual builder to access the framework.
This book contains a collection of mostly reprints and only a few original papers describing DSLs. It contains, for instance, papers like Little Languages (Bentley ), A system for typesettting mathematics: EQN (Kernighan and Cherry), and an overview of the Documenter's Workbench (Akkerhuis) covering TROFF and several DSLs for describing graphics, chemical formulae, and the like. Other chapters cover AWK, SED, SQL, TCL/TK, PERL and PYTHON. The most original papers are a survey of DSLs and domain-specific extension languages by Hudak and an elaborate description of Little Music Languages by Langston.
Discusses how the use of staging (separating compile-time computations from run time ones) and monads (for capturing effects and actions of the target code) lead to a simple, reusable, controlable, and correct DSL methodology.
Summarizes the key elements of the ODM domain engineering methodology. The full description is given in .
A comprehensive description of the ODM approach to domain engineering. The three main ODM steps are: (1) plan the domain, selecting objectives, stakeholders, and a set of boundary decisions to scope the domain. (2) model the domain, building a domain lexicon, and describing the concepts and features, as well as their commonalities and variabilities. (3) (optional) engineer an asset base of components by combining features and customers in novel ways. ODM emphasizes existing (legacy) software systems as valuable sources of domain knowledge. It takes the ``domain as a set of systems'' point of view, rather than the ``domain as the real world'' viewpoint.
Describes lava, a DSL for specifying production grammars. These are used to generate sentences over a language, for the purpose of testing tools implementing that language. Experience with lava demonstrates that a special purpose language for production grammars can bring high coverage, simplicity, manageability, and structure to the testing effort. Observe that the production grammar approach can also be used to for testing DSL-tools.
Describes DiSTiL, a DSL for describing container data structures in C, implemented on top of MicroSoft's Intentional Programming (IP) system.
Describes the image manipulation language Envision, implemented as an extension of Scheme.
Describes the ANSI C compiler framework Catacomb that supports code composition. By providing user-defined code templates (describing new language constructs such as parallel array assignment) and a fixed code composition mechanism inside the compiler, new constructs can be implemented in the same way as standard ones. See also .
Provides the material used for a course on DSSA, Domain-Specific Software Architectures, which aims at the reduction in time and cost of producing specific application systems within a supported domain. The paper covers key examples, architecture representation formalisms, domain engineering, and the DSSA process. See also [20,70]
A video card stores and displays images on a computer display. Each card is programmed by similar, but highly vendor-specific, instructions. The authors exploit this similarity by designing a DSL for specifying drivers for video cards in the context of the XFree86 implementation of X windows. This Graphic Adaptor Language is implemented in two stages: a C library provides a low level abstract machine that is used by an interpreter for the DSL. The Tempo partial evaluator for C is used to eliminate the overhead of interpretation and of the generality of the abstract machine. Includes a discussion of the merits of the DSL approach in this domain.
Presents the Abstract Syntax Description Language (ASDL). Reports the implementation of a tool that converts ASDL descriptions into C, C++, Java, or ML code. The generated code defines data-structures corresponding to this abstract syntax as well as functions for reading and writing abstract terms to a standard flattened representation. ASDL has been used to respecify the compiler intermediate format SUIF.
Presents a model for analyzing the expected benefits from investing in domain-specific software product lines. One of the key concepts is economy of scope, which is a condition where fewer inputs (such as effort and time) are needed to produce a greater variety of outputs. By contrast, economy of scale is achieved where fewer inputs are needed to produce greater quantities of a single output.
This document was generated using the LaTeX2HTML translator Version 98.1p1 release (March 2nd, 1998)
Copyright © 1993, 1994, 1995, 1996, 1997, Nikos Drakos, Computer Based Learning Unit, University of Leeds.
The command line arguments were:
latex2html -split 0 -show_section_numbers dslbib.
The translation was initiated by Arie van Deursen on 2000-02-09