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”

On Interpolants and Variable Assignments

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F14%3A10281323" target="_blank" >RIV/00216208:11320/14:10281323 - isvavai.cz</a>

  • Result on the web

    <a href="http://www.cs.utexas.edu/users/hunt/FMCAD/FMCAD14/proceedings/22_jancik.pdf" target="_blank" >http://www.cs.utexas.edu/users/hunt/FMCAD/FMCAD14/proceedings/22_jancik.pdf</a>

  • DOI - Digital Object Identifier

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

Alternative languages

  • Result language

    angličtina

  • Original language name

    On Interpolants and Variable Assignments

  • Original language description

    Craig interpolants are widely used in program verification as a means of abstraction. In this paper, we (i) introduce Partial Variable Assignment Interpolants (PVAIs) as a generalization of Craig interpolants. A variable assignment focuses computed interpolants by restricting the set of clauses taken into account during interpolation. PVAIs can be for example employed in the context of DAG interpolation, in order to prevent unwanted out-of-scope variables to appear in interpolants. Furthermore, we (ii)present a way to compute PVAIs for propositional logic based on an extension of the Labeled Interpolation Systems, and (iii) analyze the strength of computed interpolants and prove the conditions under which they have the path interpolation property.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • Project

    <a href="/en/project/GA14-11384S" target="_blank" >GA14-11384S: Automatic Formal Analysis and Verification of Programs with Complex Unbounded Data and Control Structures</a><br>

  • Continuities

    S - Specificky vyzkum na vysokych skolach

Others

  • Publication year

    2014

  • 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 14th Conference on Formal Methods in Computer-Aided Design (FMCAD 2014)

  • ISBN

    978-0-9835678-4-4

  • ISSN

  • e-ISSN

  • Number of pages

    8

  • Pages from-to

    123-130

  • Publisher name

    Neuveden

  • Place of publication

    Lausanne, Švýcarsko

  • Event location

    Lausanne

  • Event date

    Oct 21, 2014

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article