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”

Kleene Algebra With Tests for Weighted Programs

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F23%3A00574179" target="_blank" >RIV/67985807:_____/23:00574179 - isvavai.cz</a>

  • Result on the web

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

  • DOI - Digital Object Identifier

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

Alternative languages

  • Result language

    angličtina

  • Original language name

    Kleene Algebra With Tests for Weighted Programs

  • Original language description

    Weighted programs generalize probabilistic programs and offer a framework for specifying and encoding mathematical models by means of an algorithmic representation. Kleene algebra with tests is an algebraic formalism based on regular expressions with applications in proving program equivalence. We extend the language of Kleene algebra with tests so that it is sufficient to formalize reasoning about a simplified version weighted programs. We introduce relational semantics for the extended language, and we generalize the relational semantics to an appropriate extension of Kleene algebra with tests, called Kleene algebra with weights and tests. We demonstrate by means of an example that Kleene algebra with weights and tests offers a simple algebraic framework for reasoning about equivalence and optimal runs of weighted programs.

  • 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/GA22-16111S" target="_blank" >GA22-16111S: GRADLACT: Graded Logics of Action</a><br>

  • Continuities

    I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Others

  • Publication year

    2023

  • 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

    2023 IEEE 53rd International Symposium on Multiple-Valued Logic (ISMVL). Proceedings

  • ISBN

    978-1-6654-6416-1

  • ISSN

    2378-2226

  • e-ISSN

  • Number of pages

    6

  • Pages from-to

    111-116

  • Publisher name

    IEEE

  • Place of publication

    Piscataway

  • Event location

    Matsue

  • Event date

    May 22, 2023

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article