All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Template-Based Verification of Heap-Manipulating Programs

The result's identifiers

  • Result code in IS VaVaI

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

  • Result on the web

    <a href="https://www.cs.utexas.edu/users/hunt/FMCAD/FMCAD18/fmcad2018_proceedings.pdf" target="_blank" >https://www.cs.utexas.edu/users/hunt/FMCAD/FMCAD18/fmcad2018_proceedings.pdf</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.23919/FMCAD.2018.8603009" target="_blank" >10.23919/FMCAD.2018.8603009</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Template-Based Verification of Heap-Manipulating Programs

  • Original language description

    We propose a  shape analysis suitable for analysis engines that perform automatic invariant inference using an SMT solver. The proposed solution includes an abstract template domain that encodes the shape of the program heap based on logical formulae over bit-vectors. It is based on computing a  points-to relation between pointers and symbolic addresses of abstract memory objects. Our abstract heap domain can be combined with value domains in a straightforward manner, which particularly allows us to reason about shapes and contents of heap structures at the same time. The information obtained from the analysis can be used to prove memory safety and reachability properties, expressed by user assertions, of programs manipulating dynamic data structures, mainly linked lists. The solution has been implemented in the 2LS framework and compared against state-of-the-art tools that perform the best in heap-related categories of the well-known Software Verification Competition (SV-COMP). Results show that 2LS outperforms these tools on benchmarks requiring combined reasoning about unbounded data structures and their numerical contents.

  • Czech name

  • Czech description

Classification

  • 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)

Result continuities

  • 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)

Others

  • Publication year

    2018

  • Confidentiality

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

Data specific for result type

  • Article name in the collection

    Proceedings of the 18th Conference on Formal Methods in Computer-Aided Design

  • ISBN

    978-0-9835678-8-2

  • ISSN

  • e-ISSN

  • Number of pages

    9

  • Pages from-to

    103-111

  • Publisher name

    FMCAD Inc.

  • Place of publication

    Austin

  • Event location

    Austin, Texas

  • Event date

    Oct 30, 2018

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article

    000493916300018