On incorrectness logic and Kleene algebra with top and tests

@article{Zhang2022OnIL,
  title={On incorrectness logic and Kleene algebra with top and tests},
  author={Cheng Zhang and Arthur Azevedo de Amorim and Marco Gaboardi},
  journal={Proceedings of the ACM on Programming Languages},
  year={2022},
  volume={6},
  pages={1 - 30}
}
Kleene algebra with tests (KAT) is a foundational equational framework for reasoning about programs, which has found applications in program transformations, networking and compiler optimizations, among many other areas. In his seminal work, Kozen proved that KAT subsumes propositional Hoare logic, showing that one can reason about the (partial) correctness of while programs by means of the equational theory of KAT. In this work, we investigate the support that KAT provides for reasoning about… 

Figures from this paper

Local Completeness Logic on Kleene Algebra with Tests

It is generalized by studying how KATs extended either with a modal diamond operator or with a top element are able to represent the local completeness logic LCL, to show that the LCL proof system is logically sound and, under some hypotheses, complete.

Four Rules for Converting Complex Loops to Regular Expressions

The paper presents a new method for constructing regress expressions for complex loops and introduces four types of loops and gives rules for converting these loops to regular expressions.

Completeness Theorems for Kleene Algebra with Top

Two completeness results for Kleene algebra with a top element are proved, with respect to languages and binary relations, which are relative to any axiomatisation of the algebra of regular events.

An algebra of alignment for relational verification

A simple extension of Kleene Algebra with Tests (KAT), called BiKAT, subsumes prior formulations, including alignment witnesses for forall-exists properties, which brings to light new RHL-style rules for such properties.

On Tools for Completeness of Kleene Algebra with Hypotheses

. In the literature on Kleene algebra, a number of variants have been proposed which impose additional structure specified by a theory, such as Kleene algebra with tests (KAT) and the recent Kleene

On Algebra of Program Correctness and Incorrectness

A Kleene algebra with diamond operators and countable joins of tests is used, which embeds IL, and which also is complete for reasoning about the image of the embedding, which unifies correctness and incorrectness reasoning in one formalism.

References

SHOWING 1-10 OF 39 REFERENCES

Equational Theories of Abnormal Termination Based on Kleene Algebra

This work investigates two equational theories in the abstract framework of Kleene algebra, and proposes two simple and intuitive equational axiomatizations, and proves very general conservativity results.

On Algebra of Program Correctness and Incorrectness

A Kleene algebra with diamond operators and countable joins of tests is used, which embeds IL, and which also is complete for reasoning about the image of the embedding, which unifies correctness and incorrectness reasoning in one formalism.

A completeness theorem for Kleene algebras and the algebra of regular events

  • D. Kozen
  • Mathematics
    [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science
  • 1991
A finitary axiomatization of the algebra of regular events involving only equations and equational implications that is sound for all interpretations over Kleene algebras is given. Axioms for Kleene

On Hoare logic and Kleene algebra with tests

  • D. Kozen
  • Computer Science
    Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158)
  • 1999
The specialized syntax and deductive apparatus of Hoare logic are inessential and can be replaced by simple equational reasoning, and it is shown that Kleene algebra with tests subsumes propositionalHoare logic.

NetKAT: semantic foundations for networks

It is shown that NetKAT is an instance of a canonical and well-studied mathematical structure called a Kleene algebra with tests (KAT) and proved that its equational theory is sound and complete with respect to its denotational semantics.

Kleene algebra with tests

A purely equational proof is given, using Kleene algebra with tests and commutativity conditions, of the following classical result: every while program can be simulated by a while program with at most one while loop.

Kleene Algebra with Tests: Completeness and Decidability

The completeness of the equational theory of Kleene algebras with tests and *-continuous Kleene algebra with tests over language-theoretic and relational models is proved.

Modal Kleene algebra and applications - a survey

Modal Kleene algebras are Kleene algebras with forward and backward modal operators, defined via domain and codomain operations. They provide a concise and convenient algebraic framework that

Kleene Algebra with Tests and Coq Tools for while Programs

We present a Coq library about Kleene algebra with tests, including a proof of their completeness over the appropriate notion of languages, a decision procedure for their equational theory, and tools

Ziemiánski. Domain Semirings United

  • [cs],
  • 2021