Concept

Low-level programming language

Related publications (201)

CafeSat: a Modern SAT Solver for Scala

We present CafeSat, a SAT solver written in the Scala programming language. CafeSat is a modern solver based on DPLL and featuring many state-of-the-art techniques and heuristics. It uses two-watched literals for Boolean constraint propagation, conflict-dr ...

ACM Press2013

On Cafesat: A Modern SAT Solver for Scala

Régis William Blanc

2013

Distal: A Framework for Implementing Fault-tolerant Distributed Algorithms

André Schiper, Pamela Isabel Delgado Borda, Zarko Milosevic, Martin Biely

We introduce Disal, a new framework that simplifies turning pseudocode of fault tolerant distributed algorithms into efficient executable code. Without proper tool support, even small amounts of pseudocode normally ends up in several thousands of lines of ...

2013

Live demonstration: High level software and hardware synthesis of dataflow programs

Marco Mattavelli, Endri Bezati, Ghislain Roquier

This paper describes and demonstrates a toolchain which enables HW-SW co-synthesis from a single high-level dataflow program. This toolchain does not only enable rapid-prototyping of complex designs, but also provides a complete system integration framewor ...

2013

Lightweight Modular Staging and Embedded Compilers

Tiark Rompf

Programs expressed in a high-level programming language need to be translated to a low-level machine dialect for execution. This translation is usually accomplished by a compiler, which is able to translate any legal program to equivalent low-level code. B ...

EPFL2012

On Software Verification and Graph Similarity for Automated Evaluation of Students' Assignments

Viktor Kuncak

The number of students enrolled in universities at standard and online programming courses is huge. This calls for automated evaluation of students assignments and for automated support for learning. We aim at developing methods and tools for objective and ...

2012

Software Synthesis Procedures

Viktor Kuncak, Mikaël Mayer, Philippe Paul Henri Suter, Ruzica Piskac

Automated synthesis of program fragments from specifications can make programs easier to write and easier to reason about. To integrate synthesis into programming languages, software synthesis algorithms should behave in a predictable way: they should succ ...

2012

Scala Macros, a Technical Report

Martin Odersky, Eugene Burmako

Metaprogramming is a powerful technique of software development, which allows to automate program generation. Applications of metaprogramming range from improving expressiveness of a programming language via deep embedding of domain-specific languages to b ...

2012

Jet: An Embedded DSL for High Performance Big Data Processing

Martin Odersky, Tiark Rompf, Vojin Jovanovic, Stefan Ackermann

Cluster computing systems today impose a trade-off between generality, performance and productivity. Hadoop and Dryad force programmers to write low level programs that are tedious to compose but easy to optimize. Systems like Dryad/LINQ and Spark allow co ...

2012

FlowPools: A Lock-Free Deterministic Concurrent Dataflow Abstraction – Proofs

Martin Odersky, Philipp Haller, Aleksandar Prokopec, Tobias Schlatter

Implementing correct and deterministic parallel programs is challenging. Even though concurrency constructs exist in popular pro- gramming languages to facilitate the task of deterministic parallel pro- gramming, they are often too low level, or do not com ...

2012

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.