Abstract
Firstly, this technical report presents a Hoare-style programming logic (“axiomatic semantics”) for a sequential, stack-based bytecode language with unstructured control flow and OO-features similar to the JVM or the CLI languages. We prove soundness and completeness with respect to the operational semantics and derive a weakest precondition calculus that does not sacrifice modular reasoning. We then extend the bytecode language and its logic to include structured exception handling and class initialization and we show how the weakest precondition calculus can be used to trivially derive provably correct rules for most JVM and many CLI instructions.
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 callDisclaimer: 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.
