Publication

Effect Analysis for Programs with Callbacks

Related publications (42)

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.

Approximations for Stochastic Graph Rewriting

Sandro Stucki

In this note we present a method to compute approximate descriptions of a class of stochastic systems. For the method to apply, the system must be presented as a Markov chain on a state space consisting in graphs or graph-like objects, and jumps must be de ...

Springer International Publishing2014

On Effect Analysis for Programs with Callbacks

Viktor Kuncak, Etienne Kneuss, Philippe Paul Henri Suter

We introduce a precise interprocedural effect analysis for programs with mutable state, dynamic object allocation, and dynamic dispatch. Our analysis is precise even in the presence of dynamic dispatch where the context-insensitive estimate on the number o ...

2012

Lower bounds on the obstacle number of graphs

János Pach, Doemoetoer Palvoelgyi, Padmini Mukkamala

Given a graph G, an obstacle representation of G is a set of points in the plane representing the vertices of G, together with a set of connected obstacles such that two vertices of G are joined by an edge if and only if the corresponding points can be con ...

2012

Graphs That Admit Polyline Drawings with Few Crossing Angles

Radoslav Fulek

We consider graphs that admit polyline drawings where all crossings occur at the same angle alpha is an element of (0, pi/2]. We prove that every graph on n vertices that admits such a polyline drawing with at most two bends per edge has O(n) edges. This r ...

2012

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

24⨯24⨯24

Exercise The architectonic space is an exercise in architecture. It invites students to follow a particular approach to design that, for pedagogical purposes, limits the number of questions considered, in order to privilege a specific dimension of architec ...

UCLouvain.be2012

Wavelet Frames On Graphs Defined By Fmri Functional Connectivity

Dimitri Nestor Alice Van De Ville, Nora Leonardi

Multiscale representations such as the wavelet transform are useful for many signal processing tasks. Graphs are flexible models to represent complex networks and a spectral graph wavelet transform (SGWT) has recently been developed as a generalization of ...

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

Querypoint Debugging

Claude Petitpierre, Salman Mirghasemi

To fix a bug, software developers have to examine the bug-gy execution to locate defects. They employ different ap-proaches (e.g., setting breakpoints, inserting printing statements in the code) to navigate over buggy execution and inspect program state at ...

2010

Graphs that Admit Right Angle Crossing Drawings

Radoslav Fulek, Balázs Keszegh, Filip Moric

We consider right angle crossing (RAC) drawings of graphs in which the edges are represented by polygonal arcs and any two edges can cross only at a right angle. We show that if a graph with n vertices admits a RAC drawing with at most 1 bend or 2 bends pe ...

2010