Generalising KAT to Verify Weighted Computations

Scientific Annals of Computer Science

article

L. Gomes¹  A. Madeira²  L. S. Barbosa³ 

[1] HASLab INESC TEC, Universidade do Minho, R. da Universidade;CIDMA, Universidade de Aveiro, Campus Universit´ario de Santiago;Universidade do Minho, R. da Universidade, 4710-057 Braga, Portugal & Quantum Software Engineering Group, INL

关键词: Kleene algebra;    Hoare logic;    graded tests;    fuzzy relations;   

DOI  :  10.7561/SACS.2019.2.141

来源: Alexandru Ioan Cuza University of Iasi

【 摘 要 】

Kleene algebra with tests (KAT) was introduced as an algebraic structure to model and reason about classic imperative programs, i.e. sequences of discrete transitions guarded by Boolean tests. This paper introduces two generalisations of this structure able to express programs as weighted transitions and tests with outcomes in non necessarily bivalent truth spaces: graded Kleene algebra with tests (GKAT) and a variant where tests are also idempotent (I-GKAT). In this context, and in analogy to Kozen’s encoding of Propositional Hoare Logic (PHL) in KAT we discuss the encoding of a graded PHL in I-GKAT and of its while-free fragment in GKAT. Moreover, to establish semantics for these structures four new algebras are defined: F SET (T ), F REL(K, T ) and F LANG(K, T ) over complete residuated lattices K and T , and M(n, A) over a GKAT or I-GKAT A. As a final exercise, the paper discusses some program equivalence proofs in a graded context.

【 授权许可】

CC BY-ND