| 1. |
- Al Sabbagh, Khaled, 1987, et al.
(författare)
-
A classification of code changes and test types dependencies for improving machine learning based test selection
- 2021
-
Ingår i: SIGPLAN Notices (ACM Special Interest Group on Programming Languages). - New York, NY, USA : ACM. - 0730-8566. ; , s. 40-49
-
Konferensbidrag (refereegranskat)abstract
- Machine learning has been increasingly used to solve various software engineering tasks. One example of their usage is in regression testing, where a classifier is built using historical code commits to predict which test cases require execution. In this paper, we address the problem of how to link specific code commits to test types to improve the predictive performance of learning models in improving regression testing. We design a dependency taxonomy of the content of committed code and the type of a test case. The taxonomy focuses on two types of code commits: changing memory management and algorithm complexity. We reviewed the literature, surveyed experienced testers from three Swedish-based software companies, and conducted a workshop to develop the taxonomy. The derived taxonomy shows that memory management code should be tested with tests related to performance, load, soak, stress, volume, and capacity; the complexity changes should be tested with the same dedicated tests and maintainability tests. We conclude that this taxonomy can improve the effectiveness of building learning models for regression testing.
|
|
| 2. |
|
|
| 3. |
- Almström Duregård, Jonas, 1984, et al.
(författare)
-
Embedded Parser Generators
- 2011
-
Ingår i: SIGPLAN Notices (ACM Special Interest Group on Programming Languages). - : Association for Computing Machinery (ACM). - 0730-8566 .- 0362-1340 .- 1558-1160. ; 46:12, s. 107-117
-
Tidskriftsartikel (refereegranskat)abstract
- We present a novel method of embedding context-free grammars in Haskell, and to automatically generate parsers and pretty-printers from them. We have implemented this method in a library called BNFC-meta (from the BNF Converter, which it is built on). The library builds compiler front ends using metaprogramming instead of conventional code generation. Parsers are built from labelled BNF grammars that are defined directly in Haskell modules. Our solution combines features of parser generators (static grammar checks, a highly specialised grammar DSL) and adds several features that are otherwise exclusive to combinatory libraries such as the ability to reuse, parameterise and generate grammars inside Haskell. To allow writing grammars in concrete syntax, BNFC-meta provides a quasi-quoter that can parse grammars (embedded in Haskell files) at compile time and use metaprogramming to replace them with their abstract syntax. We also generate quasi-quoters so that the languages we define with BNFC-meta can be embedded in the same way. With a minimal change to the grammar, we support adding anti-quotation to the generated quasi-quoters, which allows users of the defined language to mix concrete and abstract syntax almost seamlessly. Unlike previous methods of achieving anti-quotation, the method used by BNFC-meta is simple, efficient and avoids polluting the abstract syntax types.
|
|
| 4. |
- Ankner, Johan, et al.
(författare)
-
An EDSL approach to high performance haskell programming
- 2013
-
Ingår i: SIGPLAN Notices (ACM Special Interest Group on Programming Languages). - New York, NY, USA : ACM. - 0730-8566. ; 48:12, s. 1-11
-
Tidskriftsartikel (refereegranskat)abstract
- This paper argues for a new methodology for writing high performance Haskell programs by using Embedded Domain Specific Languages. We exemplify the methodology by describing a complete library, meta-repa, which is a reimplementation of parts of the repa library. The paper describes the implementation of meta-repa and contrasts it with the standard approach to writing high performance libraries. We conclude that even though the embedded language approach has an initial cost of defining the language and some syntactic overhead it gives a more tailored programming model, stronger performance guarantees, better control over optimizations, simpler implementation of fusion and inlining and allows for moving type level programming down to value level programming in some cases. We also provide benchmarks showing that meta-repa is as fast, or faster, than repa. Furthermore, meta-repa also includes push arrays and we demonstrate their usefulness for writing certain high performance kernels such as FFT.
|
|
| 5. |
- Aronsson, Markus, 1990, et al.
(författare)
-
Hardware software co-design in Haskell
- 2017
-
Ingår i: Haskell 2017 - Proceedings of the 10th ACM SIGPLAN International Symposium on Haskell, co-located with ICFP 2017. - New York, NY, USA : ACM. ; 52:10, s. 162-173
-
Konferensbidrag (refereegranskat)abstract
- We present a library in Haskell for programming Field Programmable Gate Arrays (FPGAs), including hardware software co-design. Code for software (in C) and hardware (in VHDL) is generated from a single program, along with the code to support communication between hardware and software. We present type-based techniques for the simultaneous implementation of more than one embedded domain specific language (EDSL). We build upon a generic representation of imperative programs that is loosely coupled to instruction and expression types, allowing the individual parts to be developed and improved separately. Code generation is implemented as a series of translations between progressively smaller, typed EDSLs, safeguarding against errors that arise in untyped translations. Initial case studies show promising performance.
|
|
| 6. |
- Axelsson, Emil, 1978
(författare)
-
A generic abstract syntax model for embedded languages
- 2012
-
Ingår i: SIGPLAN Notices (ACM Special Interest Group on Programming Languages). - New York, NY, USA : ACM. - 0730-8566. - 9781450310543 ; 47:9, s. 323-334
-
Konferensbidrag (refereegranskat)abstract
- Representing a syntax tree using a data type often involves having many similar-looking constructors. Functions operating on such types often end up having many similar-looking cases. Different languages often make use of similar-looking constructions. We propose a generic model of abstract syntax trees capable of representing a wide range of typed languages. Syntactic constructs can be composed in a modular fashion enabling reuse of abstract syntax and syntactic processing within and across languages. Building on previous methods of encoding extensible data types in Haskell, our model is a pragmatic solution to Wadler's "expression problem". Its practicality has been confirmed by its use in the implementation of the embedded language Feldspar.
|
|
| 7. |
- Axelsson, Emil, 1978, et al.
(författare)
-
Using Circular Programs for Higher-Order Syntax Functional pearl
- 2013
-
Ingår i: SIGPLAN Notices (ACM Special Interest Group on Programming Languages). - : Association for Computing Machinery (ACM). - 0730-8566 .- 0362-1340 .- 1558-1160. ; 48:9, s. 257-262
-
Tidskriftsartikel (refereegranskat)abstract
- This pearl presents a novel technique for constructing a first-order syntax tree directly from a higher-order interface. We exploit circular programming to generate names for new variables, resulting in a simple yet efficient method. Our motivating application is the design of embedded languages supporting variable binding, where it is convenient to use higher-order syntax when constructing programs, but first-order syntax when processing or transforming programs.
|
|
| 8. |
- Bardizbanyan, Alen, 1986, et al.
(författare)
-
Improving data access efficiency by using context-aware loads and stores
- 2015
-
Ingår i: Proc. 16th ACM SIGPLAN/SIGBED Conference on Languages, Compilers, and Tools for Embedded Systems. - New York : ACM Press. - 0730-8566. - 9781450332576 ; , s. 27-36
-
Konferensbidrag (refereegranskat)abstract
- Memory operations have a significant impact on both performance and energy usage even when an access hits in the level-one data cache (L1 DC). Load instructions in particular affect performance as they frequently result in stalls since the register to be loaded is often referenced before the data is available in the pipeline. L1 DC accesses also impact energy usage as they typically require significantly more energy than a register file access. Despite their impact on performance and energy usage, L1 DC accesses on most processors are performed in a general fashion without regard to the context in which the load or store operation is performed. We describe a set of techniques where the compiler enhances load and store instructions so that they can be executed with fewer stalls and/or enable the L1 DC to be accessed in a more energy-efficient manner. We show that using these techniques can simultaneously achieve a 6% gain in performance and a 43% reduction in L1 DC energy usage.
|
|
| 9. |
- Bernardy, Jean-Philippe, 1978, et al.
(författare)
-
Efficient Divide-and-Conquer Parsing of Practical Context-Free Languages
- 2013
-
Ingår i: SIGPLAN Notices (ACM Special Interest Group on Programming Languages). - : Association for Computing Machinery (ACM). - 0730-8566 .- 0362-1340 .- 1558-1160. ; 48:9, s. 111-122
-
Tidskriftsartikel (refereegranskat)abstract
- We present a divide-and-conquer algorithm for parsing context-free languages efficiently. Our algorithm is an instance of Valiant's (1975), who reduced the problem of parsing to matrix multiplications. We show that, while the conquer step of Valiant's is O(n(3)) in the worst case, it improves to O(log (3) n), under certain conditions satisfied by many useful inputs. These conditions occur for example in program texts written by humans. The improvement happens because the multiplications involve an overwhelming majority of empty matrices. This result is relevant to modern computing: divide-and-conquer algorithms can be parallelized relatively easily.
|
|
| 10. |
- Bernardy, Jean-Philippe, 1978, et al.
(författare)
-
Names For Free - Polymorphic Views of Names and Binders
- 2013
-
Ingår i: SIGPLAN Notices (ACM Special Interest Group on Programming Languages). - New York, NY, USA : ACM. - 0730-8566. - 9781450323833 ; 48:12, s. 13-24
-
Konferensbidrag (refereegranskat)abstract
- We propose a novel technique to represent names and binders inHaskell. The dynamic (run-time) representation is based on de Bruijnindices, but it features an interface to write and manipulatevariables conviently, using Haskell-level lambdas and variables. Thekey idea is to use rich types: a subterm with an additional free variableis viewed either as $\forall v. v \rightarrow \mathsf{Term} (a + v)$or $\exists v. v \times \mathsf{Term} (a + v)$ depending on weather itis constructed or analysed. We demonstrate on a number of exampleshow this approach approach permits to express terms construction and manipulation in a natural way, while retaining the good properties ofrepresentations based on de Bruijn indices.
|
|
