Verifying a secure information flow analyzer

  • Authors:
  • David A. Naumann

  • Affiliations:
  • Stevens Institute of Technology, Hoboken, NJ

  • Venue:
  • TPHOLs'05 Proceedings of the 18th international conference on Theorem Proving in Higher Order Logics
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

Denotational semantics for a substantial fragment of Java is formalized by deep embedding in PVS, making extensive use of dependent types. A static analyzer for secure information flow for this language is proved correct, that is, it enforces noninterference.