.png){kind=icon}
.png){kind=icon}
Return
On Propositional Program Equivalence (Extended Abstract)
.png){kind=icon}
PRE
AI
DOI：10.1007/978-3-031-99536-1_1.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
General program equivalence is undecidable. However, if we abstract away the semantics of statements, then this problem becomes not just decidable, but practically feasible. For instance, a program of the form if b then epsilon else f should be equivalent to if not b then f else epsilon-no matter what b, e and f are. This kind of equivalence is known as propositional equivalence. In this extended abstract, we discuss recent developments in propositional program equivalence from the perspective of (Guarded) Kleene Algebra with Tests, or (G)KAT.
Keywords:
COMPLETE INFERENCE SYSTEM
KLEENE ALGEBRA
REGULAR EXPRESSIONS
COMPLETENESS
THEOREM
Journal
L
IF:
0
Papers:
21
Citations:
0