Proceedings of the 13th international conference on Modularity最新文献

Session details: Language mechanisms I 会话细节:语言机制

Proceedings of the 13th international conference on Modularity Pub Date : 2014-04-22 DOI: 10.1145/3251082

J. Lawall

引用次数: 0

Type names without static type checking already improve the usability of APIs (as long as the type names are correct): an empirical study 没有静态类型检查的类型名已经提高了api的可用性(只要类型名是正确的):一项实证研究

Proceedings of the 13th international conference on Modularity Pub Date : 2014-04-22 DOI: 10.1145/2577080.2577098

Samuel Spiza, Stefan Hanenberg

{"title":"Type names without static type checking already improve the usability of APIs (as long as the type names are correct): an empirical study","authors":"Samuel Spiza, Stefan Hanenberg","doi":"10.1145/2577080.2577098","DOIUrl":"https://doi.org/10.1145/2577080.2577098","url":null,"abstract":"In the discussion about the usefulness of static or dynamic type systems there is often the statement that static type systems improve the documentation of software. In the meantime there exists even some empirical evidence for this statement. One of the possible explanations for this positive influence is that the static type system of programming languages such as Java require developers to write down the type names, i.e. lexical representations which potentially help developers. Because of that there is a plausible hypothesis that the main benefit comes from the type names and not from the static type checks that are based on these names. In order to argue for or against static type systems it is desirable to check this plausible hypothesis in an experimental way. This paper describes an experiment with 20 participants that has been performed in order to check whether developers using an unknown API already benefit (in terms of development time) from the pure syntactical representation of type names without static type checking. The result of the study is that developers do benefit from the type names in an API's source code. But already a single wrong type name has a measurable significant negative impact on the development time in comparison to APIs without type names.","PeriodicalId":357928,"journal":{"name":"Proceedings of the 13th international conference on Modularity","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129937582","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}

引用次数: 22

Session details: Concurrency 会话细节:并发

Proceedings of the 13th international conference on Modularity Pub Date : 2014-04-22 DOI: 10.1145/3251088

Gary T. Leavens

引用次数: 0

Systematic derivation of static analyses for software product lines 软件产品线静态分析的系统推导

Proceedings of the 13th international conference on Modularity Pub Date : 2014-04-22 DOI: 10.1145/2577080.2577091

Jan Midtgaard, Claus Brabrand, A. Wąsowski

引用次数: 18

Session details: Software evolution 会话细节:软件进化

Proceedings of the 13th international conference on Modularity Pub Date : 2014-04-22 DOI: 10.1145/3251083

Christoph Bockisch

引用次数: 0

Composable user-defined operators that can express user-defined literals 可组合的用户定义操作符，可以表示用户定义的字面值

Proceedings of the 13th international conference on Modularity Pub Date : 2014-04-22 DOI: 10.1145/2577080.2577092

Kazuhiro Ichikawa, S. Chiba

{"title":"Composable user-defined operators that can express user-defined literals","authors":"Kazuhiro Ichikawa, S. Chiba","doi":"10.1145/2577080.2577092","DOIUrl":"https://doi.org/10.1145/2577080.2577092","url":null,"abstract":"This paper proposes new composable user-defined operators, named protean operators. They can express various language extensions including user-defined literals such as regular expression literals as well as user-defined expressions. Their expressiveness is equivalent to Parsing Expression Grammar (PEG). The operators have two important features to be parsed in pragmatic time: overloading by return type and a precedence rule for operators. They can be parsed efficiently even if they express user-defined literals since ambiguities in the grammar are removed by these two features. The overloading by return type enables us to consider static types as non-terminal symbols in the grammar. The compiler can use static type information for parsing. It can resolve ambiguities of the rules with the same syntax but a different type. Protean operators with the same return type require programmers to declare the precedence among them. These precedence rules enable completely removing ambiguities from the grammar since all the rules applicable to the same place are ordered. Thus, the expressions including protean operators can be parsed in pragmatic time. We have implemented a language that is a subset of Java but supports protean operators. We present an experiment to show that the programs including user-defined literals cannot be parsed in pragmatic time in existing approaches but can be efficiently parsed in our approach.","PeriodicalId":357928,"journal":{"name":"Proceedings of the 13th international conference on Modularity","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130333080","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}

引用次数: 8

Session details: Modularity visions 会话细节:模块化愿景

Proceedings of the 13th international conference on Modularity Pub Date : 2014-04-22 DOI: 10.1145/3251084

Christoph Bockisch

引用次数: 0

Designing information hiding modularity for model transformation languages 模型转换语言的信息隐藏模块化设计

Proceedings of the 13th international conference on Modularity Pub Date : 2014-04-22 DOI: 10.1145/2577080.2577094

A. Rentschler, Dominik Werle, Qais Noorshams, Lucia Happe, Ralf H. Reussner

{"title":"Designing information hiding modularity for model transformation languages","authors":"A. Rentschler, Dominik Werle, Qais Noorshams, Lucia Happe, Ralf H. Reussner","doi":"10.1145/2577080.2577094","DOIUrl":"https://doi.org/10.1145/2577080.2577094","url":null,"abstract":"Development and maintenance of model transformations make up a substantial share of the lifecycle costs of software products that rely on model-driven techniques. In particular large and heterogeneous models lead to poorly understandable transformation code due to missing language concepts to master complexity. At the present time, there exists no module concept for model transformation languages that allows programmers to control information hiding and strictly declare model and code dependencies at module interfaces. Yet only then can we break down transformation logic into smaller parts, so that each part owns a clear interface for separating concerns. In this paper, we propose a module concept suitable for model transformation engineering. We formalize our concept based on cQVTom, a compact subset of the transformation language QVT-Operational. To meet the special demands of transformations, module interfaces give control over both model and code accessibility. We also implemented the approach for validation. In a case study, we examined the effort required to carry out two typical maintenance tasks on a real-world transformation. We are able to attest a significant reduction of effort, thereby demonstrating the practical effects of a thorough interface concept on the maintainability of model transformations.","PeriodicalId":357928,"journal":{"name":"Proceedings of the 13th international conference on Modularity","volume":"170 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115821993","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}

引用次数: 13

Reusable components of semantic specifications 语义规范的可重用组件

Proceedings of the 13th international conference on Modularity Pub Date : 2014-04-22 DOI: 10.1145/2577080.2577099

Martin Churchill, P. Mosses, Neil Sculthorpe, P. Torrini

引用次数: 44

REScala

Proceedings of the 13th international conference on Modularity Pub Date : 2014-04-22 DOI: 10.1145/2577080.2577083

G. Salvaneschi, Gerold Hintz, M. Mezini

引用次数: 115