Concept

Programmation par contrat

Publications associées (36)

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

Two approaches to portable macros

Eugene Burmako, Fengyun Liu

For any programming language that supports macros and has multiple implementations (each with different AST definitions), there is a common problem: how to make macros that operate on ASTs portable among different compiler implementations? Implementing por ...

2017

Decrypting Local Type Inference

Hubert Plociniczak

Statically typed languages verify programs at compile-time. As a result many programming mistakes are detected at an early stage of development. A programmer does not have to specify types for every single term manually, however. Many programming languages ...

EPFL2016

Influence of loading history on mechanical properties of biomaterials

Tom Charles Maurice Walet

It is known that the mechanical response to load or displacement of a biological tissue can highly vary from one cycle to the next. Therefore, in order to establish a reference state for repeating data measurements, tissues are subjected to a preliminary s ...

2016

Information-Theoretic Caching

Michael Christoph Gastpar, Sung Hoon Lim, Chien-Yi Wang

Motivated by the caching problem introduced by Maddah-Ali and Niesen, a problem of distributed source coding with side information is formulated, which captures a distinct interesting aspect of caching. For the single-user case, a single-letter characteriz ...

2015

Computing with an SMT Solver

Tiark Rompf, Nada Amin

Satisfiability modulo theories (SMT) solvers that support quantifier instantiations via matching triggers can be programmed to give practical support for user-defined theories. Care must be taken to avoid so-called matching loops, which may prevent termina ...

2014

On Leveraging Crowdsourcing Techniques for Schema Matching Networks

Karl Aberer, Quoc Viet Hung Nguyen, Thành Tâm Nguyên, Zoltán Miklós

As the volumes of shared datasets are likely to soar, there is high demand of establishing the interlinking between these public datasets. To achieve this, we need to match their schemas altogether. Moreover, to extract useful pieces of information, ones m ...

2013

What are the Odds? Probabilistic programming in Scala

Tiark Rompf, Nada Amin, Sandro Stucki, Manohar Jonnalagedda

Probabilistic programming is a powerful high-level paradigm for probabilistic modeling and inference. We present Odds, a small domain-specific language (DSL) for probabilistic programming, embedded in Scala. Odds provides first-class support for random var ...

ACM2013

Integration of Correct-by-Construction BIP Models into the MetroII Design Space Exploration Flow

Alena Simalatsar

Design correctness and performance are major issues which are usually considered separately, and with different emphasis, by traditional system design flows. In this paper we show that one can meaningfully connect and benefit from the advantages of two des ...

IEEE2012

JavaScript as an Embedded DSL

Martin Odersky, Tiark Rompf, Nada Amin, Grzegorz Kossakowski

Developing rich web applications requires mastering different environments on the client and server sides. While there is considerable choice on the server-side, the client-side is tied to JavaScript, which poses substantial software engineering challenges ...

Springer Berlin Heidelberg2012

Quantitative Analysis for Authentication of Low-cost RFID Tags

Ioannis Paparrizos

Formal analysis techniques are widely used today in order to verify and analyze communication protocols. In this work, we launch a quantitative analysis for the low-cost Radio Frequency Identification (RFID) protocol proposed by Song and Mitchell. The anal ...

Ieee Computer Soc Press, Customer Service Center, Po Box 3014, 10662 Los Vaqueros Circle, Los Alamitos, Ca 90720-1264 Usa2011