Refinement to Imperative HOL

@article{Lammich2017RefinementTI,
  title={Refinement to Imperative HOL},
  author={P. Lammich},
  journal={Journal of Automated Reasoning},
  year={2017},
  volume={62},
  pages={481-503}
}
  • P. Lammich
  • Published 2017
  • Computer Science
  • Journal of Automated Reasoning
  • Many algorithms can be implemented most efficiently with imperative data structures. This paper presents Sepref, a stepwise refinement based tool chain for the verification of imperative algorithms in Isabelle/HOL. As a back end we use imperative HOL, which allows to generate verified imperative code. On top of imperative HOL, we develop a separation logic framework with powerful proof tactics. We use this framework to verify basic imperative data structures and to define a refinement calculus… CONTINUE READING
    50 Citations
    Refinement based verification of imperative data structures
    • 25
    • PDF
    Correct-by-Construction Implementation of Runtime Monitors Using Stepwise Refinement
    • 2
    • PDF
    Efficient Verification of Imperative Programs Using Auto2
    • 4
    • PDF
    Verified Model Checking of Timed Automata
    • 17
    • PDF
    Formal Verification of an Executable LTL Model Checker with Partial Order Reduction
    • 10
    • PDF
    Automatic Refinement to Efficient Data Structures: A Comparison of Two Approaches
    • 4
    • PDF
    Verifying Asymptotic Time Complexity of Imperative Programs in Isabelle
    • 9
    • PDF

    References

    SHOWING 1-10 OF 45 REFERENCES
    Automatic Data Refinement
    • 59
    • PDF
    The Imperative Refinement Framework
    • 6
    • PDF
    A Separation Logic Framework for Imperative HOL
    • 19
    • PDF
    Characteristic formulae for the verification of imperative programs
    • 89
    • PDF
    Refinement based verification of imperative data structures
    • 25
    • PDF
    Fiat: Deductive Synthesis of Abstract Data Types in a Proof Assistant
    • 88
    • PDF
    Refinement for Monadic Programs
    • 20
    • PDF
    A Framework for Verified Depth-First Algorithms
    • 7
    • Highly Influential
    • PDF
    A Fully Verified Executable LTL Model Checker
    • 76
    • PDF