Abstract

We propose a new and uniform abstract relational approach to demonic nondeterminism and robust correctness similar to Hoare's chaos semantics. It is based on a specific set of relations on flat lattices. This set forms a complete lattice. Furthermore, we deal with the refinement of programs. Among other things, we show the correctness of the unfold/fold method for demonic nondeterminism and robust correctness as refinement relation and investigate relationships to Dijkstra's wp-calculus and Morgan's specification statement.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.