Simplifying Pointer Kleene Algebra

erschienen 2011 in 1st Workshop on Automated Theory Engineering (ATE 2011), 2011.

Abstract:
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 are more amenable to automatic theorem proving systems.