(2008). Proving Noninterference by a Fully Complete Translation to the Simply Typed lambda-calculus. Logical Methods in Computer Science.
Successfully copied to clipboard
Copying to clipboard failed
Chicago Style (17th ed.) Citation
"Proving Noninterference by a Fully Complete Translation to the Simply Typed Lambda-calculus."
Logical Methods in Computer Science 2008.
Successfully copied to clipboard
Copying to clipboard failed
MLA (9th ed.) Citation
"Proving Noninterference by a Fully Complete Translation to the Simply Typed Lambda-calculus."
Logical Methods in Computer Science, 2008.
Successfully copied to clipboard
Copying to clipboard failed
Warning: These citations may not always be 100% accurate.