Publication

Restructuring Symbolic Programs for Concurrent Execution on Multiprocessors

Related publications (35)

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.

Runtime Instrumentation for Precise Flow-Sensitive Type Analysis

Viktor Kuncak, Etienne Kneuss, Philippe Paul Henri Suter

We describe a combination of runtime information and static analysis for checking properties of complex and configurable systems. The basic idea of our approach is to 1) let the program execute and thereby read the important dynamic configuration data, the ...

2010

Source-to-source architecture transformation for performance optimization in BIP

Joseph Sifakis

Behavior, Interaction, Priorities (BIP) is a component framework for constructing systems from a set of atomic components by using two kinds of composition operators: interactions and priorities. In this paper, we present a method that transforms the inter ...

2010

Pedestrian localization, tracking and behavior analysis from multiple cameras

Jérôme Berclaz

Video surveillance is currently undergoing a rapid growth. However, while thousands of cameras are being installed in public places all over the world, computer programs that could reliably detect and track people in order to analyze their behavior are not ...

EPFL2010

ABC: Algebraic Bound Computation for Loops

Régis William Blanc, Laura Ildiko Kovacs, Thibaud Hottelier

We present ABC, a software tool for automatically computing symbolic upper bounds on the number of iterations of nested program loops. The system combines static analysis of programs with symbolic summation techniques to derive loop invariant relations bet ...

Springer Berlin Heidelberg2010

Source-to-source architecture transformation for performance optimization in BIP

Joseph Sifakis

BIP (Behavior, Interaction, Priorities) is a component framework for constructing systems from a set of atomic components by using two kinds of composition operators: interactions and priorities.In this paper we present a method that transforms the interac ...

2009

Opis: Reliable Distributed Systems in OCaml

Viktor Kuncak, Dejan Kostic, Pierre-Evariste Dagand

Concurrency and distribution pose algorithmic and implementation challenges in developing reliable distributed systems, making the field an excellent testbed for evaluating programming language and verification paradigms. Several specialized domain-specifi ...

2009

Opis: Reliable Distributed Systems in OCaml

Viktor Kuncak, Dejan Kostic, Pierre-Evariste Dagand

2009

Uncertainty Feature Optimization for the Airline Scheduling Problem

Matteo Salani, Niklaus Eggenberg

Uncertainty Feature Optimization is a framework to cope with optimization problems due to noisy data, using an implicit characterazation of the noise. The Aircraft Scheduling Problem (ASP) is a particular case of such problems, where disruptions randomly p ...

2009

Using Paths to Measure, Explain, and Enhance Program Behavior

James Richard Larus

What happens when a computer program runs? The answer can be frustratingly elusive, as anyone who has debugged or tuned a program knows. As it runs, a program overwrites its previous state, which might have provided a clue as to how the program got to the ...

IEEE2000

Whole Program Paths

James Richard Larus

Whole program paths (WPP) are a new approach to capturing and representing a program's dynamic---actually executed---control flow. Unlike other path profiling techniques, which record intraprocedural or acyclic paths, WPPs produce a single, compact descrip ...

ACM1999