Concept

Logic programming

Related publications (114)

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.

Optimization of Portable Parallel Signal Processing Applications by Design Space Exploration of Dataflow Programs

Marco Mattavelli, Christophe Lucarz

This paper describes a methodology for the optimization of portable parallel signal processing applications specified by dataflow programs. The use of dataflow as a programming model for signal processing applications targeting parallel platforms provides ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2011

Programming the Cloud

James Richard Larus

Client + cloud computing is a disruptive, new computing platform, combining diverse client devices -- PCs, smartphones, sensors, and single-function and embedded devices -- with the unlimited, on-demand computation and data storage offered by cloud computi ...

ACM2011

Power-gated MOS current mode logic (PG-MCML): a power aware DPA-resistant standard cell library

Paolo Ienne, Francesco Regazzoni, Yusuf Leblebici, Stéphane Badel

MOS Current Mode Logic (MCML) is one of the most promising logic style to counteract power analysis attacks. Unfortunately, the static power consumption of MCML standard cells is significantly higher compared to equivalent functions implemented using stati ...

Acm Order Department, P O Box 64145, Baltimore, Md 21264 Usa2011

Strategy logic

We introduce strategy logic, a logic that treats strategies in two-player games as explicit first-order objects. The explicit treatment of strategies allows us to specify properties of nonzero-sum games in a simple and natural way. We show that the one-alt ...

2010

Deprecating the Observer Pattern

Martin Odersky, Tiark Rompf, Ingo Maier

Programming interactive systems by means of the observer pattern is hard and error-prone yet is still the implementation standard in many production environments. We present an approach to gradually deprecate observers in favor of reactive programming abst ...

2010

Exploring Programming Model-driven QoS Support for NoC-based Platforms

Giovanni De Micheli, Luca Benini, Federico Angiolini, Jaime Joven Murillo

Networks-on-Chip (NoCs) are being increasingly considered as a central enabling technology to communication-centric designs as more and more IP blocks are integrated on the same SoC. Embedded applications, in turn, are becoming extremely sophisticated, and ...

2010

Approximate Confidence Computation in Probabilistic Databases.

Christoph Koch

This paper introduces a deterministic approximation algorithm with error guarantees for computing the probability of propositional formulas over discrete random variables. The algorithm is based on an incremental compilation of formulas into decision diagr ...

2010

Reﬂexes: Abstractions for Integrating Highly Responsive Tasks into Java Applications

Rachid Guerraoui, Jesper Honig Spring

Achieving submillisecond response times in a managed language environment such as Java or C# requires overcoming signiﬁcant challenges. In this article, we propose Reﬂexes, a programming model and runtime system infrastructure that lets developers seamless ...

2010

Programming with Undo

Ersoy Bayramoglu

This thesis is about objects that can undo their state changes. Based on an earlier work on data structure persistence, we propose generating undo methods for classes from annotated classes automatically. As opposed to ephemeral data structures, persistent ...

2009

Simplifying Distributed System Development

Viktor Kuncak, Dejan Kostic, Maysam Yabandeh, Nedeljko Vasic

Distributed systems are difficult to design and develop. The difficulties arise both in basic safety correctness properties, and in achieving high performance. As a result of this complexity, the implementation of a distributed system often contains the ba ...

2009