Publication

DatAFLow: Toward a Data-Flow-Guided Fuzzer

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

Publications associées à DatAFLow: Toward a Data-Flow-Guided Fuzzer | EPFL Graph Search

Trading Strategy: A Case Study on the Day-Ahead and Week-Ahead Electricity Prices

The study consists of two interrelated parts. In the first part, we aim to identify the best predictive model of day-ahead electricity prices. In particular, we verify the existence of a dependence of the spot price on power generation and variable costs o ...

2018

Coordinate Descent with Bandit Sampling

Patrick Thiran, Laura Elisa Celis, Farnood Salehi

Coordinate descent methods usually minimize a cost function by updating a random decision variable (corresponding to one coordinate) at a time. Ideally, we would update the decision variable that yields the largest decrease in the cost function. However, f ...

NEURAL INFORMATION PROCESSING SYSTEMS (NIPS)2018

From Infinite to Finite Programs: Explicit Error Bounds with Applications to Approximate Dynamic Programming

Daniel Kuhn, John Lygeros, Peyman Mohajerin Esfahani, Tobias Sutter

We consider linear programming (LP) problems in infinite dimensional spaces that are in general computationally intractable. Under suitable assumptions, we develop an approximation bridge from the infinite-dimensional LP to tractable finite convex programs ...

2018

PBCOV: a property-based coverage criterion

Hamza Harkous, Kassem Fawaz

Coverage criteria aim at satisfying test requirements and compute metrics values that quantify the adequacy of test suites at revealing defects in programs. Typically, a test requirement is a structural program element, and the coverage metric value repres ...

Springer2015

Systematically testing OpenFlow controller applications

Dejan Kostic, Marco Canini, Peter Peresini, Maciej Leszek Kuzniar, Jennifer Rexford

The emergence of OpenFlow-capable switches enables exciting new network functionality, at the risk of programming errors that make communication less reliable. The centralized programming model, where a single controller program manages the network, seems ...

Elsevier Science Bv2015

The economic performance of Swiss drinking water utilities

Andrea Baranzini, Anne-Kathrin Faust

This paper measures the performance in terms of costs of Swiss drinking water utilities accounting for environmental factors. We estimate a translog stochastic variable cost frontier using two different techniques on an unbalanced panel of 141 water distri ...

Springer Verlag2014

Verification of Imperative Programs in Scala

Régis William Blanc

Safety-critical software systems can only support a limited number of failures. Extensive testing is good at catching errors, however that will never certify their absence. Formal verification is an alternative to testing that can (automatically) provide a ...

2012

Alternating Control Flow Reconstruction

Johannes Kinder

Unresolved indirect branch instructions are a major obstacle for statically reconstructing a control flow graph (CFG) from machine code. If static analysis cannot compute a precise set of possible targets for a branch, the necessary conservative over-appro ...

Springer2012

A NICE Way to Test OpenFlow Applications

Dejan Kostic, Marco Canini, Peter Peresini, Jennifer Rexford

2012

Static Analysis of x86 Executables

Johannes Kinder

This dissertation is concerned with static analysis of binary executables in a theoretically well-founded, sound, yet practical way. The major challenge is the reconstruction of a correct control flow graph in presence of indirect jumps, pointer arithmetic ...

Technische Universität Darmstadt2010