Trustworthy Global Computing
From MaRDI portal
Publication:5394792
Recommendations
- The security pi-calculus and non-interference
- A theory of bisimulation for the -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 -calculus
Cited in
(15)- Noninterference through flow analysis
- The security picalculus and non-interference (extended abstract)
- scientific article; zbMATH DE number 2087446 (Why is no real title available?)
- Typing noninterference for reactive programs
- Noninterference for Intuitionist Necessity
- scientific article; zbMATH DE number 1884405 (Why is no real title available?)
- 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)
