Bockenek, Joshua A.2018-01-112018-01-112017-12-21http://hdl.handle.net/10919/81710Writing bug-free code is fraught with difficulty, and existing tools for the formal verification of programs do not scale well to large, complicated codebases such as that of systems software. This thesis presents USIMPL, a component of the Orca project for formal verification that builds on Foster’s Isabelle/UTP with features of Schirmer’s Simpl in order to achieve a modular, scalable framework for deductive proofs of program correctness utilizing Hoare logic and Hoare-style algebraic laws of programming.ETDen-USCreative Commons Attribution-ShareAlike 3.0 United StatesFormal VerificationFormal MethodsIsabelleUnifying Theories of ProgrammingVerification Condition GenerationThesis