Kleene Algebra With Tests for Weighted Programs

Kód výsledku v 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>

Výsledek na webu

<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>

Jazyk výsledku

angličtina

Název v původním jazyce

Kleene Algebra With Tests for Weighted Programs

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

Kleene Algebra With Tests for Weighted Programs

Popis výsledku anglicky

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.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

<a href="/cs/project/GA22-16111S" target="_blank" >GA22-16111S: GRADLACT: Stupňované logiky konání</a><br>

Návaznosti

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2023

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

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

ISBN

978-1-6654-6416-1

ISSN

2378-2226

e-ISSN

—

Počet stran výsledku

6

Strana od-do

111-116

Název nakladatele

IEEE

Místo vydání

Piscataway

Místo konání akce

Matsue

Datum konání akce

22. 5. 2023

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—