2015/07/26 by Georg Struth, Struth, Georg
Computer Science · #FOS: Computer and information sciences #Formal Methods in Verification #Logic in Computer Science (cs.LO) #Logic, Reasoning, and Knowledge #Logic, programming, and type systems #cs.LO
paper · pdf · doi:10.48550/arxiv.1507.07246
Typos have been corrected
openalex publication_date 2015/07/26 · arxiv created 2015/08/02 · arxiv updated 2015/08/04 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
It is shown that antidomain semirings are more expressive than test semirings and that Kleene algebras with domain are more expressive than Kleene algebras with tests. It is also shown that Kleene algebras with domain are expressive for propositional Hoare logic whereas Kleene algebras with tests are not.