Proceedings of the 13th ACM SIGPLAN International Conference on Software Language Engineering最新文献

Annotating executable DSLs with energy estimation formulas 用能量估计公式注释可执行的dsl

Proceedings of the 13th ACM SIGPLAN International Conference on Software Language Engineering Pub Date : 2020-11-16 DOI: 10.1145/3426425.3426930

Thibault Béziers la Fosse, M. Tisi, Jean-Marie Mottu, G. Sunyé

{"title":"Annotating executable DSLs with energy estimation formulas","authors":"Thibault Béziers la Fosse, M. Tisi, Jean-Marie Mottu, G. Sunyé","doi":"10.1145/3426425.3426930","DOIUrl":"https://doi.org/10.1145/3426425.3426930","url":null,"abstract":"Reducing the energy consumption of a complex, especially cyber-physical, system is a cross-cutting concern through the system layers, and typically requires long feedback loops between experts in several engineering disciplines. Having an immediate automatic estimation of the global system consumption at design-time would significantly accelerate this process, but cross-layer tools are missing in several domains. Executable domain-specific modeling languages (xDSLs) can be used to design several layers of the system under development in an integrated view. By including the behavioral specification for software and physical components of the system, they are an effective source artifact for cross-layer energy estimation. In this paper we propose EEL, a language for annotating xDSL primitives with energy-related properties, i.e. how their execution would contribute to the energy consumption on a specific runtime platform. Given an xDSL, energy specialists create EEL models of that xDSL for each considered runtime platform. The models are used at design time, to predict the energy consumption of the real systems. This avoids the need of energetic analysis by deployment and measurement on all runtime platforms, that is slow and expensive. We augment an existing language workbench for xDSLs with an editor for EEL models and a component that computes energy-consumption estimations during model editing. The evaluation shows that EEL can be used to represent estimation models from literature, and provide useful predictions.","PeriodicalId":312792,"journal":{"name":"Proceedings of the 13th ACM SIGPLAN International Conference on Software Language Engineering","volume":"68 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113960362","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 3

Strategic tree rewriting in attribute grammars 属性语法中的策略树重写

Proceedings of the 13th ACM SIGPLAN International Conference on Software Language Engineering Pub Date : 2020-11-16 DOI: 10.1145/3426425.3426943

Lucas Kramer, E. V. Wyk

{"title":"Strategic tree rewriting in attribute grammars","authors":"Lucas Kramer, E. V. Wyk","doi":"10.1145/3426425.3426943","DOIUrl":"https://doi.org/10.1145/3426425.3426943","url":null,"abstract":"This paper presents strategy attributes, a seamless integration of strategic term rewriting into attribute grammars. Strategy attributes are specified using rewrite rules with strategies that control their application. The rules can reference contextual information held in attributes on the trees being rewritten. This use of attributes leads to rewriting on decorated trees instead of undecorated terms. During rewriting, attributes are (lazily) computed on new trees to ensure they are correct with respect to their defining equations. Attributes and strategic rewriting can each be used where most appropriate, thus avoiding the cumbersome aspects of each. Strategy attributes are essentially higher-order attributes for which the defining equations are automatically generated from the attributes' strategy expressions. They are thus compatible with other attribute grammar features such as reference attributes, forwarding, and attribute flow analyses for well-definedness. A conservative static analysis checks if a strategy is intended to always succeed or to be partial, thus simplifying its use and optimizing its translation. Strategy attributes are demonstrated in the optimization of a simple expression language, evaluation of the lambda calculus, and optimization of strategy attribute translations.","PeriodicalId":312792,"journal":{"name":"Proceedings of the 13th ACM SIGPLAN International Conference on Software Language Engineering","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123493421","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 5

Monadification of attribute grammars 属性语法的单元化

Proceedings of the 13th ACM SIGPLAN International Conference on Software Language Engineering Pub Date : 2020-11-16 DOI: 10.1145/3426425.3426941

Dawn Michaelson, E. V. Wyk

{"title":"Monadification of attribute grammars","authors":"Dawn Michaelson, E. V. Wyk","doi":"10.1145/3426425.3426941","DOIUrl":"https://doi.org/10.1145/3426425.3426941","url":null,"abstract":"We describe a monadification process for attribute grammars for more concisely written attribute equations, closer to the style of inference rules used in traditional typing and evaluation specifications. Inference rules specifying, for example, a typing relation typically consider only typable expressions, whereas well-defined attribute grammars explicitly determine attribute values for any term, including untypable ones. The monadification approach lets one represent, for example, types as monadic optional/maybe values, but write non-monadic equations over the value inside the monad that only specify the rules for a correct typing, leading to more concise specifications. The missing failure cases are handled by a rewriting that inserts monadic return, bind, and failure operations to produce a well-defined attribute grammar that handles untypable trees. Thus, one can think in terms of a type T and not the actual monadic type M(T). To formalize this notion, typing and evaluation relations are given for the original and rewritten equations. The rewriting is total, preserves types, and a correctness property relating values of original and rewritten equations is given. A prototype implementation illustrates the benefits with examples such as typing of the simply-typed lambda calculus with Booleans, evaluation of the same, and type inference in Caml Light.","PeriodicalId":312792,"journal":{"name":"Proceedings of the 13th ACM SIGPLAN International Conference on Software Language Engineering","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125827784","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A search-based and fault-tolerant approach to concurrent model synchronisation 基于搜索和容错的并发模型同步方法

Proceedings of the 13th ACM SIGPLAN International Conference on Software Language Engineering Pub Date : 2020-11-16 DOI: 10.1145/3426425.3426932

Nils Weidmann, Lars Fritsche, Anthony Anjorin

{"title":"A search-based and fault-tolerant approach to concurrent model synchronisation","authors":"Nils Weidmann, Lars Fritsche, Anthony Anjorin","doi":"10.1145/3426425.3426932","DOIUrl":"https://doi.org/10.1145/3426425.3426932","url":null,"abstract":"In collaboration scenarios, we often encounter situations in which semantically interrelated models are changed concurrently. Concurrent model synchronization denotes the task of keeping these models consistent by propagating changes between them. This is challenging as changes can contradict each other and thus be in conflict. A problem with current synchronisation approaches is that they are often nondeterministic, i.e., the order in which changes are propagated is essential for the result. Furthermore, a common limitation is that the involved models must have been in a consistent state at some point, and that the applied changes are at least valid for the domain in which they were made. We propose a hybrid approach based on Triple Graph Grammars (TGGs) and Integer Linear Programming (ILP) to overcome these issues: TGGs are a grammar-based means that supplies us with a superset of possible synchronization solutions, forming a search space from which an optimum solution incorporating user-defined preferences can be chosen by ILP. Therefore, the proposed method combines configurability by comprising expert knowledge via TGGs with the flexible input handling of search-based techniques: By accepting arbitrary graph structures as input models, the approach is tolerant towards errors induced during the modelling process, i.e., it can cope with input models which do not conform to their metamodel or which cannot be generated by the TGG at hand. The approach is implemented in the model transformation tool eMoflon and evaluated regarding scalability for growing model sizes and an increasing number of changes.","PeriodicalId":312792,"journal":{"name":"Proceedings of the 13th ACM SIGPLAN International Conference on Software Language Engineering","volume":"191 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132832774","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 6

Example-driven software language engineering 实例驱动的软件语言工程

Proceedings of the 13th ACM SIGPLAN International Conference on Software Language Engineering Pub Date : 2020-11-16 DOI: 10.1145/3426425.3426945

M. Barash

引用次数: 1

Software language engineers’ worst nightmare 软件语言工程师最可怕的噩梦

Proceedings of the 13th ACM SIGPLAN International Conference on Software Language Engineering Pub Date : 2020-11-16 DOI: 10.1145/3426425.3426933

V. Zaytsev

{"title":"Software language engineers’ worst nightmare","authors":"V. Zaytsev","doi":"10.1145/3426425.3426933","DOIUrl":"https://doi.org/10.1145/3426425.3426933","url":null,"abstract":"Many techniques in software language engineering get their first validation by being prototyped to work on one particular language such as Java, Scala, Scheme, or ML, or a subset of such a language. Claims of their generalisability, as well as discussion on potential threats to their external validity, are often based on authors' ad hoc understanding of the world outside their usual comfort zone. To facilitate and simplify such discussions by providing a solid measurable ground, we propose a language called BabyCobol, which was specifically designed to contain features that turn processing legacy programming languages such as COBOL, FORTRAN, PL/I, REXX, CLIST, and 4GLs (fourth generation languages), into such a challenge. The language is minimal by design so that it can help to quickly find weaknesses in frameworks making them inapplicable to dealing with legacy software. However, applying new techniques of software language engineering and reverse engineering to such a small language will not be too tedious and overwhelming. BabyCobol was designed in collaboration with industrial compiler developers by systematically traversing features of several second, third and fourth generation languages to identify the core culprits in making development of compiler for legacy languages difficult.","PeriodicalId":312792,"journal":{"name":"Proceedings of the 13th ACM SIGPLAN International Conference on Software Language Engineering","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132281047","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 3

Principles and patterns of JastAdd-style reference attribute grammars jastadd样式的引用属性语法的原则和模式

Proceedings of the 13th ACM SIGPLAN International Conference on Software Language Engineering Pub Date : 2020-11-16 DOI: 10.1145/3426425.3426934

Niklas Fors, Emma Söderberg, G. Hedin

引用次数: 1

Featherweight Swift: a Core calculus for Swift’s type system 轻量级Swift: Swift类型系统的核心演算

Proceedings of the 13th ACM SIGPLAN International Conference on Software Language Engineering Pub Date : 2020-11-16 DOI: 10.1145/3426425.3426939

Dimitri Racordon, Didier Buchs

{"title":"Featherweight Swift: a Core calculus for Swift’s type system","authors":"Dimitri Racordon, Didier Buchs","doi":"10.1145/3426425.3426939","DOIUrl":"https://doi.org/10.1145/3426425.3426939","url":null,"abstract":"Swift is a modern general-purpose programming language, designed to be a replacement for C-based languages. Although primarily directed at development of applications for Apple's operating systems, Swift's adoption has been growing steadily in other domains, ranging from server-side services to machine learning. This success can be partly attributed to a rich type system that enables the design of safe, fast, and expressive programming interfaces. Unfortunately, this richness comes at the cost of complexity, setting a high entry barrier to exploit Swift's full potential. Furthermore, existing documentation typically only relies on examples, leaving new users with little help to build a deeper understanding of the underlying rules and mechanisms. This paper aims to tackle this issue by laying out the foundations for a formal framework to reason about Swift's type system. We introduce Featherweight Swift, a minimal language stripped of all features not essential to describe its typing rules. Featherweight Swift features classes and protocol inheritance, supports retroactive modeling, and emulates Swift's overriding mechanisms. Yet its formalization fits on a few pages. We present Featherweight Swift's syntax and semantics. We then elaborate on the usability of our framework to reason about Swift's features, future extensions, and implementation by discussing a bug in Swift's compiler, discovered throughout the design of our calculus.","PeriodicalId":312792,"journal":{"name":"Proceedings of the 13th ACM SIGPLAN International Conference on Software Language Engineering","volume":"122 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128812164","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 2

Extrinsically typed operational semantics for functional languages 函数式语言的外类型操作语义

Proceedings of the 13th ACM SIGPLAN International Conference on Software Language Engineering Pub Date : 2020-11-15 DOI: 10.1145/3426425.3426936

M. Cimini, D. Miller, Jeremy G. Siek

引用次数: 5

Towards the optical character recognition of DSLs dsl光学字符识别的研究

Proceedings of the 13th ACM SIGPLAN International Conference on Software Language Engineering Pub Date : 2020-11-15 DOI: 10.1145/3426425.3426937

Jorge Perianez-Pascual, Roberto Rodríguez-Echeverría, L. Burgueño, Jordi Cabot

引用次数: 2