A Weakest Precondition Calculus for Programs and Linear Temporal Specifications: Isabelle/HOL Proofs and Prototype Implementation

This artifact contains supporting material for A Weakest Precondition Calculus for Programs and Linear Temporal Specifications:

• Isabelle/HOL proofs of the main technical results
• A prototype implementation written in Scala, based on an embedded DSL encoding of programs and formulas

Update from the previous version

• Includes rules for atomic steps and unfolding temporal operators
• Streamlined and more concise presentation