Year: 2004
Type: report
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.
Authors: Bannwart, Fabian Yves, Müller, Peter
Language: English
Subfield: Software
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W1596016900