Proving Noninterference by a Fully Complete Translation to the Simply Typed lambda-Calculus

Naokata Shikuma, Atsushi Igarashi. Proving Noninterference by a Fully Complete Translation to the Simply Typed lambda-Calculus. In Mitsu Okada, Ichiro Satoh, editors, Advances in Computer Science - ASIAN 2006. Secure Software and Related Issues, 11th Asian Computing Science Conference, Tokyo, Japan, December 6-8, 2006, Revised Selected Papers. Volume 4435 of Lecture Notes in Computer Science, pages 301-315, Springer, 2006. [doi]

@inproceedings{ShikumaI06,
  title = {Proving Noninterference by a Fully Complete Translation to the Simply Typed lambda-Calculus},
  author = {Naokata Shikuma and Atsushi Igarashi},
  year = {2006},
  doi = {10.1007/978-3-540-77505-8_24},
  url = {http://dx.doi.org/10.1007/978-3-540-77505-8_24},
  tags = {translation, completeness},
  researchr = {https://researchr.org/publication/ShikumaI06},
  cites = {0},
  citedby = {0},
  pages = {301-315},
  booktitle = {Advances in Computer Science - ASIAN 2006. Secure Software and Related Issues, 11th Asian Computing Science Conference, Tokyo, Japan, December 6-8, 2006, Revised Selected Papers},
  editor = {Mitsu Okada and Ichiro Satoh},
  volume = {4435},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-540-77504-1},
}