Concept

Data-flow analysis

Publications associées (66)

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

Generation of Hardware/Software Systems Based on CAL Dataflow Description

Marco Mattavelli, Romuald Mosqueron, Richard Thavot, Julien Dubois

This chapter presents a new development of rapid prototyping tools for system design based on data-flow specifications. In this context, the efficiency of tools for the automatic translation from the data-flow programs to C and/or HDL are assessed by means ...

Springer2010

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

Disaggregate path flow estimation in an iterated DTA microsimulation

Gunnar Flötteröd

This text describes the first application of a novel path flow and origin/destination (OD) matrix estimator for iterated dynamic traffic assignment (DTA) microsimulations. The presented approach, which operates on a trip-based demand representation, is der ...

2010

An Abstract Interpretation-Based Framework for Control Flow Reconstruction from Binaries

Johannes Kinder

Due to indirect branch instructions, analyses on executables commonly suffer from the problem that a complete control flow graph of the program is not available. Data flow analysis has been proposed before to statically determine branch targets in many cas ...

Springer2009

A co-design platform for Algorithm/Architecture design exploration

Marco Mattavelli, Christophe Lucarz, Julien Dubois

The efﬁcient implementation of multimedia algorithms, for the ever increasing complexity of the speciﬁcations and the emergence of the new generation of processing platforms characterized by multicore and multicomponent parallel architectures, requires app ...

IEEE2008

Constraint Solving for Software Reliability and Text Analysis

Viktor Kuncak

We will develop and implement new algorithms for constraint solving and apply them to construct two classes of tools: 1) bug finding and verification tools building on tools such as Java PathFinder and Jahob; 2) tools for deep semantic analysis of texts co ...

2008

Path invariants

Dirk Thilo Beyer

The success of software verification depends on the ability to find a suitable abstraction of a program automatically. We propose a method for automated abstraction refinement which overcomes some limitations of current predicate discovery schemes. In curr ...

2007

Power Quality Problems Compensation With Universal Power Quality Conditioning System

Alfred Rufer

The aim of this paper is to present a universal power quality conditioning system (UPQS) named after unified power quality conditioner, which is extended by adding a shunt active filter at the load side. Its main purpose is to compensate for both supply vo ...

2007

Path Invariants

Dirk Thilo Beyer, Andrey Rybalchenko

The success of software verification depends on the ability to find a suitable abstraction of a program automatically. We propose a new method for automated abstraction refinement, which overcomes the inherent limitations of predicate discovery schemes. In ...

2006

Inviscid Vortex Breakdown in Decelerated Swirling Flows and Flow Control Methods

François Avellan, Vlad Hasmatuchi

The paper is focused on decelerated swirling flow behavior as the upstream swirl intensity is increased. We define simplified flow model and boundary conditions in order to analyze the basic flow features. Numerical experiments are carried out for incompre ...

2006