Trustworthy Global Computing
From MaRDI portal
Publication:5394792
DOI10.1007/11580850zbMATH Open1151.68523OpenAlexW2972035647MaRDI QIDQ5394792FDOQ5394792
Publication date: 1 November 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11580850
Cryptography (94A60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cited In (6)
Recommendations
- The security pi-calculus and non-interference π π
- A theory of bisimulation for the \(\pi\)-calculus π π
- A stable non-interleaving early operational semantics for the pi-calculus π π
- A Stable Non-interleaving Early Operational Semantics for the Pi-Calculus π π
- Noninterference in a predicative polymorphic calculus for access control π π
- A fully abstract denotational semantics for the \(\pi\)-calculus π π
- Proving Noninterference by a Fully Complete Translation to the Simply Typed lambda-calculus π π
- A note on the proof theory of the \(\lambda \Pi\)-calculus π π
This page was built for publication: Trustworthy Global Computing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5394792)