Relational Semantics Revisited
Electronic Notes in Theoretical Computer Science (ENTCS)
Unifying lazy and strict computations
RAMiCS'12 Proceedings of the 13th international conference on Relational and Algebraic Methods in Computer Science
| Hi-index | 5.23 |
We propose a new and uniform abstract relational approach todemonic nondeterminism and robust correctness similar to Hoare's chaossemantics. It is based on a specific set of relations on flat lattices.This set forms a complete lattice. Furthermore, we deal with therefinement of programs. Among other things, we show the correctness ofthe unfold/fold method for demonic nondeterminism and robust correctnessas refinement relation and investigate relationships to Dijkstra'swp-calculus and Morgan's specification statement.—Authors' Abstract