One-sorted Program Algebras

One-sorted Program Algebras

Kleene algebra with tests, KAT, provides a simple two-sorted algebraic framework for verifying properties of propositional while programs. Kleene algebra with domain, KAD, is a one-sorted alternative to KAT. The equational theory of KAT embeds into KAD, but KAD lacks some natural properties of KAT....

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Sedlár, Igor, Wannenburg, Johann J
Format: Artikel
Sprache:eng
Schlagworte:
Computer Science - Formal Languages and Automata Theory
Computer Science - Logic in Computer Science
Computer Science - Programming Languages
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Sedlár, Igor
Wannenburg, Johann J
description Kleene algebra with tests, KAT, provides a simple two-sorted algebraic framework for verifying properties of propositional while programs. Kleene algebra with domain, KAD, is a one-sorted alternative to KAT. The equational theory of KAT embeds into KAD, but KAD lacks some natural properties of KAT. For instance, not each Kleene algebra expands to a KAD, and the subalgebra of tests in each KAD is forced to be the maximal Boolean subalgebra of the negative cone. In this paper we propose a generalization of KAD that avoids these features while still embedding the equational theory of KAT. We show that several natural properties of the domain operator of KAD can be added to the generalized framework without affecting the results. We consider a variant of the framework where test complementation is defined using a residual of the Kleene algebra multiplication.
doi_str_mv 10.48550/arxiv.2205.03311
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2205_03311</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2205_03311</sourcerecordid><originalsourceid>FETCH-LOGICAL-a671-5c1495bb32037cd25dd8a4403cdae3e470ea35918de3d661093392dbd0f9a9c03</originalsourceid><addsrcrecordid>eNotzrsKwjAUgOEsDqI-gDjYF2g9yUnaZhTxBkIdupeTnlgK9UIqom8vXqZ_-_mEmEpIdG4MLCg820eiFJgEEKUcillx8XF_DXfP0TFcm0DnaNk13gXqx2Jwoq73k39Hotysy9UuPhTb_Wp5iCnNZGxqqa1xDhVgVrMyzDlpDVgzefQ6A09orMzZI6epBItoFTuGkyVbA47E_Lf96qpbaM8UXtVHWX2V-AYPrTWN</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>One-sorted Program Algebras</title><source>arXiv.org</source><creator>Sedlár, Igor ; Wannenburg, Johann J</creator><creatorcontrib>Sedlár, Igor ; Wannenburg, Johann J</creatorcontrib><description>Kleene algebra with tests, KAT, provides a simple two-sorted algebraic framework for verifying properties of propositional while programs. Kleene algebra with domain, KAD, is a one-sorted alternative to KAT. The equational theory of KAT embeds into KAD, but KAD lacks some natural properties of KAT. For instance, not each Kleene algebra expands to a KAD, and the subalgebra of tests in each KAD is forced to be the maximal Boolean subalgebra of the negative cone. In this paper we propose a generalization of KAD that avoids these features while still embedding the equational theory of KAT. We show that several natural properties of the domain operator of KAD can be added to the generalized framework without affecting the results. We consider a variant of the framework where test complementation is defined using a residual of the Kleene algebra multiplication.</description><identifier>DOI: 10.48550/arxiv.2205.03311</identifier><language>eng</language><subject>Computer Science - Formal Languages and Automata Theory ; Computer Science - Logic in Computer Science ; Computer Science - Programming Languages</subject><creationdate>2022-05</creationdate><rights>http://creativecommons.org/licenses/by/4.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,776,881</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2205.03311$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2205.03311$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Sedlár, Igor</creatorcontrib><creatorcontrib>Wannenburg, Johann J</creatorcontrib><title>One-sorted Program Algebras</title><description>Kleene algebra with tests, KAT, provides a simple two-sorted algebraic framework for verifying properties of propositional while programs. Kleene algebra with domain, KAD, is a one-sorted alternative to KAT. The equational theory of KAT embeds into KAD, but KAD lacks some natural properties of KAT. For instance, not each Kleene algebra expands to a KAD, and the subalgebra of tests in each KAD is forced to be the maximal Boolean subalgebra of the negative cone. In this paper we propose a generalization of KAD that avoids these features while still embedding the equational theory of KAT. We show that several natural properties of the domain operator of KAD can be added to the generalized framework without affecting the results. We consider a variant of the framework where test complementation is defined using a residual of the Kleene algebra multiplication.</description><subject>Computer Science - Formal Languages and Automata Theory</subject><subject>Computer Science - Logic in Computer Science</subject><subject>Computer Science - Programming Languages</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2022</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotzrsKwjAUgOEsDqI-gDjYF2g9yUnaZhTxBkIdupeTnlgK9UIqom8vXqZ_-_mEmEpIdG4MLCg820eiFJgEEKUcillx8XF_DXfP0TFcm0DnaNk13gXqx2Jwoq73k39Hotysy9UuPhTb_Wp5iCnNZGxqqa1xDhVgVrMyzDlpDVgzefQ6A09orMzZI6epBItoFTuGkyVbA47E_Lf96qpbaM8UXtVHWX2V-AYPrTWN</recordid><startdate>20220506</startdate><enddate>20220506</enddate><creator>Sedlár, Igor</creator><creator>Wannenburg, Johann J</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20220506</creationdate><title>One-sorted Program Algebras</title><author>Sedlár, Igor ; Wannenburg, Johann J</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a671-5c1495bb32037cd25dd8a4403cdae3e470ea35918de3d661093392dbd0f9a9c03</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2022</creationdate><topic>Computer Science - Formal Languages and Automata Theory</topic><topic>Computer Science - Logic in Computer Science</topic><topic>Computer Science - Programming Languages</topic><toplevel>online_resources</toplevel><creatorcontrib>Sedlár, Igor</creatorcontrib><creatorcontrib>Wannenburg, Johann J</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Sedlár, Igor</au><au>Wannenburg, Johann J</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>One-sorted Program Algebras</atitle><date>2022-05-06</date><risdate>2022</risdate><abstract>Kleene algebra with tests, KAT, provides a simple two-sorted algebraic framework for verifying properties of propositional while programs. Kleene algebra with domain, KAD, is a one-sorted alternative to KAT. The equational theory of KAT embeds into KAD, but KAD lacks some natural properties of KAT. For instance, not each Kleene algebra expands to a KAD, and the subalgebra of tests in each KAD is forced to be the maximal Boolean subalgebra of the negative cone. In this paper we propose a generalization of KAD that avoids these features while still embedding the equational theory of KAT. We show that several natural properties of the domain operator of KAD can be added to the generalized framework without affecting the results. We consider a variant of the framework where test complementation is defined using a residual of the Kleene algebra multiplication.</abstract><doi>10.48550/arxiv.2205.03311</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.2205.03311
ispartof
issn
language eng
recordid cdi_arxiv_primary_2205_03311
source arXiv.org
subjects Computer Science - Formal Languages and Automata Theory
Computer Science - Logic in Computer Science
Computer Science - Programming Languages
title One-sorted Program Algebras
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-29T23%3A06%3A08IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=One-sorted%20Program%20Algebras&rft.au=Sedl%C3%A1r,%20Igor&rft.date=2022-05-06&rft_id=info:doi/10.48550/arxiv.2205.03311&rft_dat=%3Carxiv_GOX%3E2205_03311%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true