Towards pointer algebra

DOI10.1016/0167-6423(93)90008-DzbMath0780.68090OpenAlexW2037911517WikidataQ114851997 ScholiaQ114851997MaRDI QIDQ685621

Bernhard Möller

Publication date: 31 January 1994

Published in: Science of Computer Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6423(93)90008-d

zbMATH Keywords

transformationrelational algebrapointer algorithms

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) General topics in the theory of software (68N01) Relational systems, laws of composition (08A02) Discrete mathematics in relation to computer science (68R99)

Related Items (8)

Extended feature algebra ⋮ Verifying the Correctness of Disjoint-Set Forests with Kleene Relation Algebras ⋮ Calculating with acyclic and cyclic lists ⋮ Combining relational calculus and the Dijkstra-Gries method for deriving relational programs ⋮ Algebraic separation logic ⋮ Structured Document Algebra in Action ⋮ Extended transitive separation logic ⋮ Characterizing determinacy in Kleene algebras

This page was built for publication: Towards pointer algebra