SLE '19: "Domain-Specific Model Differencing ..."
Domain-Specific Model Differencing in Visual Concrete Syntax
Manouchehr Zadahmad, Eugene Syriani, Omar Alam, Esther Guerra, and Juan de Lara
(Université de Montréal, Canada; Trent University, Canada; Autonomous University of Madrid, Spain)
Like any other software artifact, models evolve and need to be versioned. In the last few years, dedicated support for model versioning has been proposed to improve the default text-based versioning that version control systems offer. However, there is still the need to comprehend model differences in terms of the semantics of the modeling language. For this purpose, we propose a comprehensive approach that considers both abstract and concrete syntax, to express model differences in terms of the domain-specific language (DSL) used and define domain-specific semantics for specific difference patterns. The approach is based on the automatic extension of the DSL to enable the representation of changes, on the definition of rules to capture recurrent domain-specific difference patterns, and on the automatic adaptation of the graphical concrete syntax to visualize the differences. We present a prototype tool support and discuss its application on versioned models created by third parties.
@InProceedings{SLE19p100,
author = {Manouchehr Zadahmad and Eugene Syriani and Omar Alam and Esther Guerra and Juan de Lara},
title = {Domain-Specific Model Differencing in Visual Concrete Syntax},
booktitle = {Proc.\ SLE},
publisher = {ACM},
pages = {100--112},
doi = {10.1145/3357766.3359537},
year = {2019},
}
Publisher's Version
SLE '19: "Consistency Management via ..."
Consistency Management via a Combination of Triple Graph Grammars and Linear Programming
Nils Weidmann, Anthony Anjorin, Erhan Leblebici, and Andy Schürr
(University of Paderborn, Germany; TU Darmstadt, Germany)
Consistency management is an important task in the context of Domain-Specific Language (DSL) development. It involves operations such as program (model) transformation, synchronisation, integration, and consistency checking, which are all tasks required to enable concurrent engineering using multiple DSLs. Even though consistency management is a well-researched topic, existing approaches either implement a fixed strategy for each consistency management operation, or do not scale for large models. This has been criticised in the literature, as practical applications require not only reasonable scalability with model size, but also unite multiple consistency management tasks within one tool. To raise the adaptability of such a tool to an appropriate level, a uniform way of performing these tasks is a desirable goal. In this paper, we propose an approach to consistency management that leverages a synergetic combination of Triple Graph Grammars and Integer Linear Programming. By modelling consistency management as an optimisation problem with a configurable objective function, we are able to uniformly address a wide range of consistency management operations. We show that our approach scales acceptably in practice, while still guaranteeing that a consistent solution is found if and only if one exists.
@InProceedings{SLE19p29,
author = {Nils Weidmann and Anthony Anjorin and Erhan Leblebici and Andy Schürr},
title = {Consistency Management via a Combination of Triple Graph Grammars and Linear Programming},
booktitle = {Proc.\ SLE},
publisher = {ACM},
pages = {29--41},
doi = {10.1145/3357766.3359544},
year = {2019},
}
Publisher's Version
SLE '19: "From DSL Specification to ..."
From DSL Specification to Interactive Computer Programming Environment
Pierre Jeanjean, Benoit Combemale, and Olivier Barais
(Inria, France; University of Rennes, France; CNRS, France; IRISA, France; University of Toulouse, France)
The adoption of Domain-Specific Languages (DSLs) relies on the capacity of language workbenches to automate the development of advanced and customized environments. While DSLs are usually well tailored for the main scenarios, the cost of developing mature tools prevents the ability to develop additional capabilities for alternative scenarios targeting specific tasks (e.g., API testing) or stakeholders (e.g., education). In this paper, we propose an approach to automatically generate interactive computer programming environments from existing specifications of textual interpreted DSLs. The approach provides abstractions to complement the DSL specification, and combines static analysis and language transformations to automate the transformation of the language syntax, the execution state and the execution semantics. We evaluate the approach over a representative set of DSLs, and demonstrate the ability to automatically transform a textual syntax to load partial programs limited to a single statement, and to derive a Read-Eval-Print-Loop (REPL) from the specification of a language interpreter.
@InProceedings{SLE19p167,
author = {Pierre Jeanjean and Benoit Combemale and Olivier Barais},
title = {From DSL Specification to Interactive Computer Programming Environment},
booktitle = {Proc.\ SLE},
publisher = {ACM},
pages = {167--178},
doi = {10.1145/3357766.3359540},
year = {2019},
}
Publisher's Version
Artifacts Functional
SLE '19: "High-Level Mission Specification ..."
High-Level Mission Specification for Multiple Robots
Sergio García, Patrizio Pelliccione, Claudio Menghi, Thorsten Berger, and Tomas Bures
(Chalmers University of Technology, Sweden; University of Gothenburg, Sweden; University of Luxembourg, Luxembourg; Charles University in Prague, Czechia)
Mobile robots are increasingly used in our everyday life to autonomously realize missions. A variety of languages has been proposed to support roboticists in the systematic development of robotic applications, ranging from logical languages with well-defined semantics to domain-specific languages with user-friendly syntax. The characteristics of both of them have distinct advantages, however, developing a language that combines those advantages remains an elusive task. We present PROMISE, a novel language that enables domain experts to specify missions on a high level of abstraction for teams of autonomous robots in a user-friendly way, while having well-defined semantics. Our ambition is to permit users to specify high-level goals instead of a series of specific actions the robots should perform. The language contains a set of atomic tasks that can be executed by robots and a set of operators that allow the composition of these tasks in complex missions. The language is supported by a standalone tool that permits mission specification through a textual and a graphical interface and that can be integrated within a variety of frameworks. We integrated PROMISE with a software platform providing functionalities such as motion control and planning. We conducted experiments to evaluate the correctness of the specification and execution of complex robotic missions with both simulators and real robots. We also conducted two user studies to assess the simplicity of PROMISE. The results show that PROMISE effectively supports users to specify missions for robots in a user-friendly manner.
@InProceedings{SLE19p127,
author = {Sergio García and Patrizio Pelliccione and Claudio Menghi and Thorsten Berger and Tomas Bures},
title = {High-Level Mission Specification for Multiple Robots},
booktitle = {Proc.\ SLE},
publisher = {ACM},
pages = {127--140},
doi = {10.1145/3357766.3359535},
year = {2019},
}
Publisher's Version
Video
Info
Artifacts Functional
SLE '19: "Shadow Models: Incremental ..."
Shadow Models: Incremental Transformations for MPS
Markus Voelter, Klaus Birken, Sascha Lisson, and Alexander Rimer
(itemis, Germany)
Shadow Models is an incremental transformation framework for MPS. The name is motivated by the realization that many analyses are easier to do on an model whose structure is different from what the user edits. To be able to run such analyses interactively in an IDE, these ``shadows'' of the user-facing model must be maintained in realtime, and incrementality can deliver the needed short response times. Shadow Models is an incremental model transformation engine for MPS. In the paper we motivate the system through example use cases, and outline the transformation framework.
@InProceedings{SLE19p61,
author = {Markus Voelter and Klaus Birken and Sascha Lisson and Alexander Rimer},
title = {Shadow Models: Incremental Transformations for MPS},
booktitle = {Proc.\ SLE},
publisher = {ACM},
pages = {61--65},
doi = {10.1145/3357766.3359528},
year = {2019},
}
Publisher's Version
SLE '19: "A Vision of Miking: Interactive ..."
A Vision of Miking: Interactive Programmatic Modeling, Sound Language Composition, and Self-Learning Compilation
David Broman
(KTH, Sweden)
This paper introduces a vision of Miking, a language framework for constructing efficient and sound language environments and compilers for domain-specific modeling languages. In particular, this language framework has three key objectives: (i) to automatically generate interactive programmatic modeling environments, (ii) to guarantee sound compositions of language fragments that enable both rapid and safe domain-specific language development, (iii) to include first-class support for self-learning compilation, targeting heterogeneous execution platforms. The initiative is motivated in the domain of mathematical modeling languages. Specifically, two different example domains are discussed: (i) modeling, simulation, and verification of cyber-physical systems, and (ii) domain-specific differentiable probabilistic programming. The paper describes the main objectives of the vision, as well as concrete research challenges and research directions.
@InProceedings{SLE19p55,
author = {David Broman},
title = {A Vision of Miking: Interactive Programmatic Modeling, Sound Language Composition, and Self-Learning Compilation},
booktitle = {Proc.\ SLE},
publisher = {ACM},
pages = {55--60},
doi = {10.1145/3357766.3359531},
year = {2019},
}
Publisher's Version
SLE '19: "High-Level Mission Specification ..."
High-Level Mission Specification for Multiple Robots
Sergio García, Patrizio Pelliccione, Claudio Menghi, Thorsten Berger, and Tomas Bures
(Chalmers University of Technology, Sweden; University of Gothenburg, Sweden; University of Luxembourg, Luxembourg; Charles University in Prague, Czechia)
Mobile robots are increasingly used in our everyday life to autonomously realize missions. A variety of languages has been proposed to support roboticists in the systematic development of robotic applications, ranging from logical languages with well-defined semantics to domain-specific languages with user-friendly syntax. The characteristics of both of them have distinct advantages, however, developing a language that combines those advantages remains an elusive task. We present PROMISE, a novel language that enables domain experts to specify missions on a high level of abstraction for teams of autonomous robots in a user-friendly way, while having well-defined semantics. Our ambition is to permit users to specify high-level goals instead of a series of specific actions the robots should perform. The language contains a set of atomic tasks that can be executed by robots and a set of operators that allow the composition of these tasks in complex missions. The language is supported by a standalone tool that permits mission specification through a textual and a graphical interface and that can be integrated within a variety of frameworks. We integrated PROMISE with a software platform providing functionalities such as motion control and planning. We conducted experiments to evaluate the correctness of the specification and execution of complex robotic missions with both simulators and real robots. We also conducted two user studies to assess the simplicity of PROMISE. The results show that PROMISE effectively supports users to specify missions for robots in a user-friendly manner.
@InProceedings{SLE19p127,
author = {Sergio García and Patrizio Pelliccione and Claudio Menghi and Thorsten Berger and Tomas Bures},
title = {High-Level Mission Specification for Multiple Robots},
booktitle = {Proc.\ SLE},
publisher = {ACM},
pages = {127--140},
doi = {10.1145/3357766.3359535},
year = {2019},
}
Publisher's Version
Video
Info
Artifacts Functional
SLE '19: "Analysis and Modeling of the ..."
Analysis and Modeling of the Governance in General Programming Languages
Javier Luis Cánovas Izquierdo and Jordi Cabot
(Open University of Catalonia, Spain; IN3, Spain; ICREA, Spain)
General Programming Languages (GPLs) continuously evolve to adapt to the ever changing technology landscape. The evolution is rooted on technical aspects but it is ultimately decided by the group of people governing the language and working together to solve, vote and approve the new language extensions and modifications. As in any community, governance rules are used to manage the community, help to prioritize their tasks and come to a decision. Typically, these rules specify the decision-making mechanism used in the project, thus contributing to its long-term sustainability by clarifying how core language developers (external contributors and even end-users of the language) can work together. Despite their importance, this core topic has been largely ignored in the study of GPLs. In this paper we study eight well-known GPLs and analyze how they govern their evolution. We believe this study helps to clarify the different approaches GPLs use in this regard. These governance models, depicted as a feature model, can then be reused and mixed by developers of new languages to define their own governance.
@InProceedings{SLE19p179,
author = {Javier Luis Cánovas Izquierdo and Jordi Cabot},
title = {Analysis and Modeling of the Governance in General Programming Languages},
booktitle = {Proc.\ SLE},
publisher = {ACM},
pages = {179--183},
doi = {10.1145/3357766.3359533},
year = {2019},
}
Publisher's Version
SLE '19: "Developing a Monadic Type ..."
Developing a Monadic Type Checker for an Object-Oriented Language: An Experience Report
Elias Castegren and Kiko Fernandez-Reyes
(KTH, Sweden; Uppsala University, Sweden)
Functional programming languages are well-suited for developing compilers, and compilers for functional languages are often themselves written in a functional language. Functional abstractions, such as monads, allow abstracting away some of the repetitive structure of a compiler, removing boilerplate code and making extensions simpler. Even so, functional languages are rarely used to implement compilers for languages of other paradigms.
This paper reports on the experience of a four-year long project where we developed a compiler for a concurrent, object-oriented language using the functional language Haskell. The focus of the paper is the implementation of the type checker, but the design works well in static analysis tools, such as tracking uniqueness of variables to ensure data-race freedom. The paper starts from a simple type checker to which we add more complex features, such as type state, with minimal changes to the overall initial design.
@InProceedings{SLE19p184,
author = {Elias Castegren and Kiko Fernandez-Reyes},
title = {Developing a Monadic Type Checker for an Object-Oriented Language: An Experience Report},
booktitle = {Proc.\ SLE},
publisher = {ACM},
pages = {184--196},
doi = {10.1145/3357766.3359545},
year = {2019},
}
Publisher's Version
Artifacts Functional
SLE '19: "Efficient Late Binding of ..."
Efficient Late Binding of Dynamic Function Compositions
Lars Schütze and Jeronimo Castrillon
(TU Dresden, Germany)
Adaptive software becomes more and more important as computing is increasingly context-dependent. Runtime adaptability can be achieved by dynamically selecting and applying context-specific code. Role-oriented programming has been proposed as a paradigm to enable runtime adaptive software by design. Roles change the objects’ behavior at runtime and thus allow adapting the software to a given context. However, this increased variability and expressiveness has a direct impact on performance and memory consumption. We found a high overhead in the steady-state performance of executing compositions of adaptations. This paper presents a new approach to use run-time information to construct a dispatch plan that can be executed efficiently by the JVM. The concept of late binding is extended to dynamic function compositions. We evaluated the implementation with a benchmark for role-oriented programming languages leveraging context-dependent role semantics achieving a mean speedup of 2.79× over the regular implementation.
@InProceedings{SLE19p141,
author = {Lars Schütze and Jeronimo Castrillon},
title = {Efficient Late Binding of Dynamic Function Compositions},
booktitle = {Proc.\ SLE},
publisher = {ACM},
pages = {141--151},
doi = {10.1145/3357766.3359543},
year = {2019},
}
Publisher's Version
SLE '19: "From DSL Specification to ..."
From DSL Specification to Interactive Computer Programming Environment
Pierre Jeanjean, Benoit Combemale, and Olivier Barais
(Inria, France; University of Rennes, France; CNRS, France; IRISA, France; University of Toulouse, France)
The adoption of Domain-Specific Languages (DSLs) relies on the capacity of language workbenches to automate the development of advanced and customized environments. While DSLs are usually well tailored for the main scenarios, the cost of developing mature tools prevents the ability to develop additional capabilities for alternative scenarios targeting specific tasks (e.g., API testing) or stakeholders (e.g., education). In this paper, we propose an approach to automatically generate interactive computer programming environments from existing specifications of textual interpreted DSLs. The approach provides abstractions to complement the DSL specification, and combines static analysis and language transformations to automate the transformation of the language syntax, the execution state and the execution semantics. We evaluate the approach over a representative set of DSLs, and demonstrate the ability to automatically transform a textual syntax to load partial programs limited to a single statement, and to derive a Read-Eval-Print-Loop (REPL) from the specification of a language interpreter.
@InProceedings{SLE19p167,
author = {Pierre Jeanjean and Benoit Combemale and Olivier Barais},
title = {From DSL Specification to Interactive Computer Programming Environment},
booktitle = {Proc.\ SLE},
publisher = {ACM},
pages = {167--178},
doi = {10.1145/3357766.3359540},
year = {2019},
}
Publisher's Version
Artifacts Functional
SLE '19: "Domain-Specific Model Differencing ..."
Domain-Specific Model Differencing in Visual Concrete Syntax
Manouchehr Zadahmad, Eugene Syriani, Omar Alam, Esther Guerra, and Juan de Lara
(Université de Montréal, Canada; Trent University, Canada; Autonomous University of Madrid, Spain)
Like any other software artifact, models evolve and need to be versioned. In the last few years, dedicated support for model versioning has been proposed to improve the default text-based versioning that version control systems offer. However, there is still the need to comprehend model differences in terms of the semantics of the modeling language. For this purpose, we propose a comprehensive approach that considers both abstract and concrete syntax, to express model differences in terms of the domain-specific language (DSL) used and define domain-specific semantics for specific difference patterns. The approach is based on the automatic extension of the DSL to enable the representation of changes, on the definition of rules to capture recurrent domain-specific difference patterns, and on the automatic adaptation of the graphical concrete syntax to visualize the differences. We present a prototype tool support and discuss its application on versioned models created by third parties.
@InProceedings{SLE19p100,
author = {Manouchehr Zadahmad and Eugene Syriani and Omar Alam and Esther Guerra and Juan de Lara},
title = {Domain-Specific Model Differencing in Visual Concrete Syntax},
booktitle = {Proc.\ SLE},
publisher = {ACM},
pages = {100--112},
doi = {10.1145/3357766.3359537},
year = {2019},
}
Publisher's Version
SLE '19: "Default Disambiguation for ..."
Default Disambiguation for Online Parsers
Lukas Diekmann and Laurence Tratt
(King's College London, UK)
Since composed grammars are often ambiguous, grammar composition requires a mechanism for dealing with ambiguity: either ruling it out by using delimiters (which are awkward to work with), or by using disambiguation operators to filter a parse forest down to a single parse tree (where, in general, we cannot be sure that we have covered all possible parse forests). In this paper, we show that default disambiguation, which is inappropriate for batch parsing, works well for online parsing, where it can be overridden by the user if necessary. We extend language boxes – a delimiter-based algorithm atop incremental parsing – in such a way that default disambiguation can automatically insert, remove, or resize, language boxes, leading to the automatic language boxes algorithm. The nature of the problem means that default disambiguation cannot always match a user’s intention. However, our experimental evaluation shows that automatic language boxes behave acceptably in 96.8% of tests involving compositions of real-world programming languages.
@InProceedings{SLE19p88,
author = {Lukas Diekmann and Laurence Tratt},
title = {Default Disambiguation for Online Parsers},
booktitle = {Proc.\ SLE},
publisher = {ACM},
pages = {88--99},
doi = {10.1145/3357766.3359530},
year = {2019},
}
Publisher's Version
Artifacts Functional
SLE '19: "Detecting and Exploring Side ..."
Detecting and Exploring Side Effects when Repairing Model Inconsistencies
Djamel Eddine Khelladi, Roland Kretschmer, and Alexander Egyed
(CNRS, France; IRISA, France; JKU Linz, Austria)
When software models change, developers often fail in keeping them consistent. Automated support in repairing inconsistencies is widely addressed. Yet, merely enumerating repairs for developers is not enough. A repair can as a side effect cause new unexpected inconsistencies (negative) or even fix other inconsistencies as well (positive). To make matters worse, repairing negative side effects can in turn cause further side effects. Current approaches do not detect and track such side effects in depth, which can increase developers' effort and time spent in repairing inconsistencies. This paper presents an automated approach for detecting and tracking the consequences of repairs, i.e. side effects. It recursively explores in depth positive and negative side effects and identifies paths and cycles of repairs. This paper further ranks repairs based on side effect knowledge so that developers may quickly find the relevant ones. Our approach and its tool implementation have been empirically assessed on 14 case studies from industry, academia, and GitHub. Results show that both positive and negative side effects occur frequently. A comparison with three versioned models showed the usefulness of our ranking strategy based on side effects. It showed that our approach's top prioritized repairs are those that developers would indeed choose. A controlled experiment with 24 participants further highlights the significant influence of side effects and of our ranking of repairs on developers. Developers who received side effect knowledge chose far more repairs with positive side effects and far less with negative side effects, while being 12.3% faster, in contrast to developers who did not receive side effect knowledge.
@InProceedings{SLE19p113,
author = {Djamel Eddine Khelladi and Roland Kretschmer and Alexander Egyed},
title = {Detecting and Exploring Side Effects when Repairing Model Inconsistencies},
booktitle = {Proc.\ SLE},
publisher = {ACM},
pages = {113--126},
doi = {10.1145/3357766.3359546},
year = {2019},
}
Publisher's Version
SLE '19: "Generating Incremental Type ..."
Generating Incremental Type Services
André Pacak and Sebastian Erdweg
(Johannes Gutenberg University Mainz, Germany)
In this vision paper, we propose a method for generating fully functional incremental type services from declarations of type rules. Our general strategy is to translate type rules into Datalog, for which efficient incremental solvers are already available. However, many aspects of type rules don't naturally translate to Datalog and need non-trivial translation. We demonstrate that such translation may be feasible by outlining the translation rules needed for a language with typing contexts (name binding) and bidirectional type rules (local type inference). We envision that even rich type systems of DSLs can be incrementalized by translation to Datalog in the future.
@InProceedings{SLE19p197,
author = {André Pacak and Sebastian Erdweg},
title = {Generating Incremental Type Services},
booktitle = {Proc.\ SLE},
publisher = {ACM},
pages = {197--201},
doi = {10.1145/3357766.3359534},
year = {2019},
}
Publisher's Version
SLE '19: "Operationalizing the Integration ..."
Operationalizing the Integration of User Interaction Specifications in the Synthesis of Modeling Editors
Vasco Sousa, Eugene Syriani, and Khady Fall
(Université de Montréal, Canada)
A long shortcoming in the automatic generation of domain-specific modeling (DSM) editors has been the lack of user experience, in particular, user interaction adapted to its user. The current practice relies solely on the abstract and concrete syntax of the language, restricting the user interaction with the editor to a set of generic interactions built-in the tool. To increase the user experience with DSM editors, we propose to specify the different viewpoints of interactions (e.g., I/O devices, component of the interface, behavior of the editor) each modeled at the right level of abstraction for its user expert. The goal of this paper is to demonstrate the feasibility of the approach, by anchoring the operational semantics of all these viewpoints in a Statecharts model that controls the DSM editor. We report on the complex transformation that takes as input different viewpoints are expressed in at distinct levels of abstraction, to produce a custom interaction with the DSM editor based on a RETE algorithm. Our implementation shows that we can produce correct and responsive results by emulating existing DSM editors.
@InProceedings{SLE19p42,
author = {Vasco Sousa and Eugene Syriani and Khady Fall},
title = {Operationalizing the Integration of User Interaction Specifications in the Synthesis of Modeling Editors},
booktitle = {Proc.\ SLE},
publisher = {ACM},
pages = {42--54},
doi = {10.1145/3357766.3359539},
year = {2019},
}
Publisher's Version
Info
SLE '19: "Developing a Monadic Type ..."
Developing a Monadic Type Checker for an Object-Oriented Language: An Experience Report
Elias Castegren and Kiko Fernandez-Reyes
(KTH, Sweden; Uppsala University, Sweden)
Functional programming languages are well-suited for developing compilers, and compilers for functional languages are often themselves written in a functional language. Functional abstractions, such as monads, allow abstracting away some of the repetitive structure of a compiler, removing boilerplate code and making extensions simpler. Even so, functional languages are rarely used to implement compilers for languages of other paradigms.
This paper reports on the experience of a four-year long project where we developed a compiler for a concurrent, object-oriented language using the functional language Haskell. The focus of the paper is the implementation of the type checker, but the design works well in static analysis tools, such as tracking uniqueness of variables to ensure data-race freedom. The paper starts from a simple type checker to which we add more complex features, such as type state, with minimal changes to the overall initial design.
@InProceedings{SLE19p184,
author = {Elias Castegren and Kiko Fernandez-Reyes},
title = {Developing a Monadic Type Checker for an Object-Oriented Language: An Experience Report},
booktitle = {Proc.\ SLE},
publisher = {ACM},
pages = {184--196},
doi = {10.1145/3357766.3359545},
year = {2019},
}
Publisher's Version
Artifacts Functional
SLE '19: "Spectrum-Based Fault Localization ..."
Spectrum-Based Fault Localization for Context-Free Grammars
Moeketsi Raselimo and Bernd Fischer
(Stellenbosch University, South Africa)
We describe and evaluate the first spectrum-based fault localization method aimed at finding faulty rules in a context-free grammar. It takes as input a test suite and a modified parser for the grammar that can collect grammar spectra, i.e., the sets of rules used in attempts to parse the individual test cases, and returns as output a ranked list of suspicious rules. We show how grammar spectra can be collected for both LL and LR parsers, and how the ANTLR and CUP parser generators can be modified and used to automate the collection of the grammar spectra. We evaluate our method over grammars with seeded faults as well as real world grammars and student grammars submitted in compiler engineering courses that contain real faults. The results show that our method ranks the seeded faults within the top five rules in more than half of the cases and can pinpoint them in 10%–40% of the cases. On average, it ranks the faults at around 25% of all rules, and better than 15% for a very large test suite. It also allowed us to identify deviations and faults in the real world and student grammars.
@InProceedings{SLE19p15,
author = {Moeketsi Raselimo and Bernd Fischer},
title = {Spectrum-Based Fault Localization for Context-Free Grammars},
booktitle = {Proc.\ SLE},
publisher = {ACM},
pages = {15--28},
doi = {10.1145/3357766.3359538},
year = {2019},
}
Publisher's Version
SLE '19: "Breaking Parsers: Mutation-Based ..."
Breaking Parsers: Mutation-Based Generation of Programs with Guaranteed Syntax Errors
Moeketsi Raselimo, Jan Taljaard, and Bernd Fischer
(Stellenbosch University, South Africa)
Grammar-based test case generation has focused almost exclusively on generating syntactically correct programs (i.e., positive tests) from a context-free reference grammar but a positive test suite cannot detect when the unit under test accepts words outside the language (i.e., false positives). Here, we investigate the converse problem and describe two mutation-based approaches for generating programs with guaranteed syntax errors (i.e., negative tests). % Word mutation systematically modifies positive tests by deleting, inserting, substituting, and transposing tokens in such a way that at least one impossible token pair emerges. % Rule mutation applies such operations to the symbols of the right-hand sides of productions in such a way that each derivation that uses the mutated rule yields a word outside the language.
@InProceedings{SLE19p83,
author = {Moeketsi Raselimo and Jan Taljaard and Bernd Fischer},
title = {Breaking Parsers: Mutation-Based Generation of Programs with Guaranteed Syntax Errors},
booktitle = {Proc.\ SLE},
publisher = {ACM},
pages = {83--87},
doi = {10.1145/3357766.3359542},
year = {2019},
}
Publisher's Version
SLE '19: "High-Level Mission Specification ..."
High-Level Mission Specification for Multiple Robots
Sergio García, Patrizio Pelliccione, Claudio Menghi, Thorsten Berger, and Tomas Bures
(Chalmers University of Technology, Sweden; University of Gothenburg, Sweden; University of Luxembourg, Luxembourg; Charles University in Prague, Czechia)
Mobile robots are increasingly used in our everyday life to autonomously realize missions. A variety of languages has been proposed to support roboticists in the systematic development of robotic applications, ranging from logical languages with well-defined semantics to domain-specific languages with user-friendly syntax. The characteristics of both of them have distinct advantages, however, developing a language that combines those advantages remains an elusive task. We present PROMISE, a novel language that enables domain experts to specify missions on a high level of abstraction for teams of autonomous robots in a user-friendly way, while having well-defined semantics. Our ambition is to permit users to specify high-level goals instead of a series of specific actions the robots should perform. The language contains a set of atomic tasks that can be executed by robots and a set of operators that allow the composition of these tasks in complex missions. The language is supported by a standalone tool that permits mission specification through a textual and a graphical interface and that can be integrated within a variety of frameworks. We integrated PROMISE with a software platform providing functionalities such as motion control and planning. We conducted experiments to evaluate the correctness of the specification and execution of complex robotic missions with both simulators and real robots. We also conducted two user studies to assess the simplicity of PROMISE. The results show that PROMISE effectively supports users to specify missions for robots in a user-friendly manner.
@InProceedings{SLE19p127,
author = {Sergio García and Patrizio Pelliccione and Claudio Menghi and Thorsten Berger and Tomas Bures},
title = {High-Level Mission Specification for Multiple Robots},
booktitle = {Proc.\ SLE},
publisher = {ACM},
pages = {127--140},
doi = {10.1145/3357766.3359535},
year = {2019},
}
Publisher's Version
Video
Info
Artifacts Functional
SLE '19: "Domain-Specific Model Differencing ..."
Domain-Specific Model Differencing in Visual Concrete Syntax
Manouchehr Zadahmad, Eugene Syriani, Omar Alam, Esther Guerra, and Juan de Lara
(Université de Montréal, Canada; Trent University, Canada; Autonomous University of Madrid, Spain)
Like any other software artifact, models evolve and need to be versioned. In the last few years, dedicated support for model versioning has been proposed to improve the default text-based versioning that version control systems offer. However, there is still the need to comprehend model differences in terms of the semantics of the modeling language. For this purpose, we propose a comprehensive approach that considers both abstract and concrete syntax, to express model differences in terms of the domain-specific language (DSL) used and define domain-specific semantics for specific difference patterns. The approach is based on the automatic extension of the DSL to enable the representation of changes, on the definition of rules to capture recurrent domain-specific difference patterns, and on the automatic adaptation of the graphical concrete syntax to visualize the differences. We present a prototype tool support and discuss its application on versioned models created by third parties.
@InProceedings{SLE19p100,
author = {Manouchehr Zadahmad and Eugene Syriani and Omar Alam and Esther Guerra and Juan de Lara},
title = {Domain-Specific Model Differencing in Visual Concrete Syntax},
booktitle = {Proc.\ SLE},
publisher = {ACM},
pages = {100--112},
doi = {10.1145/3357766.3359537},
year = {2019},
}
Publisher's Version
SLE '19: "Empirical Study on the Usage ..."
Empirical Study on the Usage of Graph Query Languages in Open Source Java Projects
Philipp Seifer, Johannes Härtel, Martin Leinberger, Ralf Lämmel, and Steffen Staab
(University of Koblenz-Landau, Germany; University of Southampton, UK)
Graph data models are interesting in various domains, in part because of the intuitiveness and flexibility they offer compared to relational models. Specialized query languages, such as Cypher for property graphs or SPARQL for RDF, facilitate their use. In this paper, we present an empirical study on the usage of graph-based query languages in open-source Java projects on GitHub. We investigate the usage of SPARQL, Cypher, Gremlin and GraphQL in terms of popularity and their development over time. We select repositories based on dependencies related to these technologies and employ various popularity and source-code based filters and ranking features for a targeted selection of projects. For the concrete languages SPARQL and Cypher, we analyze the activity of repositories over time. For SPARQL, we investigate common application domains, query use and existence of ontological data modeling in applications that query for concrete instance data. Our results show, that the usage of graph query languages in open-source projects increased over the last years, with SPARQL and Cypher being by far the most popular. SPARQL projects are more active in terms of query related artifact changes and unique developers involved, but Cypher is catching up. Relatively few applications use SPARQL to query for concrete instance data: A majority of those applications employ multiple different ontologies, including project and domain specific ones. Common application domains are management systems and data visualization tools.
@InProceedings{SLE19p152,
author = {Philipp Seifer and Johannes Härtel and Martin Leinberger and Ralf Lämmel and Steffen Staab},
title = {Empirical Study on the Usage of Graph Query Languages in Open Source Java Projects},
booktitle = {Proc.\ SLE},
publisher = {ACM},
pages = {152--166},
doi = {10.1145/3357766.3359541},
year = {2019},
}
Publisher's Version
SLE '19: "Analysis and Modeling of the ..."
Analysis and Modeling of the Governance in General Programming Languages
Javier Luis Cánovas Izquierdo and Jordi Cabot
(Open University of Catalonia, Spain; IN3, Spain; ICREA, Spain)
General Programming Languages (GPLs) continuously evolve to adapt to the ever changing technology landscape. The evolution is rooted on technical aspects but it is ultimately decided by the group of people governing the language and working together to solve, vote and approve the new language extensions and modifications. As in any community, governance rules are used to manage the community, help to prioritize their tasks and come to a decision. Typically, these rules specify the decision-making mechanism used in the project, thus contributing to its long-term sustainability by clarifying how core language developers (external contributors and even end-users of the language) can work together. Despite their importance, this core topic has been largely ignored in the study of GPLs. In this paper we study eight well-known GPLs and analyze how they govern their evolution. We believe this study helps to clarify the different approaches GPLs use in this regard. These governance models, depicted as a feature model, can then be reused and mixed by developers of new languages to define their own governance.
@InProceedings{SLE19p179,
author = {Javier Luis Cánovas Izquierdo and Jordi Cabot},
title = {Analysis and Modeling of the Governance in General Programming Languages},
booktitle = {Proc.\ SLE},
publisher = {ACM},
pages = {179--183},
doi = {10.1145/3357766.3359533},
year = {2019},
}
Publisher's Version
SLE '19: "From DSL Specification to ..."
From DSL Specification to Interactive Computer Programming Environment
Pierre Jeanjean, Benoit Combemale, and Olivier Barais
(Inria, France; University of Rennes, France; CNRS, France; IRISA, France; University of Toulouse, France)
The adoption of Domain-Specific Languages (DSLs) relies on the capacity of language workbenches to automate the development of advanced and customized environments. While DSLs are usually well tailored for the main scenarios, the cost of developing mature tools prevents the ability to develop additional capabilities for alternative scenarios targeting specific tasks (e.g., API testing) or stakeholders (e.g., education). In this paper, we propose an approach to automatically generate interactive computer programming environments from existing specifications of textual interpreted DSLs. The approach provides abstractions to complement the DSL specification, and combines static analysis and language transformations to automate the transformation of the language syntax, the execution state and the execution semantics. We evaluate the approach over a representative set of DSLs, and demonstrate the ability to automatically transform a textual syntax to load partial programs limited to a single statement, and to derive a Read-Eval-Print-Loop (REPL) from the specification of a language interpreter.
@InProceedings{SLE19p167,
author = {Pierre Jeanjean and Benoit Combemale and Olivier Barais},
title = {From DSL Specification to Interactive Computer Programming Environment},
booktitle = {Proc.\ SLE},
publisher = {ACM},
pages = {167--178},
doi = {10.1145/3357766.3359540},
year = {2019},
}
Publisher's Version
Artifacts Functional
SLE '19: "Multiple Lexicalisation (A ..."
Multiple Lexicalisation (A Java Based Study)
Elizabeth Scott and Adrian Johnstone
(Royal Holloway University of London, UK)
We consider the possibility of making the lexicalisation phase of compilation more powerful by avoiding the need for the lexer to return a single token string from the input character string. This has the potential to empower language design by softening the boundaries between lexical and phrase level specification. The large number of lexicalisations makes it impractical to parse each one individually, but it is possible to share the parsing of common subparts, reducing the number of tokens parsed from the product of the token numbers associated with the components to their sum. We report total numbers of lexicalisations of example Java strings, and the impact on these numbers of various lexical disambiguation strategies, and we introduce a new generalised parsing technique that can efficiently parse multiple lexicalisations of character string simultaneously. We then use this technique on Java, reporting on the number of lexicalisations that correspond to syntactically correct Java strings and the degree to which the standard Java lexer is safe in the sense that it does not remove all the syntactically correct lexicalisations of an input character string. Our multi-lexer parser is an alternative to scannerless parsing of a character level grammar, retaining the separation between grammar terminals and the corresponding lexical tokens. This has the advantages of allowing the parser to use terminal level lookahead and keeping lexical level disambiguation separate from the context free grammar.
@InProceedings{SLE19p71,
author = {Elizabeth Scott and Adrian Johnstone},
title = {Multiple Lexicalisation (A Java Based Study)},
booktitle = {Proc.\ SLE},
publisher = {ACM},
pages = {71--82},
doi = {10.1145/3357766.3359532},
year = {2019},
}
Publisher's Version
SLE '19: "Detecting and Exploring Side ..."
Detecting and Exploring Side Effects when Repairing Model Inconsistencies
Djamel Eddine Khelladi, Roland Kretschmer, and Alexander Egyed
(CNRS, France; IRISA, France; JKU Linz, Austria)
When software models change, developers often fail in keeping them consistent. Automated support in repairing inconsistencies is widely addressed. Yet, merely enumerating repairs for developers is not enough. A repair can as a side effect cause new unexpected inconsistencies (negative) or even fix other inconsistencies as well (positive). To make matters worse, repairing negative side effects can in turn cause further side effects. Current approaches do not detect and track such side effects in depth, which can increase developers' effort and time spent in repairing inconsistencies. This paper presents an automated approach for detecting and tracking the consequences of repairs, i.e. side effects. It recursively explores in depth positive and negative side effects and identifies paths and cycles of repairs. This paper further ranks repairs based on side effect knowledge so that developers may quickly find the relevant ones. Our approach and its tool implementation have been empirically assessed on 14 case studies from industry, academia, and GitHub. Results show that both positive and negative side effects occur frequently. A comparison with three versioned models showed the usefulness of our ranking strategy based on side effects. It showed that our approach's top prioritized repairs are those that developers would indeed choose. A controlled experiment with 24 participants further highlights the significant influence of side effects and of our ranking of repairs on developers. Developers who received side effect knowledge chose far more repairs with positive side effects and far less with negative side effects, while being 12.3% faster, in contrast to developers who did not receive side effect knowledge.
@InProceedings{SLE19p113,
author = {Djamel Eddine Khelladi and Roland Kretschmer and Alexander Egyed},
title = {Detecting and Exploring Side Effects when Repairing Model Inconsistencies},
booktitle = {Proc.\ SLE},
publisher = {ACM},
pages = {113--126},
doi = {10.1145/3357766.3359546},
year = {2019},
}
Publisher's Version
SLE '19: "Detecting and Exploring Side ..."
Detecting and Exploring Side Effects when Repairing Model Inconsistencies
Djamel Eddine Khelladi, Roland Kretschmer, and Alexander Egyed
(CNRS, France; IRISA, France; JKU Linz, Austria)
When software models change, developers often fail in keeping them consistent. Automated support in repairing inconsistencies is widely addressed. Yet, merely enumerating repairs for developers is not enough. A repair can as a side effect cause new unexpected inconsistencies (negative) or even fix other inconsistencies as well (positive). To make matters worse, repairing negative side effects can in turn cause further side effects. Current approaches do not detect and track such side effects in depth, which can increase developers' effort and time spent in repairing inconsistencies. This paper presents an automated approach for detecting and tracking the consequences of repairs, i.e. side effects. It recursively explores in depth positive and negative side effects and identifies paths and cycles of repairs. This paper further ranks repairs based on side effect knowledge so that developers may quickly find the relevant ones. Our approach and its tool implementation have been empirically assessed on 14 case studies from industry, academia, and GitHub. Results show that both positive and negative side effects occur frequently. A comparison with three versioned models showed the usefulness of our ranking strategy based on side effects. It showed that our approach's top prioritized repairs are those that developers would indeed choose. A controlled experiment with 24 participants further highlights the significant influence of side effects and of our ranking of repairs on developers. Developers who received side effect knowledge chose far more repairs with positive side effects and far less with negative side effects, while being 12.3% faster, in contrast to developers who did not receive side effect knowledge.
@InProceedings{SLE19p113,
author = {Djamel Eddine Khelladi and Roland Kretschmer and Alexander Egyed},
title = {Detecting and Exploring Side Effects when Repairing Model Inconsistencies},
booktitle = {Proc.\ SLE},
publisher = {ACM},
pages = {113--126},
doi = {10.1145/3357766.3359546},
year = {2019},
}
Publisher's Version
SLE '19: "Transactional Editing: Giving ..."
Transactional Editing: Giving ACID to Programmers
Friedrich Steimann and Nils Kurowsky
(Fernuniversität in Hagen, Germany)
Collaboration among programmers today mostly relies on file-based version control systems. These systems typically use optimistic locking to enable parallel work, meaning that competing edits (edit conflicts) are detected and have to be resolved at update or commit time. While merging edits can partly be automated, it is an error-prone task that can introduce inconsistencies. Pessimistic locking of the files to be edited does not appear to be a popular alternative, however, and in any case is insufficient to avoid inconsistency, since it does not account for the dependence of (code in) files on others. To address these problems, we show how the notions of atomicity, consistency, and isolation known from transactional databases can be enforced in the context of collaborative programming. We do so by presenting editing as a set of primitive edit operations applied to an abstract syntax graph overlaid by a constraint graph expressing the consistency criteria mandated by the rules of well-formedness of a language, and by deriving for every sequence of primitive edit operations the write- and read-locks sufficient to: perform the edit sequence, either completely or not at all, in isolation from others; and to achieve global consistency before committing.
@InProceedings{SLE19p202,
author = {Friedrich Steimann and Nils Kurowsky},
title = {Transactional Editing: Giving ACID to Programmers},
booktitle = {Proc.\ SLE},
publisher = {ACM},
pages = {202--215},
doi = {10.1145/3357766.3359536},
year = {2019},
}
Publisher's Version
SLE '19: "Empirical Study on the Usage ..."
Empirical Study on the Usage of Graph Query Languages in Open Source Java Projects
Philipp Seifer, Johannes Härtel, Martin Leinberger, Ralf Lämmel, and Steffen Staab
(University of Koblenz-Landau, Germany; University of Southampton, UK)
Graph data models are interesting in various domains, in part because of the intuitiveness and flexibility they offer compared to relational models. Specialized query languages, such as Cypher for property graphs or SPARQL for RDF, facilitate their use. In this paper, we present an empirical study on the usage of graph-based query languages in open-source Java projects on GitHub. We investigate the usage of SPARQL, Cypher, Gremlin and GraphQL in terms of popularity and their development over time. We select repositories based on dependencies related to these technologies and employ various popularity and source-code based filters and ranking features for a targeted selection of projects. For the concrete languages SPARQL and Cypher, we analyze the activity of repositories over time. For SPARQL, we investigate common application domains, query use and existence of ontological data modeling in applications that query for concrete instance data. Our results show, that the usage of graph query languages in open-source projects increased over the last years, with SPARQL and Cypher being by far the most popular. SPARQL projects are more active in terms of query related artifact changes and unique developers involved, but Cypher is catching up. Relatively few applications use SPARQL to query for concrete instance data: A majority of those applications employ multiple different ontologies, including project and domain specific ones. Common application domains are management systems and data visualization tools.
@InProceedings{SLE19p152,
author = {Philipp Seifer and Johannes Härtel and Martin Leinberger and Ralf Lämmel and Steffen Staab},
title = {Empirical Study on the Usage of Graph Query Languages in Open Source Java Projects},
booktitle = {Proc.\ SLE},
publisher = {ACM},
pages = {152--166},
doi = {10.1145/3357766.3359541},
year = {2019},
}
Publisher's Version
SLE '19: "Consistency Management via ..."
Consistency Management via a Combination of Triple Graph Grammars and Linear Programming
Nils Weidmann, Anthony Anjorin, Erhan Leblebici, and Andy Schürr
(University of Paderborn, Germany; TU Darmstadt, Germany)
Consistency management is an important task in the context of Domain-Specific Language (DSL) development. It involves operations such as program (model) transformation, synchronisation, integration, and consistency checking, which are all tasks required to enable concurrent engineering using multiple DSLs. Even though consistency management is a well-researched topic, existing approaches either implement a fixed strategy for each consistency management operation, or do not scale for large models. This has been criticised in the literature, as practical applications require not only reasonable scalability with model size, but also unite multiple consistency management tasks within one tool. To raise the adaptability of such a tool to an appropriate level, a uniform way of performing these tasks is a desirable goal. In this paper, we propose an approach to consistency management that leverages a synergetic combination of Triple Graph Grammars and Integer Linear Programming. By modelling consistency management as an optimisation problem with a configurable objective function, we are able to uniformly address a wide range of consistency management operations. We show that our approach scales acceptably in practice, while still guaranteeing that a consistent solution is found if and only if one exists.
@InProceedings{SLE19p29,
author = {Nils Weidmann and Anthony Anjorin and Erhan Leblebici and Andy Schürr},
title = {Consistency Management via a Combination of Triple Graph Grammars and Linear Programming},
booktitle = {Proc.\ SLE},
publisher = {ACM},
pages = {29--41},
doi = {10.1145/3357766.3359544},
year = {2019},
}
Publisher's Version
SLE '19: "Empirical Study on the Usage ..."
Empirical Study on the Usage of Graph Query Languages in Open Source Java Projects
Philipp Seifer, Johannes Härtel, Martin Leinberger, Ralf Lämmel, and Steffen Staab
(University of Koblenz-Landau, Germany; University of Southampton, UK)
Graph data models are interesting in various domains, in part because of the intuitiveness and flexibility they offer compared to relational models. Specialized query languages, such as Cypher for property graphs or SPARQL for RDF, facilitate their use. In this paper, we present an empirical study on the usage of graph-based query languages in open-source Java projects on GitHub. We investigate the usage of SPARQL, Cypher, Gremlin and GraphQL in terms of popularity and their development over time. We select repositories based on dependencies related to these technologies and employ various popularity and source-code based filters and ranking features for a targeted selection of projects. For the concrete languages SPARQL and Cypher, we analyze the activity of repositories over time. For SPARQL, we investigate common application domains, query use and existence of ontological data modeling in applications that query for concrete instance data. Our results show, that the usage of graph query languages in open-source projects increased over the last years, with SPARQL and Cypher being by far the most popular. SPARQL projects are more active in terms of query related artifact changes and unique developers involved, but Cypher is catching up. Relatively few applications use SPARQL to query for concrete instance data: A majority of those applications employ multiple different ontologies, including project and domain specific ones. Common application domains are management systems and data visualization tools.
@InProceedings{SLE19p152,
author = {Philipp Seifer and Johannes Härtel and Martin Leinberger and Ralf Lämmel and Steffen Staab},
title = {Empirical Study on the Usage of Graph Query Languages in Open Source Java Projects},
booktitle = {Proc.\ SLE},
publisher = {ACM},
pages = {152--166},
doi = {10.1145/3357766.3359541},
year = {2019},
}
Publisher's Version
SLE '19: "Shadow Models: Incremental ..."
Shadow Models: Incremental Transformations for MPS
Markus Voelter, Klaus Birken, Sascha Lisson, and Alexander Rimer
(itemis, Germany)
Shadow Models is an incremental transformation framework for MPS. The name is motivated by the realization that many analyses are easier to do on an model whose structure is different from what the user edits. To be able to run such analyses interactively in an IDE, these ``shadows'' of the user-facing model must be maintained in realtime, and incrementality can deliver the needed short response times. Shadow Models is an incremental model transformation engine for MPS. In the paper we motivate the system through example use cases, and outline the transformation framework.
@InProceedings{SLE19p61,
author = {Markus Voelter and Klaus Birken and Sascha Lisson and Alexander Rimer},
title = {Shadow Models: Incremental Transformations for MPS},
booktitle = {Proc.\ SLE},
publisher = {ACM},
pages = {61--65},
doi = {10.1145/3357766.3359528},
year = {2019},
}
Publisher's Version
SLE '19: "High-Level Mission Specification ..."
High-Level Mission Specification for Multiple Robots
Sergio García, Patrizio Pelliccione, Claudio Menghi, Thorsten Berger, and Tomas Bures
(Chalmers University of Technology, Sweden; University of Gothenburg, Sweden; University of Luxembourg, Luxembourg; Charles University in Prague, Czechia)
Mobile robots are increasingly used in our everyday life to autonomously realize missions. A variety of languages has been proposed to support roboticists in the systematic development of robotic applications, ranging from logical languages with well-defined semantics to domain-specific languages with user-friendly syntax. The characteristics of both of them have distinct advantages, however, developing a language that combines those advantages remains an elusive task. We present PROMISE, a novel language that enables domain experts to specify missions on a high level of abstraction for teams of autonomous robots in a user-friendly way, while having well-defined semantics. Our ambition is to permit users to specify high-level goals instead of a series of specific actions the robots should perform. The language contains a set of atomic tasks that can be executed by robots and a set of operators that allow the composition of these tasks in complex missions. The language is supported by a standalone tool that permits mission specification through a textual and a graphical interface and that can be integrated within a variety of frameworks. We integrated PROMISE with a software platform providing functionalities such as motion control and planning. We conducted experiments to evaluate the correctness of the specification and execution of complex robotic missions with both simulators and real robots. We also conducted two user studies to assess the simplicity of PROMISE. The results show that PROMISE effectively supports users to specify missions for robots in a user-friendly manner.
@InProceedings{SLE19p127,
author = {Sergio García and Patrizio Pelliccione and Claudio Menghi and Thorsten Berger and Tomas Bures},
title = {High-Level Mission Specification for Multiple Robots},
booktitle = {Proc.\ SLE},
publisher = {ACM},
pages = {127--140},
doi = {10.1145/3357766.3359535},
year = {2019},
}
Publisher's Version
Video
Info
Artifacts Functional
SLE '19: "A Feature-Based Classification ..."
A Feature-Based Classification of Triple Graph Grammar Variants
Nils Weidmann, Robin Oppermann, and Patrick Robrecht
(University of Paderborn, Germany)
Bidirectional model transformations are a way to keep two models synchronized and propagate changes in one model to the other one. Triple Graph Grammars (TGGs) are a rule-based approach to define consistency bidirectionally, with applications e.g. in the development of textual and visual languages. Although the underlying formalism is relatively uniform in different TGG tools, there are various TGG variants supporting different sets of language features, such as attribute conditions, (negative) application conditions, and multi-amalgamation. This makes it difficult to evaluate the expressiveness of a specific TGG tool, to check whether the tool supports all features required to specify a given consistency relation.
In this paper, we provide an overview of the most common language features of TGGs. Based on this, we discuss different TGG variants formally and develop a classification of TGG approaches with respect to their expressiveness. We evaluate whether certain language features increase the expressiveness of TGGs or just improve the usability and simplify the specification, which can be important when choosing a software tool depending on the concrete problem at hand. Additionally, examples implemented in the TGG tool eMoflon::IBeX are discussed, which particularly illustrate how the various TGG variants differ in their expressiveness.
@InProceedings{SLE19p1,
author = {Nils Weidmann and Robin Oppermann and Patrick Robrecht},
title = {A Feature-Based Classification of Triple Graph Grammar Variants},
booktitle = {Proc.\ SLE},
publisher = {ACM},
pages = {1--14},
doi = {10.1145/3357766.3359529},
year = {2019},
}
Publisher's Version
SLE '19: "Generating Incremental Type ..."
Generating Incremental Type Services
André Pacak and Sebastian Erdweg
(Johannes Gutenberg University Mainz, Germany)
In this vision paper, we propose a method for generating fully functional incremental type services from declarations of type rules. Our general strategy is to translate type rules into Datalog, for which efficient incremental solvers are already available. However, many aspects of type rules don't naturally translate to Datalog and need non-trivial translation. We demonstrate that such translation may be feasible by outlining the translation rules needed for a language with typing contexts (name binding) and bidirectional type rules (local type inference). We envision that even rich type systems of DSLs can be incrementalized by translation to Datalog in the future.
@InProceedings{SLE19p197,
author = {André Pacak and Sebastian Erdweg},
title = {Generating Incremental Type Services},
booktitle = {Proc.\ SLE},
publisher = {ACM},
pages = {197--201},
doi = {10.1145/3357766.3359534},
year = {2019},
}
Publisher's Version
SLE '19: "The Lands Platform: Lan.guages ..."
The Lands Platform: Lan.guages and D.omain S.yntax
Nick Papoulias
(Grenoble Alps University, France)
Lan.d.s is a new solution for language design. From general purpose languages like Lise (short for (list (embedding)) to Domain-Specific Languages using the MOODs framework, and everything else in between. Lan.d.s is build around the formalism of Multi-Ordered Grammars, which are a possible alternative to CFGs and PEGs in wider use today. Multi- ordered grammars (or simply MOGs) aim for a better explo- ration of ambiguity, recursion, ordering and associativity during language design. They can be parsed using the Gray algorithm. After parsing in order to ease the production of executable code Lan.d.s introduces the Abstract Syntax Language (ASL), which is an OO solution for compile-time meta-programming. Finally in order to promote language ex- tension and re-use Lan.d.s employs GrammarTraits, as units of composition for both MOG rules and ASL actions.
@InProceedings{SLE19p66,
author = {Nick Papoulias},
title = {The Lands Platform: Lan.guages and D.omain S.yntax},
booktitle = {Proc.\ SLE},
publisher = {ACM},
pages = {66--70},
doi = {10.1145/3357766.3359547},
year = {2019},
}
Publisher's Version
Video
Info
SLE '19: "High-Level Mission Specification ..."
High-Level Mission Specification for Multiple Robots
Sergio García, Patrizio Pelliccione, Claudio Menghi, Thorsten Berger, and Tomas Bures
(Chalmers University of Technology, Sweden; University of Gothenburg, Sweden; University of Luxembourg, Luxembourg; Charles University in Prague, Czechia)
Mobile robots are increasingly used in our everyday life to autonomously realize missions. A variety of languages has been proposed to support roboticists in the systematic development of robotic applications, ranging from logical languages with well-defined semantics to domain-specific languages with user-friendly syntax. The characteristics of both of them have distinct advantages, however, developing a language that combines those advantages remains an elusive task. We present PROMISE, a novel language that enables domain experts to specify missions on a high level of abstraction for teams of autonomous robots in a user-friendly way, while having well-defined semantics. Our ambition is to permit users to specify high-level goals instead of a series of specific actions the robots should perform. The language contains a set of atomic tasks that can be executed by robots and a set of operators that allow the composition of these tasks in complex missions. The language is supported by a standalone tool that permits mission specification through a textual and a graphical interface and that can be integrated within a variety of frameworks. We integrated PROMISE with a software platform providing functionalities such as motion control and planning. We conducted experiments to evaluate the correctness of the specification and execution of complex robotic missions with both simulators and real robots. We also conducted two user studies to assess the simplicity of PROMISE. The results show that PROMISE effectively supports users to specify missions for robots in a user-friendly manner.
@InProceedings{SLE19p127,
author = {Sergio García and Patrizio Pelliccione and Claudio Menghi and Thorsten Berger and Tomas Bures},
title = {High-Level Mission Specification for Multiple Robots},
booktitle = {Proc.\ SLE},
publisher = {ACM},
pages = {127--140},
doi = {10.1145/3357766.3359535},
year = {2019},
}
Publisher's Version
Video
Info
Artifacts Functional
SLE '19: "Spectrum-Based Fault Localization ..."
Spectrum-Based Fault Localization for Context-Free Grammars
Moeketsi Raselimo and Bernd Fischer
(Stellenbosch University, South Africa)
We describe and evaluate the first spectrum-based fault localization method aimed at finding faulty rules in a context-free grammar. It takes as input a test suite and a modified parser for the grammar that can collect grammar spectra, i.e., the sets of rules used in attempts to parse the individual test cases, and returns as output a ranked list of suspicious rules. We show how grammar spectra can be collected for both LL and LR parsers, and how the ANTLR and CUP parser generators can be modified and used to automate the collection of the grammar spectra. We evaluate our method over grammars with seeded faults as well as real world grammars and student grammars submitted in compiler engineering courses that contain real faults. The results show that our method ranks the seeded faults within the top five rules in more than half of the cases and can pinpoint them in 10%–40% of the cases. On average, it ranks the faults at around 25% of all rules, and better than 15% for a very large test suite. It also allowed us to identify deviations and faults in the real world and student grammars.
@InProceedings{SLE19p15,
author = {Moeketsi Raselimo and Bernd Fischer},
title = {Spectrum-Based Fault Localization for Context-Free Grammars},
booktitle = {Proc.\ SLE},
publisher = {ACM},
pages = {15--28},
doi = {10.1145/3357766.3359538},
year = {2019},
}
Publisher's Version
SLE '19: "Breaking Parsers: Mutation-Based ..."
Breaking Parsers: Mutation-Based Generation of Programs with Guaranteed Syntax Errors
Moeketsi Raselimo, Jan Taljaard, and Bernd Fischer
(Stellenbosch University, South Africa)
Grammar-based test case generation has focused almost exclusively on generating syntactically correct programs (i.e., positive tests) from a context-free reference grammar but a positive test suite cannot detect when the unit under test accepts words outside the language (i.e., false positives). Here, we investigate the converse problem and describe two mutation-based approaches for generating programs with guaranteed syntax errors (i.e., negative tests). % Word mutation systematically modifies positive tests by deleting, inserting, substituting, and transposing tokens in such a way that at least one impossible token pair emerges. % Rule mutation applies such operations to the symbols of the right-hand sides of productions in such a way that each derivation that uses the mutated rule yields a word outside the language.
@InProceedings{SLE19p83,
author = {Moeketsi Raselimo and Jan Taljaard and Bernd Fischer},
title = {Breaking Parsers: Mutation-Based Generation of Programs with Guaranteed Syntax Errors},
booktitle = {Proc.\ SLE},
publisher = {ACM},
pages = {83--87},
doi = {10.1145/3357766.3359542},
year = {2019},
}
Publisher's Version
SLE '19: "Shadow Models: Incremental ..."
Shadow Models: Incremental Transformations for MPS
Markus Voelter, Klaus Birken, Sascha Lisson, and Alexander Rimer
(itemis, Germany)
Shadow Models is an incremental transformation framework for MPS. The name is motivated by the realization that many analyses are easier to do on an model whose structure is different from what the user edits. To be able to run such analyses interactively in an IDE, these ``shadows'' of the user-facing model must be maintained in realtime, and incrementality can deliver the needed short response times. Shadow Models is an incremental model transformation engine for MPS. In the paper we motivate the system through example use cases, and outline the transformation framework.
@InProceedings{SLE19p61,
author = {Markus Voelter and Klaus Birken and Sascha Lisson and Alexander Rimer},
title = {Shadow Models: Incremental Transformations for MPS},
booktitle = {Proc.\ SLE},
publisher = {ACM},
pages = {61--65},
doi = {10.1145/3357766.3359528},
year = {2019},
}
Publisher's Version
SLE '19: "A Feature-Based Classification ..."
A Feature-Based Classification of Triple Graph Grammar Variants
Nils Weidmann, Robin Oppermann, and Patrick Robrecht
(University of Paderborn, Germany)
Bidirectional model transformations are a way to keep two models synchronized and propagate changes in one model to the other one. Triple Graph Grammars (TGGs) are a rule-based approach to define consistency bidirectionally, with applications e.g. in the development of textual and visual languages. Although the underlying formalism is relatively uniform in different TGG tools, there are various TGG variants supporting different sets of language features, such as attribute conditions, (negative) application conditions, and multi-amalgamation. This makes it difficult to evaluate the expressiveness of a specific TGG tool, to check whether the tool supports all features required to specify a given consistency relation.
In this paper, we provide an overview of the most common language features of TGGs. Based on this, we discuss different TGG variants formally and develop a classification of TGG approaches with respect to their expressiveness. We evaluate whether certain language features increase the expressiveness of TGGs or just improve the usability and simplify the specification, which can be important when choosing a software tool depending on the concrete problem at hand. Additionally, examples implemented in the TGG tool eMoflon::IBeX are discussed, which particularly illustrate how the various TGG variants differ in their expressiveness.
@InProceedings{SLE19p1,
author = {Nils Weidmann and Robin Oppermann and Patrick Robrecht},
title = {A Feature-Based Classification of Triple Graph Grammar Variants},
booktitle = {Proc.\ SLE},
publisher = {ACM},
pages = {1--14},
doi = {10.1145/3357766.3359529},
year = {2019},
}
Publisher's Version
SLE '19: "Consistency Management via ..."
Consistency Management via a Combination of Triple Graph Grammars and Linear Programming
Nils Weidmann, Anthony Anjorin, Erhan Leblebici, and Andy Schürr
(University of Paderborn, Germany; TU Darmstadt, Germany)
Consistency management is an important task in the context of Domain-Specific Language (DSL) development. It involves operations such as program (model) transformation, synchronisation, integration, and consistency checking, which are all tasks required to enable concurrent engineering using multiple DSLs. Even though consistency management is a well-researched topic, existing approaches either implement a fixed strategy for each consistency management operation, or do not scale for large models. This has been criticised in the literature, as practical applications require not only reasonable scalability with model size, but also unite multiple consistency management tasks within one tool. To raise the adaptability of such a tool to an appropriate level, a uniform way of performing these tasks is a desirable goal. In this paper, we propose an approach to consistency management that leverages a synergetic combination of Triple Graph Grammars and Integer Linear Programming. By modelling consistency management as an optimisation problem with a configurable objective function, we are able to uniformly address a wide range of consistency management operations. We show that our approach scales acceptably in practice, while still guaranteeing that a consistent solution is found if and only if one exists.
@InProceedings{SLE19p29,
author = {Nils Weidmann and Anthony Anjorin and Erhan Leblebici and Andy Schürr},
title = {Consistency Management via a Combination of Triple Graph Grammars and Linear Programming},
booktitle = {Proc.\ SLE},
publisher = {ACM},
pages = {29--41},
doi = {10.1145/3357766.3359544},
year = {2019},
}
Publisher's Version
SLE '19: "Efficient Late Binding of ..."
Efficient Late Binding of Dynamic Function Compositions
Lars Schütze and Jeronimo Castrillon
(TU Dresden, Germany)
Adaptive software becomes more and more important as computing is increasingly context-dependent. Runtime adaptability can be achieved by dynamically selecting and applying context-specific code. Role-oriented programming has been proposed as a paradigm to enable runtime adaptive software by design. Roles change the objects’ behavior at runtime and thus allow adapting the software to a given context. However, this increased variability and expressiveness has a direct impact on performance and memory consumption. We found a high overhead in the steady-state performance of executing compositions of adaptations. This paper presents a new approach to use run-time information to construct a dispatch plan that can be executed efficiently by the JVM. The concept of late binding is extended to dynamic function compositions. We evaluated the implementation with a benchmark for role-oriented programming languages leveraging context-dependent role semantics achieving a mean speedup of 2.79× over the regular implementation.
@InProceedings{SLE19p141,
author = {Lars Schütze and Jeronimo Castrillon},
title = {Efficient Late Binding of Dynamic Function Compositions},
booktitle = {Proc.\ SLE},
publisher = {ACM},
pages = {141--151},
doi = {10.1145/3357766.3359543},
year = {2019},
}
Publisher's Version
SLE '19: "Multiple Lexicalisation (A ..."
Multiple Lexicalisation (A Java Based Study)
Elizabeth Scott and Adrian Johnstone
(Royal Holloway University of London, UK)
We consider the possibility of making the lexicalisation phase of compilation more powerful by avoiding the need for the lexer to return a single token string from the input character string. This has the potential to empower language design by softening the boundaries between lexical and phrase level specification. The large number of lexicalisations makes it impractical to parse each one individually, but it is possible to share the parsing of common subparts, reducing the number of tokens parsed from the product of the token numbers associated with the components to their sum. We report total numbers of lexicalisations of example Java strings, and the impact on these numbers of various lexical disambiguation strategies, and we introduce a new generalised parsing technique that can efficiently parse multiple lexicalisations of character string simultaneously. We then use this technique on Java, reporting on the number of lexicalisations that correspond to syntactically correct Java strings and the degree to which the standard Java lexer is safe in the sense that it does not remove all the syntactically correct lexicalisations of an input character string. Our multi-lexer parser is an alternative to scannerless parsing of a character level grammar, retaining the separation between grammar terminals and the corresponding lexical tokens. This has the advantages of allowing the parser to use terminal level lookahead and keeping lexical level disambiguation separate from the context free grammar.
@InProceedings{SLE19p71,
author = {Elizabeth Scott and Adrian Johnstone},
title = {Multiple Lexicalisation (A Java Based Study)},
booktitle = {Proc.\ SLE},
publisher = {ACM},
pages = {71--82},
doi = {10.1145/3357766.3359532},
year = {2019},
}
Publisher's Version
SLE '19: "Empirical Study on the Usage ..."
Empirical Study on the Usage of Graph Query Languages in Open Source Java Projects
Philipp Seifer, Johannes Härtel, Martin Leinberger, Ralf Lämmel, and Steffen Staab
(University of Koblenz-Landau, Germany; University of Southampton, UK)
Graph data models are interesting in various domains, in part because of the intuitiveness and flexibility they offer compared to relational models. Specialized query languages, such as Cypher for property graphs or SPARQL for RDF, facilitate their use. In this paper, we present an empirical study on the usage of graph-based query languages in open-source Java projects on GitHub. We investigate the usage of SPARQL, Cypher, Gremlin and GraphQL in terms of popularity and their development over time. We select repositories based on dependencies related to these technologies and employ various popularity and source-code based filters and ranking features for a targeted selection of projects. For the concrete languages SPARQL and Cypher, we analyze the activity of repositories over time. For SPARQL, we investigate common application domains, query use and existence of ontological data modeling in applications that query for concrete instance data. Our results show, that the usage of graph query languages in open-source projects increased over the last years, with SPARQL and Cypher being by far the most popular. SPARQL projects are more active in terms of query related artifact changes and unique developers involved, but Cypher is catching up. Relatively few applications use SPARQL to query for concrete instance data: A majority of those applications employ multiple different ontologies, including project and domain specific ones. Common application domains are management systems and data visualization tools.
@InProceedings{SLE19p152,
author = {Philipp Seifer and Johannes Härtel and Martin Leinberger and Ralf Lämmel and Steffen Staab},
title = {Empirical Study on the Usage of Graph Query Languages in Open Source Java Projects},
booktitle = {Proc.\ SLE},
publisher = {ACM},
pages = {152--166},
doi = {10.1145/3357766.3359541},
year = {2019},
}
Publisher's Version
SLE '19: "Operationalizing the Integration ..."
Operationalizing the Integration of User Interaction Specifications in the Synthesis of Modeling Editors
Vasco Sousa, Eugene Syriani, and Khady Fall
(Université de Montréal, Canada)
A long shortcoming in the automatic generation of domain-specific modeling (DSM) editors has been the lack of user experience, in particular, user interaction adapted to its user. The current practice relies solely on the abstract and concrete syntax of the language, restricting the user interaction with the editor to a set of generic interactions built-in the tool. To increase the user experience with DSM editors, we propose to specify the different viewpoints of interactions (e.g., I/O devices, component of the interface, behavior of the editor) each modeled at the right level of abstraction for its user expert. The goal of this paper is to demonstrate the feasibility of the approach, by anchoring the operational semantics of all these viewpoints in a Statecharts model that controls the DSM editor. We report on the complex transformation that takes as input different viewpoints are expressed in at distinct levels of abstraction, to produce a custom interaction with the DSM editor based on a RETE algorithm. Our implementation shows that we can produce correct and responsive results by emulating existing DSM editors.
@InProceedings{SLE19p42,
author = {Vasco Sousa and Eugene Syriani and Khady Fall},
title = {Operationalizing the Integration of User Interaction Specifications in the Synthesis of Modeling Editors},
booktitle = {Proc.\ SLE},
publisher = {ACM},
pages = {42--54},
doi = {10.1145/3357766.3359539},
year = {2019},
}
Publisher's Version
Info
SLE '19: "Empirical Study on the Usage ..."
Empirical Study on the Usage of Graph Query Languages in Open Source Java Projects
Philipp Seifer, Johannes Härtel, Martin Leinberger, Ralf Lämmel, and Steffen Staab
(University of Koblenz-Landau, Germany; University of Southampton, UK)
Graph data models are interesting in various domains, in part because of the intuitiveness and flexibility they offer compared to relational models. Specialized query languages, such as Cypher for property graphs or SPARQL for RDF, facilitate their use. In this paper, we present an empirical study on the usage of graph-based query languages in open-source Java projects on GitHub. We investigate the usage of SPARQL, Cypher, Gremlin and GraphQL in terms of popularity and their development over time. We select repositories based on dependencies related to these technologies and employ various popularity and source-code based filters and ranking features for a targeted selection of projects. For the concrete languages SPARQL and Cypher, we analyze the activity of repositories over time. For SPARQL, we investigate common application domains, query use and existence of ontological data modeling in applications that query for concrete instance data. Our results show, that the usage of graph query languages in open-source projects increased over the last years, with SPARQL and Cypher being by far the most popular. SPARQL projects are more active in terms of query related artifact changes and unique developers involved, but Cypher is catching up. Relatively few applications use SPARQL to query for concrete instance data: A majority of those applications employ multiple different ontologies, including project and domain specific ones. Common application domains are management systems and data visualization tools.
@InProceedings{SLE19p152,
author = {Philipp Seifer and Johannes Härtel and Martin Leinberger and Ralf Lämmel and Steffen Staab},
title = {Empirical Study on the Usage of Graph Query Languages in Open Source Java Projects},
booktitle = {Proc.\ SLE},
publisher = {ACM},
pages = {152--166},
doi = {10.1145/3357766.3359541},
year = {2019},
}
Publisher's Version
SLE '19: "Transactional Editing: Giving ..."
Transactional Editing: Giving ACID to Programmers
Friedrich Steimann and Nils Kurowsky
(Fernuniversität in Hagen, Germany)
Collaboration among programmers today mostly relies on file-based version control systems. These systems typically use optimistic locking to enable parallel work, meaning that competing edits (edit conflicts) are detected and have to be resolved at update or commit time. While merging edits can partly be automated, it is an error-prone task that can introduce inconsistencies. Pessimistic locking of the files to be edited does not appear to be a popular alternative, however, and in any case is insufficient to avoid inconsistency, since it does not account for the dependence of (code in) files on others. To address these problems, we show how the notions of atomicity, consistency, and isolation known from transactional databases can be enforced in the context of collaborative programming. We do so by presenting editing as a set of primitive edit operations applied to an abstract syntax graph overlaid by a constraint graph expressing the consistency criteria mandated by the rules of well-formedness of a language, and by deriving for every sequence of primitive edit operations the write- and read-locks sufficient to: perform the edit sequence, either completely or not at all, in isolation from others; and to achieve global consistency before committing.
@InProceedings{SLE19p202,
author = {Friedrich Steimann and Nils Kurowsky},
title = {Transactional Editing: Giving ACID to Programmers},
booktitle = {Proc.\ SLE},
publisher = {ACM},
pages = {202--215},
doi = {10.1145/3357766.3359536},
year = {2019},
}
Publisher's Version
SLE '19: "Domain-Specific Model Differencing ..."
Domain-Specific Model Differencing in Visual Concrete Syntax
Manouchehr Zadahmad, Eugene Syriani, Omar Alam, Esther Guerra, and Juan de Lara
(Université de Montréal, Canada; Trent University, Canada; Autonomous University of Madrid, Spain)
Like any other software artifact, models evolve and need to be versioned. In the last few years, dedicated support for model versioning has been proposed to improve the default text-based versioning that version control systems offer. However, there is still the need to comprehend model differences in terms of the semantics of the modeling language. For this purpose, we propose a comprehensive approach that considers both abstract and concrete syntax, to express model differences in terms of the domain-specific language (DSL) used and define domain-specific semantics for specific difference patterns. The approach is based on the automatic extension of the DSL to enable the representation of changes, on the definition of rules to capture recurrent domain-specific difference patterns, and on the automatic adaptation of the graphical concrete syntax to visualize the differences. We present a prototype tool support and discuss its application on versioned models created by third parties.
@InProceedings{SLE19p100,
author = {Manouchehr Zadahmad and Eugene Syriani and Omar Alam and Esther Guerra and Juan de Lara},
title = {Domain-Specific Model Differencing in Visual Concrete Syntax},
booktitle = {Proc.\ SLE},
publisher = {ACM},
pages = {100--112},
doi = {10.1145/3357766.3359537},
year = {2019},
}
Publisher's Version
SLE '19: "Operationalizing the Integration ..."
Operationalizing the Integration of User Interaction Specifications in the Synthesis of Modeling Editors
Vasco Sousa, Eugene Syriani, and Khady Fall
(Université de Montréal, Canada)
A long shortcoming in the automatic generation of domain-specific modeling (DSM) editors has been the lack of user experience, in particular, user interaction adapted to its user. The current practice relies solely on the abstract and concrete syntax of the language, restricting the user interaction with the editor to a set of generic interactions built-in the tool. To increase the user experience with DSM editors, we propose to specify the different viewpoints of interactions (e.g., I/O devices, component of the interface, behavior of the editor) each modeled at the right level of abstraction for its user expert. The goal of this paper is to demonstrate the feasibility of the approach, by anchoring the operational semantics of all these viewpoints in a Statecharts model that controls the DSM editor. We report on the complex transformation that takes as input different viewpoints are expressed in at distinct levels of abstraction, to produce a custom interaction with the DSM editor based on a RETE algorithm. Our implementation shows that we can produce correct and responsive results by emulating existing DSM editors.
@InProceedings{SLE19p42,
author = {Vasco Sousa and Eugene Syriani and Khady Fall},
title = {Operationalizing the Integration of User Interaction Specifications in the Synthesis of Modeling Editors},
booktitle = {Proc.\ SLE},
publisher = {ACM},
pages = {42--54},
doi = {10.1145/3357766.3359539},
year = {2019},
}
Publisher's Version
Info
SLE '19: "Breaking Parsers: Mutation-Based ..."
Breaking Parsers: Mutation-Based Generation of Programs with Guaranteed Syntax Errors
Moeketsi Raselimo, Jan Taljaard, and Bernd Fischer
(Stellenbosch University, South Africa)
Grammar-based test case generation has focused almost exclusively on generating syntactically correct programs (i.e., positive tests) from a context-free reference grammar but a positive test suite cannot detect when the unit under test accepts words outside the language (i.e., false positives). Here, we investigate the converse problem and describe two mutation-based approaches for generating programs with guaranteed syntax errors (i.e., negative tests). % Word mutation systematically modifies positive tests by deleting, inserting, substituting, and transposing tokens in such a way that at least one impossible token pair emerges. % Rule mutation applies such operations to the symbols of the right-hand sides of productions in such a way that each derivation that uses the mutated rule yields a word outside the language.
@InProceedings{SLE19p83,
author = {Moeketsi Raselimo and Jan Taljaard and Bernd Fischer},
title = {Breaking Parsers: Mutation-Based Generation of Programs with Guaranteed Syntax Errors},
booktitle = {Proc.\ SLE},
publisher = {ACM},
pages = {83--87},
doi = {10.1145/3357766.3359542},
year = {2019},
}
Publisher's Version
SLE '19: "Default Disambiguation for ..."
Default Disambiguation for Online Parsers
Lukas Diekmann and Laurence Tratt
(King's College London, UK)
Since composed grammars are often ambiguous, grammar composition requires a mechanism for dealing with ambiguity: either ruling it out by using delimiters (which are awkward to work with), or by using disambiguation operators to filter a parse forest down to a single parse tree (where, in general, we cannot be sure that we have covered all possible parse forests). In this paper, we show that default disambiguation, which is inappropriate for batch parsing, works well for online parsing, where it can be overridden by the user if necessary. We extend language boxes – a delimiter-based algorithm atop incremental parsing – in such a way that default disambiguation can automatically insert, remove, or resize, language boxes, leading to the automatic language boxes algorithm. The nature of the problem means that default disambiguation cannot always match a user’s intention. However, our experimental evaluation shows that automatic language boxes behave acceptably in 96.8% of tests involving compositions of real-world programming languages.
@InProceedings{SLE19p88,
author = {Lukas Diekmann and Laurence Tratt},
title = {Default Disambiguation for Online Parsers},
booktitle = {Proc.\ SLE},
publisher = {ACM},
pages = {88--99},
doi = {10.1145/3357766.3359530},
year = {2019},
}
Publisher's Version
Artifacts Functional
SLE '19: "Shadow Models: Incremental ..."
Shadow Models: Incremental Transformations for MPS
Markus Voelter, Klaus Birken, Sascha Lisson, and Alexander Rimer
(itemis, Germany)
Shadow Models is an incremental transformation framework for MPS. The name is motivated by the realization that many analyses are easier to do on an model whose structure is different from what the user edits. To be able to run such analyses interactively in an IDE, these ``shadows'' of the user-facing model must be maintained in realtime, and incrementality can deliver the needed short response times. Shadow Models is an incremental model transformation engine for MPS. In the paper we motivate the system through example use cases, and outline the transformation framework.
@InProceedings{SLE19p61,
author = {Markus Voelter and Klaus Birken and Sascha Lisson and Alexander Rimer},
title = {Shadow Models: Incremental Transformations for MPS},
booktitle = {Proc.\ SLE},
publisher = {ACM},
pages = {61--65},
doi = {10.1145/3357766.3359528},
year = {2019},
}
Publisher's Version
SLE '19: "A Feature-Based Classification ..."
A Feature-Based Classification of Triple Graph Grammar Variants
Nils Weidmann, Robin Oppermann, and Patrick Robrecht
(University of Paderborn, Germany)
Bidirectional model transformations are a way to keep two models synchronized and propagate changes in one model to the other one. Triple Graph Grammars (TGGs) are a rule-based approach to define consistency bidirectionally, with applications e.g. in the development of textual and visual languages. Although the underlying formalism is relatively uniform in different TGG tools, there are various TGG variants supporting different sets of language features, such as attribute conditions, (negative) application conditions, and multi-amalgamation. This makes it difficult to evaluate the expressiveness of a specific TGG tool, to check whether the tool supports all features required to specify a given consistency relation.
In this paper, we provide an overview of the most common language features of TGGs. Based on this, we discuss different TGG variants formally and develop a classification of TGG approaches with respect to their expressiveness. We evaluate whether certain language features increase the expressiveness of TGGs or just improve the usability and simplify the specification, which can be important when choosing a software tool depending on the concrete problem at hand. Additionally, examples implemented in the TGG tool eMoflon::IBeX are discussed, which particularly illustrate how the various TGG variants differ in their expressiveness.
@InProceedings{SLE19p1,
author = {Nils Weidmann and Robin Oppermann and Patrick Robrecht},
title = {A Feature-Based Classification of Triple Graph Grammar Variants},
booktitle = {Proc.\ SLE},
publisher = {ACM},
pages = {1--14},
doi = {10.1145/3357766.3359529},
year = {2019},
}
Publisher's Version
SLE '19: "Consistency Management via ..."
Consistency Management via a Combination of Triple Graph Grammars and Linear Programming
Nils Weidmann, Anthony Anjorin, Erhan Leblebici, and Andy Schürr
(University of Paderborn, Germany; TU Darmstadt, Germany)
Consistency management is an important task in the context of Domain-Specific Language (DSL) development. It involves operations such as program (model) transformation, synchronisation, integration, and consistency checking, which are all tasks required to enable concurrent engineering using multiple DSLs. Even though consistency management is a well-researched topic, existing approaches either implement a fixed strategy for each consistency management operation, or do not scale for large models. This has been criticised in the literature, as practical applications require not only reasonable scalability with model size, but also unite multiple consistency management tasks within one tool. To raise the adaptability of such a tool to an appropriate level, a uniform way of performing these tasks is a desirable goal. In this paper, we propose an approach to consistency management that leverages a synergetic combination of Triple Graph Grammars and Integer Linear Programming. By modelling consistency management as an optimisation problem with a configurable objective function, we are able to uniformly address a wide range of consistency management operations. We show that our approach scales acceptably in practice, while still guaranteeing that a consistent solution is found if and only if one exists.
@InProceedings{SLE19p29,
author = {Nils Weidmann and Anthony Anjorin and Erhan Leblebici and Andy Schürr},
title = {Consistency Management via a Combination of Triple Graph Grammars and Linear Programming},
booktitle = {Proc.\ SLE},
publisher = {ACM},
pages = {29--41},
doi = {10.1145/3357766.3359544},
year = {2019},
}
Publisher's Version
SLE '19: "Domain-Specific Model Differencing ..."
Domain-Specific Model Differencing in Visual Concrete Syntax
Manouchehr Zadahmad, Eugene Syriani, Omar Alam, Esther Guerra, and Juan de Lara
(Université de Montréal, Canada; Trent University, Canada; Autonomous University of Madrid, Spain)
Like any other software artifact, models evolve and need to be versioned. In the last few years, dedicated support for model versioning has been proposed to improve the default text-based versioning that version control systems offer. However, there is still the need to comprehend model differences in terms of the semantics of the modeling language. For this purpose, we propose a comprehensive approach that considers both abstract and concrete syntax, to express model differences in terms of the domain-specific language (DSL) used and define domain-specific semantics for specific difference patterns. The approach is based on the automatic extension of the DSL to enable the representation of changes, on the definition of rules to capture recurrent domain-specific difference patterns, and on the automatic adaptation of the graphical concrete syntax to visualize the differences. We present a prototype tool support and discuss its application on versioned models created by third parties.
@InProceedings{SLE19p100,
author = {Manouchehr Zadahmad and Eugene Syriani and Omar Alam and Esther Guerra and Juan de Lara},
title = {Domain-Specific Model Differencing in Visual Concrete Syntax},
booktitle = {Proc.\ SLE},
publisher = {ACM},
pages = {100--112},
doi = {10.1145/3357766.3359537},
year = {2019},
}
Publisher's Version