TY  - CHAP
A1  - Dang, Han Hing
A1  - Möller, Bernhard
A2  - Höfner, Peter
A2  - McIver, Annabelle
A2  - Struth, Georg
T1  - Simplifying Pointer Kleene algebra
T2  - 1st Workshop on Automated Theory Engineering (ATE 2011): Wroclaw, Poland, July 31, 2011; Proceedings
N2  - Pointer Kleene algebra has proved to be a useful abstraction for reasoning about reachability properties and correctly deriving pointer algorithms. Unfortunately it comes with a complex set of operations and defining (in)equations which exacerbates its practicability with automated theorem proving systems but also its use by theory developers. Therefore we provide an easier access to this approach by simpler axioms and laws which also are more amenable to automatic theorem proving systems.
Y1  - 2019
UR  - https://opus.bibliothek.uni-augsburg.de/opus4/frontdoor/index/index/docId/58781
UR  - https://nbn-resolving.org/urn:nbn:de:bvb:384-opus4-587813
UR  - http://ceur-ws.org/Vol-760/ate2011.pdf
SN  - 1613-0073
SP  - 20
EP  - 29
PB  - CEUR-WS
ER  -