Unité

Laboratoire d'analyse et de raisonnement automatisés

Laboratoire

Publications associées (1 000)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

The monoid algebra of all relations on a finite set

Jacques Thévenaz, Serge Bouc

We classify all the simple modules for the algebra of relations on a finite set, give their dimension, and find the dimension of the Jacobson radical of the algebra. ...

2015

Macros in sbt: Problem Solved!

Eugene Burmako, Martin Nicolas Duhem

In the previous report, we described how incremental compilation was made more complicated when macro-enabled programs are involved, and we implemented the foundations of the support for metaprograms in sbt, a build tool and incremental compiler for Scala. ...

2015

Yin-Yang: Concealing the Deep Embedding of DSLs

Martin Odersky, Christoph Koch, Amir Shaikhha, Sandro Stucki, Vojin Jovanovic, Vladimir Nikolaev

Deeply embedded domain-specific languages (EDSLs) intrinsically compromise programmer experience for improved program performance. Shallow EDSLs complement them by trading program performance for good programmer experience. We present Yin-Yang, a framework ...

Assoc Computing Machinery2015

Region-based off-heap memory for Scala

This work explores support for region-based memory in Scala through macro-based domain-specific encoding that exploits a number of extensible language features such as implicits and value classes. ...

2015

Scaling Similarity Joins over Tree-Structured Data

Given a large collection of tree-structured objects (e.g., XML documents), the similarity join finds the pairs of objects that are similar to each other, based on a similarity threshold and a tree edit distance measure. The state-of-the-art similarity join ...

Assoc Computing Machinery2015

Disambiguating Discourse Connectives for Statistical Machine Translation

Andrei Popescu-Belis, Thomas Meyer

This paper shows that the automatic labeling of discourse connectives with the relations they signal, prior to machine translation (MT), can be used by phrase-based statistical MT systems to improve their translations. This improvement is demonstrated here ...

2015

Bounds for Pach's Selection Theorem and for the Minimum Solid Angle in a Simplex

Jan Kyncl

We estimate the selection constant in the following geometric selection theorem by Pach: For every positive integer d, there is a constant such that whenever are n-element subsets of , we can find a point and subsets for every , each of size at least , suc ...

Springer2015

StriSynth: Synthesis for Live Programming

Mikaël Mayer, Ruzica Piskac

Abstract—Motivated by applications in automating repetitive file manipulations, we present a tool called StriSynth, which allows end-users to perform transformations over data using examples. Based on provided examples, our tool automatically generates scr ...

2015

Security of Full-State Keyed Sponge and Duplex: Applications to Authenticated Encryption

Damian Vizár, Reza Reyhanitabar

We provide a security analysis for full-state keyed Sponge and full-state Duplex constructions. Our results can be used for making a large class of Sponge-based authenticated encryption schemes more efficient by concurrent absorption of associated data and ...

Springer2015

The Next 700 BFT Protocols

Rachid Guerraoui, Marko Vukolic, Nikola Knezevic

We present Abstract (ABortable STate mAChine replicaTion), a new abstraction for designing and reconfiguring generalized replicated state machines that are, unlike traditional state machines, allowed to abort executing a client's request if "something goes ...

Association for Computing Machinery2015