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”

Synthesiz3 This: an SMT-BasedApproachfor Synthesis with Uncomputable Symbols

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21730%2F25%3A00388693" target="_blank" >RIV/68407700:21730/25:00388693 - isvavai.cz</a>

  • Result on the web

    <a href="https://doi.org/10.34727/2025/isbn.978-3-85448-084-6_28" target="_blank" >https://doi.org/10.34727/2025/isbn.978-3-85448-084-6_28</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.34727/2025/isbn.978-3-85448-084-6_28" target="_blank" >10.34727/2025/isbn.978-3-85448-084-6_28</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Synthesiz3 This: an SMT-BasedApproachfor Synthesis with Uncomputable Symbols

  • Original language description

    Program synthesis isthe taskofautomaticallycon structing aprogram conforming toagivenspecification. In this paper we focus on synthesis of single-invocation recursion-free functions conformingtoaspecificationgivenasalogical formula in the presence of uncomputablesymbols (i.e., symbols used in the specification butnot allowed inthe resulting function). We approach the problemvia SMT-solving methods: we present a quantifier eliminationalgorithm using model-basedprojections for both total and partial function synthesis, working with theories of uninterpreted functions and linear arithmetic and their combination. Forthispurpose we also extend model-based projection to produce witnesses for these theories. Further,we present procedures tailoredfor thecase of uniquely determined solutions. We implementedaprototype of the algorithms using the SMT-solver Z3, demonstrating their practical efficiency compared to the state of the art.

  • 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/EH22_008%2F0004590" target="_blank" >EH22_008/0004590: Robotics and advanced industrial production</a><br>

  • Continuities

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

Others

  • Publication year

    2025

  • 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 25TH CONFERENCE ON FORMAL METHODS IN COMPUTER-AIDED DESIGN – FMCAD 2025

  • ISBN

    978-3-85448-084-6

  • ISSN

    2708-7824

  • e-ISSN

    2708-7824

  • Number of pages

    11

  • Pages from-to

    215-225

  • Publisher name

    TU Wien

  • Place of publication

    Wien

  • Event location

    Menlo Park, CA

  • Event date

    Oct 6, 2025

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article