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”

Trau: SMT solver for string constraints

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F19%3APU130814" target="_blank" >RIV/00216305:26230/19:PU130814 - 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.8602997" target="_blank" >10.23919/FMCAD.2018.8602997</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Trau: SMT solver for string constraints

  • Original language description

    We introduce TRAU, an SMT solver for an expressive constraint language, including word equations, length constraints, context-free membership queries, and transducer constraints. The satisfiability problem for such a class of constraints is in general undecidable. The key idea behind TRAU is a technique called flattening, which searches for satisfying assignments that follow simple patterns. TRAU implements a Counter-Example Guided Abstraction Refinement (CEGAR) framework which contains both an under- and an over-approximation module. The approximations are refined in an automatic manner by information flow between the two modules. The technique implemented by TRAU can handle a rich class of string constraints and has better performance than state-of-the-art string solvers.

  • 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

    2019

  • 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

    5

  • Pages from-to

    165-169

  • 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

    000493916300025