{"id":"https://openalex.org/W4318350987","doi":"https://doi.org/10.48550/arxiv.2301.11301","title":"A Complete Inference System for Skip-free Guarded Kleene Algebra with Tests","display_name":"A Complete Inference System for Skip-free Guarded Kleene Algebra with Tests","publication_year":2023,"publication_date":"2023-01-26","ids":{"openalex":"https://openalex.org/W4318350987","doi":"https://doi.org/10.48550/arxiv.2301.11301"},"language":"en","primary_location":{"id":"pmh:oai:dare.uva.nl:openaire/87e4fd5e-be63-496a-93d5-33fc49b85dca","is_oa":true,"landing_page_url":"https://handle.uba.uva.nl/personal/pure/en/publications/a-complete-inference-system-for-skipfree-guarded-kleene-algebra-with-tests(87e4fd5e-be63-496a-93d5-33fc49b85dca).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306400088","display_name":"UvA-DARE (University of Amsterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887064364","host_organization_name":"University of Amsterdam","host_organization_lineage":["https://openalex.org/I887064364"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Schmid, T, Kapp\u00e9, T & Silva, A 2023, A Complete Inference System for Skip-free Guarded Kleene Algebra with Tests. in T Wies (ed.), Programming Languages and Systems : 32nd European Symposium on Programming, ESOP 2023, held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2023, Paris, France, April 22\u201327, 2023 : proceedings. Lecture Notes in Computer Science, vol. 13990, Cham, pp. 309-226, 32nd European Symposium on Programming, Paris, France, 22/04/23. https://doi.org/10.48550/arXiv.2301.11301, https://doi.org/10.1007/978-3-031-30044-8_12","raw_type":"info:eu-repo/semantics/publishedVersion"},"type":"preprint","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://handle.uba.uva.nl/personal/pure/en/publications/a-complete-inference-system-for-skipfree-guarded-kleene-algebra-with-tests(87e4fd5e-be63-496a-93d5-33fc49b85dca).html","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5063583108","display_name":"Tobias Kapp\u00e9","orcid":"https://orcid.org/0000-0002-6068-880X"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Kapp\u00e9, Tobias","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5087089457","display_name":"Todd Schmid","orcid":"https://orcid.org/0000-0002-9838-2363"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Schmid, Todd","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5100658822","display_name":"Alexandra Silva","orcid":"https://orcid.org/0000-0001-5014-9784"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Silva, Alexandra","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5063583108"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9951000213623047,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/kleene-algebra","display_name":"Kleene algebra","score":0.904543399810791},{"id":"https://openalex.org/keywords/kleenes-recursion-theorem","display_name":"Kleene's recursion theorem","score":0.6996225118637085},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.6872379779815674},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.5964305996894836},{"id":"https://openalex.org/keywords/fragment","display_name":"Fragment (logic)","score":0.5118522047996521},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4949318766593933},{"id":"https://openalex.org/keywords/algebraic-number","display_name":"Algebraic number","score":0.479981392621994},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.2619033455848694},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.24635657668113708},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.15528422594070435}],"concepts":[{"id":"https://openalex.org/C206470798","wikidata":"https://www.wikidata.org/wiki/Q2634506","display_name":"Kleene algebra","level":2,"score":0.904543399810791},{"id":"https://openalex.org/C123260079","wikidata":"https://www.wikidata.org/wiki/Q1933521","display_name":"Kleene's recursion theorem","level":2,"score":0.6996225118637085},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.6872379779815674},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.5964305996894836},{"id":"https://openalex.org/C2776235265","wikidata":"https://www.wikidata.org/wiki/Q18392052","display_name":"Fragment (logic)","level":2,"score":0.5118522047996521},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4949318766593933},{"id":"https://openalex.org/C9376300","wikidata":"https://www.wikidata.org/wiki/Q168817","display_name":"Algebraic number","level":2,"score":0.479981392621994},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2619033455848694},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.24635657668113708},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.15528422594070435},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"pmh:oai:dare.uva.nl:openaire/87e4fd5e-be63-496a-93d5-33fc49b85dca","is_oa":true,"landing_page_url":"https://handle.uba.uva.nl/personal/pure/en/publications/a-complete-inference-system-for-skipfree-guarded-kleene-algebra-with-tests(87e4fd5e-be63-496a-93d5-33fc49b85dca).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306400088","display_name":"UvA-DARE (University of Amsterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887064364","host_organization_name":"University of Amsterdam","host_organization_lineage":["https://openalex.org/I887064364"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Schmid, T, Kapp\u00e9, T & Silva, A 2023, A Complete Inference System for Skip-free Guarded Kleene Algebra with Tests. in T Wies (ed.), Programming Languages and Systems : 32nd European Symposium on Programming, ESOP 2023, held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2023, Paris, France, April 22\u201327, 2023 : proceedings. Lecture Notes in Computer Science, vol. 13990, Cham, pp. 309-226, 32nd European Symposium on Programming, Paris, France, 22/04/23. https://doi.org/10.48550/arXiv.2301.11301, https://doi.org/10.1007/978-3-031-30044-8_12","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:arXiv.org:2301.11301","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2301.11301","pdf_url":"https://arxiv.org/pdf/2301.11301","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"pmh:uvapub:oai:dare.uva.nl:publications/87e4fd5e-be63-496a-93d5-33fc49b85dca","is_oa":true,"landing_page_url":"https://dare.uva.nl/personal/pure/en/publications/a-complete-inference-system-for-skipfree-guarded-kleene-algebra-with-tests(87e4fd5e-be63-496a-93d5-33fc49b85dca).html","pdf_url":"https://pure.uva.nl/ws/files/123155096/978_3_031_30044_8_12.pdf","source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Programming Languages and Systems: 32nd European Symposium on Programming, ESOP 2023, held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2023, Paris, France, April 22\u201327, 2023 : proceedings, 309 - 226","raw_type":"info:eu-repo/semantics/conferencepaper"},{"id":"pmh:oai:research.ou.nl:publications/ed1be95d-26f3-4642-bd74-86d7aeab4891","is_oa":true,"landing_page_url":"https://arxiv.org/abs/2301.11301","pdf_url":null,"source":{"id":"https://openalex.org/S4406922485","display_name":"Open University of the Netherlands Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Schmid, T, Kapp\u00e9, T & Silva, A 2023, A Complete Inference System for Skip-free Guarded Kleene Algebra with Tests. in T Wies (ed.), Programming Languages and Systems : 32nd European Symposium on Programming, ESOP 2023, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2023, Paris, France, April 22\u201327, 2023, Proceedings. Springer, Lecture Notes in Computer Science (LNCS), vol. 13990, pp. 309-336, 32nd European Symposium on Programming, Paris, France, 22/04/23. https://doi.org/10.1007/978-3-031-30044-8_12","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"doi:10.48550/arxiv.2301.11301","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2301.11301","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:dare.uva.nl:openaire/87e4fd5e-be63-496a-93d5-33fc49b85dca","is_oa":true,"landing_page_url":"https://handle.uba.uva.nl/personal/pure/en/publications/a-complete-inference-system-for-skipfree-guarded-kleene-algebra-with-tests(87e4fd5e-be63-496a-93d5-33fc49b85dca).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306400088","display_name":"UvA-DARE (University of Amsterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887064364","host_organization_name":"University of Amsterdam","host_organization_lineage":["https://openalex.org/I887064364"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Schmid, T, Kapp\u00e9, T & Silva, A 2023, A Complete Inference System for Skip-free Guarded Kleene Algebra with Tests. in T Wies (ed.), Programming Languages and Systems : 32nd European Symposium on Programming, ESOP 2023, held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2023, Paris, France, April 22\u201327, 2023 : proceedings. Lecture Notes in Computer Science, vol. 13990, Cham, pp. 309-226, 32nd European Symposium on Programming, Paris, France, 22/04/23. https://doi.org/10.48550/arXiv.2301.11301, https://doi.org/10.1007/978-3-031-30044-8_12","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2471495717","https://openalex.org/W1549533980","https://openalex.org/W1007073359","https://openalex.org/W2951618619","https://openalex.org/W2970531535","https://openalex.org/W1565669300","https://openalex.org/W4287865314","https://openalex.org/W3008933585","https://openalex.org/W2953186961","https://openalex.org/W1483420038"],"abstract_inverted_index":{"Guarded":[0],"Kleene":[1,10,45],"Algebra":[2,11],"with":[3,12],"Tests":[4,13],"(GKAT)":[5],"is":[6],"a":[7,61],"fragment":[8,63],"of":[9,41,44,64,67],"(KAT)":[14],"that":[15],"was":[16],"recently":[17],"introduced":[18],"to":[19,27],"reason":[20],"efficiently":[21],"about":[22],"imperative":[23],"programs.":[24,69],"In":[25,47],"contrast":[26],"KAT,":[28],"GKAT":[29,65],"does":[30],"not":[31],"have":[32],"an":[33,39,52],"algebraic":[34,53],"axiomatization,":[35],"but":[36],"relies":[37],"on":[38],"analogue":[40],"Salomaa's":[42],"axiomatization":[43,54],"Algebra.":[46],"this":[48],"paper,":[49],"we":[50],"present":[51],"and":[55],"prove":[56],"two":[57],"completeness":[58],"results":[59],"for":[60],"large":[62],"consisting":[66],"skip-free":[68]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2026-03-25T23:56:10.502304","created_date":"2023-01-28T00:00:00"}