Verification of Information Flow Properties of Java Programs Without Approximations
In this paper, the authors propose a methodology for the specification and verification of information flow properties for sequential Java programs. This proposal also covers declassification. They define an extension of the Java Modeling Language (JML) that significantly goes beyond previous approaches. The JML specification clauses are translated into proof obligations in Dynamic Logic. An experimental implementation within the KeY-system shows the feasibility of the approach. This paper is concerned with the specification and verification of information flow properties.