CPS Formal Methods
Date of this Version
Lecture Notes in Computer Science: Computer Aided Verification
We address the problem of analyzing programs such as J2ME midlets for mobile devices, where a central correctness requirement concerns confidentiality of data that the user wants to keep secret. Existing software model checking tools analyze individual program executions, and are not applicable to checking confidentiality properties that require reasoning about equivalence among executions. We develop an automated analysis technique for such properties. We show that both over- and under- approximation is needed for sound analysis. Given a program and a confidentiality requirement, our technique produces a formula that is satisfiable if the requirement holds. We evaluate the approach by analyzing bytecode of a set of Java (J2ME) methods.
The original publication is available at www.springerlink.com
Pavol Cerný and Rajeev Alur, "Automated Analysis of Java Methods for Confidentiality", Lecture Notes in Computer Science: Computer Aided Verification 5643, 173-187. June 2009. http://dx.doi.org/10.1007/978-3-642-02658-4_16
Date Posted: 16 July 2012