Abstract
AbstractThis article presents a Hoare‐style calculus for a substantial subset of Java Card, which we call Java$^{\ell ight}$. In particular, the language includes side‐effecting expressions, mutual recursion, dynamic method binding, full exception handling, and static class initialization.The Hoare logic of partial correctness is proved not only sound (w.r.t. our operational semantics of Java$^{\ell ight}$, described in detail elsewhere) but even complete. It is the first logic for an object‐oriented language that is provably complete. The completeness proof uses a refinement of the Most General Formula approach. The proof of soundness gives new insights into the role of type safety. Further by‐products of this work are a new general methodology for handling side‐effecting expressions and their results, the discovery of the strongest possible rule of consequence, and a flexible Call rule for mutual recursion. We also give a small but non‐trivial application example.All definitions and proofs have been done formally with the interactive theorem prover Isabelle/HOL. This guarantees not only rigorous definitions, but also gives maximal confidence in the results obtained. Copyright © 2001 John Wiley & Sons, Ltd.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Concurrency and Computation: Practice and Experience
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
