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”

Towards Efficient Shape Analysis with Tree Automata

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F21%3APU143336" target="_blank" >RIV/00216305:26230/21:PU143336 - isvavai.cz</a>

  • Result on the web

    <a href="https://www.fit.vut.cz/research/publication/12668/" target="_blank" >https://www.fit.vut.cz/research/publication/12668/</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/978-3-030-91014-3_14" target="_blank" >10.1007/978-3-030-91014-3_14</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Towards Efficient Shape Analysis with Tree Automata

  • Original language description

    We discuss our proposal of a formalism for representing classes of graphs based on tree automata. We aim at a formalism and an entailment algorithm that could be used in verification of pointer programs, that would be efficient, have well defined completeness guarantees, and be general. We believe that building the formalism on top of tree automata will make it possible to use existing advanced tree automata implementation techniques. We sketch the basic ideas behind the formalism and an entailment decision procedure, and outline some related research challenges.

  • 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

    <a href="/en/project/GA19-24397S" target="_blank" >GA19-24397S: Automata for Decision Procedures and Verification</a><br>

  • Continuities

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

Others

  • Publication year

    2021

  • 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 International Conference on Networked Systems

  • ISBN

  • ISSN

    0302-9743

  • e-ISSN

  • Number of pages

    9

  • Pages from-to

    206-214

  • Publisher name

    Springer Verlag

  • Place of publication

    Cham

  • Event location

    Virtual Conference

  • Event date

    May 19, 2021

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article

    000891773700014