Proceedings of the 16th ACM SIGPLAN International Conference on Generative Programming: Concepts and Experiences最新文献_第2页

The landscape of refactoring research in the last decade (keynote) 重构研究在过去十年中的前景(主题演讲)

Proceedings of the 16th ACM SIGPLAN International Conference on Generative Programming: Concepts and Experiences Pub Date : 2017-10-23 DOI: 10.1145/3170492.3148040

Danny Dig

引用次数: 3

A Haskell compiler for signal transforms 一个用于信号转换的Haskell编译器

Proceedings of the 16th ACM SIGPLAN International Conference on Generative Programming: Concepts and Experiences Pub Date : 2017-10-23 DOI: 10.1145/3136040.3136056

G. Mainland, Jeremy R. Johnson

{"title":"A Haskell compiler for signal transforms","authors":"G. Mainland, Jeremy R. Johnson","doi":"10.1145/3136040.3136056","DOIUrl":"https://doi.org/10.1145/3136040.3136056","url":null,"abstract":"Building a reusable, auto-tuning code generator from scratch is a challenging problem, requiring many careful design choices. We describe HSpiral, a Haskell compiler for signal transforms that builds on the foundational work of Spiral. Our design leverages many Haskell language features to ensure that our framework is reusable, flexible, and efficient. As well as describing the design of our system, we show how to extend it to support new classes of transforms, including the number-theoretic transform and a variant of the split-radix algorithm that results in reduced operation counts. We also show how to incorporate rewrite rules into our system to reproduce results from previous literature on code generation for the fast Fourier transform. Although the Spiral project demonstrated significant advances in automatic code generation, it has not been widely used by other researchers. HSpiral is freely available under an MIT-style license, and we are actively working to turn it into a tool to further both our own research goals and to serve as a foundation for other research groups' work in developing new implementations of signal transform algorithms.","PeriodicalId":398999,"journal":{"name":"Proceedings of the 16th ACM SIGPLAN International Conference on Generative Programming: Concepts and Experiences","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116155797","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

RaTrace: simple and efficient abstractions for BVH ray traversal algorithms RaTrace: BVH射线遍历算法的简单而有效的抽象

Proceedings of the 16th ACM SIGPLAN International Conference on Generative Programming: Concepts and Experiences Pub Date : 2017-10-23 DOI: 10.1145/3136040.3136044

Arsène Pérard-Gayot, Martin Weier, Richard Membarth, P. Slusallek, Roland Leißa, Sebastian Hack

{"title":"RaTrace: simple and efficient abstractions for BVH ray traversal algorithms","authors":"Arsène Pérard-Gayot, Martin Weier, Richard Membarth, P. Slusallek, Roland Leißa, Sebastian Hack","doi":"10.1145/3136040.3136044","DOIUrl":"https://doi.org/10.1145/3136040.3136044","url":null,"abstract":"In order to achieve the highest possible performance, the ray traversal and intersection routines at the core of every high-performance ray tracer are usually hand-coded, heavily optimized, and implemented separately for each hardware platform—even though they share most of their algorithmic core. The results are implementations that heavily mix algorithmic aspects with hardware and implementation details, making the code non-portable and difficult to change and maintain. In this paper, we present a new approach that offers the ability to define in a functional language a set of conceptual, high-level language abstractions that are optimized away by a special compiler in order to maximize performance. Using this abstraction mechanism we separate a generic ray traversal and intersection algorithm from its low-level aspects that are specific to the target hardware. We demonstrate that our code is not only significantly more flexible, simpler to write, and more concise but also that the compiled results perform as well as state-of-the-art implementations on any of the tested CPU and GPU platforms.","PeriodicalId":398999,"journal":{"name":"Proceedings of the 16th ACM SIGPLAN International Conference on Generative Programming: Concepts and Experiences","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128674223","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

How preprocessor annotations (do not) affect maintainability: a case study on change-proneness 预处理器注释(不)如何影响可维护性:一个关于易变性的案例研究

Proceedings of the 16th ACM SIGPLAN International Conference on Generative Programming: Concepts and Experiences Pub Date : 2017-10-23 DOI: 10.1145/3136040.3136059

W. Fenske, Sandro Schulze, G. Saake

{"title":"How preprocessor annotations (do not) affect maintainability: a case study on change-proneness","authors":"W. Fenske, Sandro Schulze, G. Saake","doi":"10.1145/3136040.3136059","DOIUrl":"https://doi.org/10.1145/3136040.3136059","url":null,"abstract":"Preprocessor annotations (e.g., #ifdef in C) enable the development of similar, but distinct software variants from a common code base. One particularly popular preprocessor is the C preprocessor, cpp. But the cpp is also widely criticized for impeding software maintenance by making code hard to understand and change. Yet, evidence to support this criticism is scarce. In this paper, we investigate the relation between cpp usage and maintenance effort, which we approximate with the frequency and extent of source code changes. To this end, we mined the version control repositories of eight open- source systems written in C. For each system, we measured if and how individual functions use cpp annotations and how they were changed. We found that functions containing cpp annotations are generally changed more frequently and more profoundly than other functions. However, when accounting for function size, the differences disappear or are greatly diminished. In summary, with respect to the frequency and extent of changes, our findings do not support the criticism of the cpp regarding maintainability.","PeriodicalId":398999,"journal":{"name":"Proceedings of the 16th ACM SIGPLAN International Conference on Generative Programming: Concepts and Experiences","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125522404","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}

引用次数: 12

A classification of variation control systems 变差控制系统的分类

Proceedings of the 16th ACM SIGPLAN International Conference on Generative Programming: Concepts and Experiences Pub Date : 2017-10-23 DOI: 10.1145/3136040.3136054

L. Linsbauer, T. Berger, P. Grünbacher

{"title":"A classification of variation control systems","authors":"L. Linsbauer, T. Berger, P. Grünbacher","doi":"10.1145/3136040.3136054","DOIUrl":"https://doi.org/10.1145/3136040.3136054","url":null,"abstract":"Version control systems are an integral part of today's software and systems development processes. They facilitate the management of revisions (sequential versions) and variants (concurrent versions) of a system under development and enable collaboration between developers. Revisions are commonly maintained either per file or for the whole system. Variants are supported via branching or forking mechanisms that conceptually clone the whole system under development. It is known that such cloning practices come with disadvantages. In fact, while short-lived branches for isolated development of new functionality (a.k.a. feature branches) are well supported, dealing with long-term and fine-grained system variants currently requires employing additional mechanisms, such as preprocessors, build systems or custom configuration tools. Interestingly, the literature describes a number of variation control systems, which provide a richer set of capabilities for handling fine-grained system variants compared to the version control systems widely used today. In this paper we present a classification and comparison of selected variation control systems to get an understanding of their capabilities and the advantages they can offer. We discuss problems of variation control systems, which may explain their comparably low popularity. We also propose research activities we regard as important to change this situation.","PeriodicalId":398999,"journal":{"name":"Proceedings of the 16th ACM SIGPLAN International Conference on Generative Programming: Concepts and Experiences","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128588543","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}

引用次数: 50

Type qualifiers as composable language extensions 将限定符类型为可组合语言扩展

Proceedings of the 16th ACM SIGPLAN International Conference on Generative Programming: Concepts and Experiences Pub Date : 2017-10-23 DOI: 10.1145/3136040.3136055

Travis Carlson, E. V. Wyk

引用次数: 4

Four languages and lots of macros: analyzing autotools build systems 四种语言和大量宏:分析自动工具构建系统

Proceedings of the 16th ACM SIGPLAN International Conference on Generative Programming: Concepts and Experiences Pub Date : 2017-10-23 DOI: 10.1145/3136040.3136051

Jafar M. Al-Kofahi, S. Kothari, Christian Kästner

引用次数: 1

Analyzing the impact of natural language processing over feature location in models 分析自然语言处理对模型中特征定位的影响

Proceedings of the 16th ACM SIGPLAN International Conference on Generative Programming: Concepts and Experiences Pub Date : 2017-10-23 DOI: 10.1145/3136040.3136052

Raúl Lapeña, Jaime Font, Ó. Pastor, Carlos Cetina

引用次数: 11

Avoiding useless mutants 避免无用的变种

Proceedings of the 16th ACM SIGPLAN International Conference on Generative Programming: Concepts and Experiences Pub Date : 2017-10-23 DOI: 10.1145/3136040.3136053

Leo Fernandes, Márcio Ribeiro, Luiz Carvalho, Rohit Gheyi, Melina Mongiovi, André L. M. Santos, Ana Cavalcanti, F. Ferrari, J. Maldonado

{"title":"Avoiding useless mutants","authors":"Leo Fernandes, Márcio Ribeiro, Luiz Carvalho, Rohit Gheyi, Melina Mongiovi, André L. M. Santos, Ana Cavalcanti, F. Ferrari, J. Maldonado","doi":"10.1145/3136040.3136053","DOIUrl":"https://doi.org/10.1145/3136040.3136053","url":null,"abstract":"Mutation testing is a program-transformation technique that injects artificial bugs to check whether the existing test suite can detect them. However, the costs of using mutation testing are usually high, hindering its use in industry. Useless mutants (equivalent and duplicated) contribute to increase costs. Previous research has focused mainly on detecting useless mutants only after they are generated and compiled. In this paper, we introduce a strategy to help developers with deriving rules to avoid the generation of useless mutants. To use our strategy, we pass as input a set of programs. For each program, we also need a passing test suite and a set of mutants. As output, our strategy yields a set of useless mutants candidates. After manually confirming that the mutants classified by our strategy as \"useless\" are indeed useless, we derive rules that can avoid their generation and thus decrease costs. To the best of our knowledge, we introduce 37 new rules that can avoid useless mutants right before their generation. We then implement a subset of these rules in the MUJAVA mutation testing tool. Since our rules have been derived based on artificial and small Java programs, we take our MUJAVA version embedded with our rules and execute it in industrial-scale projects. Our rules reduced the number of mutants by almost 13% on average. Our results are promising because (i) we avoid useless mutants generation; (ii) our strategy can help with identifying more rules in case we set it to use more complex Java programs; and (iii) our MUJAVA version has only a subset of the rules we derived.","PeriodicalId":398999,"journal":{"name":"Proceedings of the 16th ACM SIGPLAN International Conference on Generative Programming: Concepts and Experiences","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115867587","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}

引用次数: 31

Staging with control: type-safe multi-stage programming with control operators 带控制的分段:带控制操作符的类型安全的多阶段编程

Proceedings of the 16th ACM SIGPLAN International Conference on Generative Programming: Concepts and Experiences Pub Date : 2017-10-23 DOI: 10.1145/3136040.3136049

Junpei Oishi, Yukiyoshi Kameyama

引用次数: 4