Simplifying Pointer Kleene algebra
- 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.
Author: | Han Hing Dang, Bernhard MöllerGND |
---|---|
URN: | urn:nbn:de:bvb:384-opus4-587813 |
Frontdoor URL | https://opus.bibliothek.uni-augsburg.de/opus4/58781 |
URL: | http://ceur-ws.org/Vol-760/ate2011.pdf |
ISSN: | 1613-0073OPAC |
Parent Title (English): | 1st Workshop on Automated Theory Engineering (ATE 2011): Wroclaw, Poland, July 31, 2011; Proceedings |
Publisher: | CEUR-WS |
Editor: | Peter Höfner, Annabelle McIver, Georg StruthGND |
Type: | Part of a Book |
Language: | English |
Year of first Publication: | 2011 |
Publishing Institution: | Universität Augsburg |
Release Date: | 2019/07/23 |
First Page: | 20 |
Last Page: | 29 |
Series: | CEUR Workshop Proceedings ; 760 |
Institutes: | Fakultät für Angewandte Informatik |
Fakultät für Angewandte Informatik / Institut für Informatik | |
Fakultät für Angewandte Informatik / Institut für Informatik / Professur für Programmiermethodik und Multimediale Informationssysteme | |
Dewey Decimal Classification: | 5 Naturwissenschaften und Mathematik / 51 Mathematik / 510 Mathematik |
Licence (German): | ![]() |