Shape Refinement through Explicit Heap Analysis

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.

Modern biology rapidly generates a wealth of data,which can only be analysed computationally.Despite the variety of available data types,most of them aim to provide an answer to one question: how does genotypic diversity translates into phenotypes? This qu ...

New types of metamaterials and architectured material require metallic materials with precise structural design in the microscale. However, additivemanufacturing of metallic structures in themicroscale has proven difficult, as the demand for the material q ...

Methods of topological data analysis have been successfully applied in a wide range of fields to provide useful summaries of the structure of complex data sets in terms of topological descriptors, such as persistence diagrams. While there are many powerful ...

This book defines and explores the problem of placing the instances of dynamic data types on the components of the heterogeneous memory organization of an embedded system, with the final goal of reducing energy consumption and improving performance. It is ...

Deletion is a core facet of Online Social Networks (OSNs). For users, deletion is a tool to remove what they have shared and control their data. For OSNs, robust deletion is both an obligation to their users and a risk when developer mistakes inevitably oc ...

In recent years, Boolean methods in logic synthesis have been drawing the attention of EDA researchers due to the continuous push to advance quality of results. Boolean methods require high computational cost, as they rely on complete functional properties ...

Gyrokinetic codes in plasma physics need outstanding computational resources to solve increasingly complex problems, requiring the effective exploitation of cutting-edge HPC architectures. This paper focuses on the enabling of ORB5, a state-of-the-art, fir ...

Synthesis from examples enables non-expert users to generate programs by specifying examples of their behavior. A domain-specific form of such synthesis has been recently deployed in a widely used spreadsheet software product. In this paper we contribute t ...

This paper presents a publicly available toolkit and a benchmark suite for rigorous verification of Integer Numerical Transition Systems (INTS), which can be viewed as control-flow graphs whose edges are annotated by Presburger arithmetic formulas. We pres ...

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 ...

Shape Refinement through Explicit Heap Analysis

Chat with Graph Search

Multi-omics reveals abundant mitochondrial genomic and circadian expression variation in the Drosophila Genetic Reference Panel

Template-assisted electrodeposition of nickel and nickel copper 3D microcomponents

From Trees to Barcodes and Back Again: Theoretical and Statistical Perspectives

Heterogeneous Memory Organizations in Embedded Systems. Placement of Dynamic Data Objects

DELF: Safeguarding deletion correctness in Online Social Networks

Extending Boolean Methods for Scalable Logic Synthesis

Gyrokinetic simulations on many- and multi-core architectures with the global electromagnetic Particle-In-Cell Code ORB5

Proactive Synthesis of Recursive Tree-to-String Functions from Examples

A Verification Toolkit for Numerical Transition Systems

Constraint Solving for Software Reliability and Text Analysis