How to brew-up a refinement ordering

DOI10.1016/J.ENTCS.2009.12.021zbMATH Open1342.68094OpenAlexW2032012825MaRDI QIDQ2994493FDOQ2994493

Authors: Carroll Morgan 

Publication date: 1 August 2016

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2009.12.021

Recommendations

• Compositional noninterference from first principles
• The Secret Art of Computer Programming
• The shadow knows: refinement and security in sequential programs
• Refinement
• General refinement. II: Flexible refinement

zbMATH Keywords

full abstractionrefinementsecuritynon-interferencecompositionalityignorancerefinement paradoxshadow semantics

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60) Semantics in the theory of computing (68Q55)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• An axiomatic basis for computer programming
• The B-Book
• The dining cryptographers problem: Unconditional sender and recipient untraceability
• Abstraction, Refinement and Proof for Probabilistic Systems
• The Shadow Knows: Refinement of Ignorance in Sequential Programs
• Probabilistic models for the guarded command language
• Title not available (Why is that?)
• Power domains
• The Secret Art of Computer Programming
• Title not available (Why is that?)
• The shadow knows: refinement and security in sequential programs
• Communicating Sequential Processes. The First 25 Years

Cited In (1)

• Compositional noninterference from first principles

This page was built for publication: How to brew-up a refinement ordering

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2994493)