Trustworthy Global Computing
From MaRDI portal
Publication:5394792
DOI10.1007/11580850zbMATH Open1151.68523OpenAlexW2972035647MaRDI QIDQ5394792FDOQ5394792
Authors: Silvia Crafa, Sabina Rossi 
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
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
Cryptography (94A60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cited In (15)
- Noninterference through flow analysis
- The security picalculus and non-interference (extended abstract)
- Title not available (Why is that?)
- Typing noninterference for reactive programs
- Noninterference for Intuitionist Necessity
- Title not available (Why is that?)
- Proving Noninterference by a Fully Complete Translation to the Simply Typed lambda-calculus
- Combining behavioural types with security analysis
- The security pi-calculus and non-interference
- May testing, non-interference, and compositionality
- Linearity and bisimulation
- Controlling information release in the \(\pi\)-calculus
- Hide and new in the \(\pi\)-calculus
- Branching bisimulation semantics enables noninterference analysis of reversible systems
- A well-behaved LTS for the pi-calculus (abstract)
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)
