Preface
From MaRDI portal
Publication:5970649
DOI10.1007/s00165-012-0257-0zbMath1259.01011OpenAlexW1896105889MaRDI QIDQ5970649
Ian J. Hayes, Robert J. van Glabbeek, Peter Höfner
Publication date: 22 March 2013
Published in: Formal Aspects of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00165-012-0257-0
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A theoretical basis for stepwise refinement and the programming calculus
- The shadow knows: refinement and security in sequential programs
- Using probabilistic Kleene algebra pKA for protocol verification
- An elementary proof that Herman's ring is \(\Theta (N^{2})\)
- Refinement-oriented probability for CSP
- Specification of the UNIX Filing System
- The Shadow Knows: Refinement of Ignorance in Sequential Programs
- Characterising Testing Preorders for Finite Probabilistic Processes
- Laws of programming
- The specification statement
- Scalar Outcomes Suffice for Finitary Probabilistic Testing
This page was built for publication: Preface