{"id":"https://openalex.org/W2995123640","doi":"https://doi.org/10.1145/3371129","title":"Guarded Kleene algebra with tests: verification of uninterpreted programs in nearly linear time","display_name":"Guarded Kleene algebra with tests: verification of uninterpreted programs in nearly linear time","publication_year":2019,"publication_date":"2019-12-20","ids":{"openalex":"https://openalex.org/W2995123640","doi":"https://doi.org/10.1145/3371129","mag":"2995123640"},"language":"en","primary_location":{"id":"doi:10.1145/3371129","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3371129","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3371129","source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3371129","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Steffen Smolka","orcid":null},"institutions":[{"id":"https://openalex.org/I205783295","display_name":"Cornell University","ror":"https://ror.org/05bnh6r87","country_code":"US","type":"education","lineage":["https://openalex.org/I205783295"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Steffen Smolka","raw_affiliation_strings":["Cornell University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Cornell University, USA","institution_ids":["https://openalex.org/I205783295"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Nate Foster","orcid":null},"institutions":[{"id":"https://openalex.org/I205783295","display_name":"Cornell University","ror":"https://ror.org/05bnh6r87","country_code":"US","type":"education","lineage":["https://openalex.org/I205783295"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Nate Foster","raw_affiliation_strings":["Cornell University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Cornell University, USA","institution_ids":["https://openalex.org/I205783295"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Justin Hsu","orcid":null},"institutions":[{"id":"https://openalex.org/I135310074","display_name":"University of Wisconsin\u2013Madison","ror":"https://ror.org/01y2jtd41","country_code":"US","type":"education","lineage":["https://openalex.org/I135310074"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Justin Hsu","raw_affiliation_strings":["University of Wisconsin-Madison, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Wisconsin-Madison, USA","institution_ids":["https://openalex.org/I135310074"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Tobias Kapp\u00e9","orcid":null},"institutions":[{"id":"https://openalex.org/I45129253","display_name":"University College London","ror":"https://ror.org/02jx3x895","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I45129253"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Tobias Kapp\u00e9","raw_affiliation_strings":["University College London, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University College London, UK","institution_ids":["https://openalex.org/I45129253"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Dexter Kozen","orcid":null},"institutions":[{"id":"https://openalex.org/I205783295","display_name":"Cornell University","ror":"https://ror.org/05bnh6r87","country_code":"US","type":"education","lineage":["https://openalex.org/I205783295"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dexter Kozen","raw_affiliation_strings":["Cornell University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Cornell University, USA","institution_ids":["https://openalex.org/I205783295"]}]},{"author_position":"last","author":{"id":null,"display_name":"Alexandra Silva","orcid":null},"institutions":[{"id":"https://openalex.org/I45129253","display_name":"University College London","ror":"https://ror.org/02jx3x895","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I45129253"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Alexandra Silva","raw_affiliation_strings":["University College London, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University College London, UK","institution_ids":["https://openalex.org/I45129253"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":6,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.3016,"has_fulltext":true,"cited_by_count":30,"citation_normalized_percentile":{"value":0.86058727,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"4","issue":"POPL","first_page":"1","last_page":"28"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.37299999594688416,"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"}},"topics":[{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.37299999594688416,"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/T10142","display_name":"Formal Methods in Verification","score":0.24300000071525574,"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.2371000051498413,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/kleene-algebra","display_name":"Kleene algebra","score":0.9782000184059143},{"id":"https://openalex.org/keywords/kleenes-recursion-theorem","display_name":"Kleene's recursion theorem","score":0.8881000280380249},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.632099986076355},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.5787000060081482},{"id":"https://openalex.org/keywords/equational-logic","display_name":"Equational logic","score":0.5601999759674072},{"id":"https://openalex.org/keywords/universal-algebra","display_name":"Universal algebra","score":0.4381999969482422},{"id":"https://openalex.org/keywords/contrast","display_name":"Contrast (vision)","score":0.38179999589920044},{"id":"https://openalex.org/keywords/linear-algebra","display_name":"Linear algebra","score":0.3587000072002411}],"concepts":[{"id":"https://openalex.org/C206470798","wikidata":"https://www.wikidata.org/wiki/Q2634506","display_name":"Kleene algebra","level":2,"score":0.9782000184059143},{"id":"https://openalex.org/C123260079","wikidata":"https://www.wikidata.org/wiki/Q1933521","display_name":"Kleene's recursion theorem","level":2,"score":0.8881000280380249},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.632099986076355},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.5787000060081482},{"id":"https://openalex.org/C154564781","wikidata":"https://www.wikidata.org/wiki/Q5384236","display_name":"Equational logic","level":3,"score":0.5601999759674072},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5573999881744385},{"id":"https://openalex.org/C188971069","wikidata":"https://www.wikidata.org/wiki/Q1636734","display_name":"Universal algebra","level":3,"score":0.4381999969482422},{"id":"https://openalex.org/C2776502983","wikidata":"https://www.wikidata.org/wiki/Q690182","display_name":"Contrast (vision)","level":2,"score":0.38179999589920044},{"id":"https://openalex.org/C139352143","wikidata":"https://www.wikidata.org/wiki/Q82571","display_name":"Linear algebra","level":2,"score":0.3587000072002411},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3546000123023987},{"id":"https://openalex.org/C170517529","wikidata":"https://www.wikidata.org/wiki/Q21998744","display_name":"Term algebra","level":5,"score":0.349700003862381},{"id":"https://openalex.org/C21696900","wikidata":"https://www.wikidata.org/wiki/Q1333055","display_name":"Semiring","level":2,"score":0.3328999876976013},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.31700000166893005},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.289000004529953},{"id":"https://openalex.org/C39685927","wikidata":"https://www.wikidata.org/wiki/Q173183","display_name":"Boolean algebra","level":2,"score":0.2824999988079071},{"id":"https://openalex.org/C136979486","wikidata":"https://www.wikidata.org/wiki/Q773483","display_name":"Existential quantification","level":2,"score":0.27619999647140503},{"id":"https://openalex.org/C200116569","wikidata":"https://www.wikidata.org/wiki/Q902052","display_name":"G\u00f6del's completeness theorem","level":2,"score":0.2685999870300293},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.2667999863624573}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3371129","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3371129","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3371129","source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1907.05920","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1907.05920","pdf_url":"https://arxiv.org/pdf/1907.05920","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"doi:10.1145/3371129","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3371129","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3371129","source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2053862978","display_name":"SaTC:  CORE:  Small:  Collaborative:  A New Approach to Federated Network Security","funder_award_id":"1717581","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G2570729561","display_name":null,"funder_award_id":"AitF-1637532, CNS-1413978, and SaTC-1717581","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6228305546","display_name":null,"funder_award_id":"1637532","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7732132814","display_name":null,"funder_award_id":"679127","funder_id":"https://openalex.org/F4320338352","funder_display_name":"FP7 Ideas: European Research Council"},{"id":"https://openalex.org/G8607168975","display_name":"NeTS: Large: Collaborative Research:Programmable Inter-domain Observation and Control\r\n","funder_award_id":"1413978","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320310638","display_name":"McGill University","ror":"https://ror.org/01pxwe438"},{"id":"https://openalex.org/F4320319993","display_name":"Leverhulme Trust","ror":"https://ror.org/012mzw131"},{"id":"https://openalex.org/F4320338352","display_name":"FP7 Ideas: European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2995123640.pdf","grobid_xml":"https://content.openalex.org/works/W2995123640.grobid-xml"},"referenced_works_count":34,"referenced_works":["https://openalex.org/W342302233","https://openalex.org/W1560923948","https://openalex.org/W1574223981","https://openalex.org/W1970904244","https://openalex.org/W1975315464","https://openalex.org/W1986022261","https://openalex.org/W1986591122","https://openalex.org/W1998368317","https://openalex.org/W2007281030","https://openalex.org/W2010927194","https://openalex.org/W2011847110","https://openalex.org/W2016313399","https://openalex.org/W2018583393","https://openalex.org/W2020915715","https://openalex.org/W2059518671","https://openalex.org/W2064204259","https://openalex.org/W2069709605","https://openalex.org/W2072607050","https://openalex.org/W2074864221","https://openalex.org/W2079430385","https://openalex.org/W2087161072","https://openalex.org/W2088189323","https://openalex.org/W2094542439","https://openalex.org/W2097145414","https://openalex.org/W2102075452","https://openalex.org/W2117065635","https://openalex.org/W2130210899","https://openalex.org/W2130618976","https://openalex.org/W2149366752","https://openalex.org/W2151517515","https://openalex.org/W2161065509","https://openalex.org/W2164778826","https://openalex.org/W2913846715","https://openalex.org/W2939574732"],"related_works":[],"abstract_inverted_index":{"Guarded":[0],"Kleene":[1,10,77,89],"Algebra":[2,11],"with":[3,12],"Tests":[4,13],"(GKAT)":[5],"is":[6,58,68],"a":[7,75],"variation":[8],"on":[9],"(KAT)":[14],"that":[15,62],"arises":[16],"by":[17],"restricting":[18],"the":[19,33,63],"union":[20],"(+)":[21],"and":[22,38,79],"iteration":[23],"(*)":[24],"operations":[25],"from":[26],"KAT":[27],"to":[28,46,53],"predicate-guarded":[29],"versions.":[30],"We":[31,72],"develop":[32],"(co)algebraic":[34],"theory":[35,57,65],"of":[36,66,85,88],"GKAT":[37,67],"show":[39,61],"how":[40],"it":[41],"can":[42],"be":[43],"efficiently":[44],"used":[45],"reason":[47],"about":[48],"imperative":[49],"programs.":[50],"In":[51],"contrast":[52],"KAT,":[54],"whose":[55],"equational":[56,64],"PSPACE-complete,":[59],"we":[60],"(almost)":[69],"linear":[70],"time.":[71],"also":[73],"provide":[74],"full":[76],"theorem":[78],"prove":[80],"completeness":[81],"for":[82],"an":[83],"analogue":[84],"Salomaa\u2019s":[86],"axiomatization":[87],"Algebra.":[90]},"counts_by_year":[{"year":2026,"cited_by_count":4},{"year":2025,"cited_by_count":7},{"year":2024,"cited_by_count":7},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":1}],"updated_date":"2026-06-17T08:01:34.144755","created_date":"2019-12-26T00:00:00"}