Compilation à la volée

Applied sciences
Génie informatique
Programmation informatique
Compilateur

À propos
Confidentialité
Mentions légales

Graph Chatbot

Publications associées (31)

Generalized Skipgrams for Pattern Discovery in Polyphonic Streams

Martin Alois Rohrmeier, Markus Franz Josef Neuwirth, Christoph Finkensiep

The discovery of patterns using a minimal set of assumptions constitutes a central challenge in the modeling of polyphonic music and complex streams in general. Skipgrams have been found to be a powerful model for capturing semi-local dependencies in seque ...

2018

A Practical Unification of Multi-stage Programming and Macros

Martin Odersky, Nicolas Alexander Stucki

Program generation is indispensable. We propose a novel unification of two existing metaprogramming techniques: multi-stage programming and hygienic generative macros. The former supports runtime code generation and execution in a type-safe manner while th ...

2018

Discover deeper bugs with dynamic symbolic execution and coverage-based fuzz testing

George Candea, Vitaly Chipounov, Bin Zhang, Chao Feng

Coverage-based fuzz testing and dynamic symbolic execution are both popular program testing techniques. However, on their own, both techniques suffer from scalability problems when considering the complexity of modern software. Hybrid testing methods attem ...

INST ENGINEERING TECHNOLOGY-IET2018

SAT Based Exact Synthesis using DAG Topology Families

Giovanni De Micheli, Mathias Soeken, Winston Jason Haaswijk

SAT based exact synthesis is a powerful technique, with applications in logic optimization, technology mapping, and synthesis for emerging technologies. However, its runtime behavior can be unpredictable and slow. In this paper, we propose to add a new typ ...

IEEE2018

A Comparison between Two Automatic Assessment Approaches for Programming: An Empirical Study on MOOCs

Pierre Dillenbourg, Patrick Jermann

Computer-graders have been in regular use in the context of MOOCs (Massive Open Online Courses). The automatic grading of programs presents an opportunity to assess and provide tailored feedback to large classes, while featuring at the same time a number o ...

2018

Real-Time Optimization of Uncertain Process Systems via Modifier Adaptation and Gaussian Processes

Dominique Bonvin, Colin Neil Jones, Timm Faulwasser, Harsh Ambarishkumar Shukla, Tafarel de Avila Ferreira

In the context of static real-time optimization, the use of measurements allows dealing with uncertainty in the form of plant-model mismatch and disturbances. Modifier adaptation (MA) is a measurement-based scheme that uses first-order corrections to the m ...

IEEE2018

Integrating Heuristic and Machine-Learning Methods for Efficient Virtual Machine Allocation in Data Centers

David Atienza Alonso, Marina Zapater Sancho, Ali Pahlevan, Xiaoyu Qu

Modern cloud data centers (DCs) need to tackle efficiently the increasing demand for computing resources and address the energy efficiency challenge. Therefore, it is essential to develop resource provisioning policies that are aware of virtual machine (VM ...

2018

Low-Overhead Dynamic Instruction Mix Generation using Hybrid Basic Block Profiling

Willy Zwaenepoel, Andrzej Pawel Nowak

Dynamic instruction mixes form an important part of the toolkits of performance tuners, compiler writers, and CPU architects. Instruction mixes are traditionally generated using software instrumentation, an accurate yet slow method, that is normally limite ...

2018

Compilation Techniques for Incremental Collection Processing

Daniel Lupei

Many map-reduce frameworks as well as NoSQL systems rely on collection programming as their interface of choice due to its rich semantics along with an easily parallelizable set of primitives. Unfortunately, the potential of collection programming is not ...

EPFL2017

Design and implementation of an optimizing type-centric compiler for a high-level language

Dmytro Petrashko

Production compilers for programming languages face multiple requirements. They should be correct, as we rely on them to produce code. They should be fast, in order to provide a good developer experience. They should also be easy to maintain and evolve. Th ...

EPFL2017

Unification of Compile-Time and Runtime Metaprogramming in Scala

Eugene Burmako

Metaprogramming is a technique that consists in writing programs that treat other programs as data. This paradigm of software development contributes to a multitude of approaches that improve programmer productivity, including code generation, program anal ...

EPFL2017

Page 2 sur 2