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”

Compositional Entailment Checking for a Fragment of Separation Logic

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F17%3APU126445" target="_blank" >RIV/00216305:26230/17:PU126445 - isvavai.cz</a>

  • Result on the web

    <a href="http://www.fit.vutbr.cz/research/pubs/all.php?id=11504" target="_blank" >http://www.fit.vutbr.cz/research/pubs/all.php?id=11504</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/s10703-017-0289-4" target="_blank" >10.1007/s10703-017-0289-4</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Compositional Entailment Checking for a Fragment of Separation Logic

  • Original language description

    We present a decision procedure for checking entailment between separation logic formulas with inductive predicates specifying complex data structures corresponding to finite nesting of various kinds of singly linked lists: acyclic or cyclic, nested lists, skip lists, etc. The decision procedure is compositional in the sense that it reduces the problem of checking entailment between two arbitrary formulas to the problem of checking entailment between a formula and an atom. Subsequently, in case the atom is a predicate, we reduce the entailment to testing membership of a tree derived from the formula in the language of a tree automaton derived from the predicate. The procedure is later also extended to doubly linked lists. We implemented this decision procedure and tested it successfully on verification conditions obtained from programs using both singly and doubly linked nested lists as well as skip lists.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database

  • 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

    2017

  • 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

  • Name of the periodical

    FORMAL METHODS IN SYSTEM DESIGN

  • ISSN

    0925-9856

  • e-ISSN

    1572-8102

  • Volume of the periodical

    2017

  • Issue of the periodical within the volume

    51

  • Country of publishing house

    US - UNITED STATES

  • Number of pages

    33

  • Pages from-to

    575-607

  • UT code for WoS article

    000416332700007

  • EID of the result in the Scopus database

    2-s2.0-85026808268