From Shapes to Amortized Complexity

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F18%3APU126461" target="_blank" >RIV/00216305:26230/18:PU126461 - isvavai.cz</a>

Result on the web

<a href="https://link.springer.com/chapter/10.1007%2F978-3-319-73721-8_10" target="_blank" >https://link.springer.com/chapter/10.1007%2F978-3-319-73721-8_10</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/978-3-319-73721-8_10" target="_blank" >10.1007/978-3-319-73721-8_10</a>

Result language

angličtina

Original language name

From Shapes to Amortized Complexity

Original language description

We propose a new method for the automated resource bound analysis of programs manipulating dynamic data structures built on top of an underlying shape and resource bound analysis. Our approach first constructs an integer abstraction for the input program using information gathered by a shape analyser; then a resource bound analyzer is run on the resulting integer program. The integer abstraction is based on shape norms-numerical measures on dynamic data structures (e.g., the length of a linked list). In comparison to related approaches, we consider a larger class of shape norms which we derive by a lightweight program analysis. The analysis identifies paths through the involved dynamic data structures, and filters the norms which are unlikely to be useful for the later bound analysis. We present a calculus for deriving the numeric changes of the shape norms, thereby generating the integer program. Our calculus encapsulates the minimal information which is required from the shape analysis. We have implemented our approach on top of the Forester shape analyser and evaluated it on a number of programs manipulating various list and tree structures using the Loopus tool as the underlying bounds analyser. We report on programs with complex data structures and/or using complex algorithms that could not be analysed in a fully automated and precise way before.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

—

OECD FORD branch

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project

Result was created during the realization of more than one project. More information in the Projects tab.

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year

2018

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection

Proceedings of VMCAI'18

ISBN

978-3-319-73720-1

ISSN

0302-9743

e-ISSN

—

Number of pages

21

Pages from-to

205-225

Publisher name

Springer Verlag

Place of publication

Heidelberg

Event location

Los Angeles

Event date

Jan 7, 2018

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

000542031000010