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}
}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 with Time - Refining the Run-Time of Algorithms in Isabelle/HOL
- Computer Science
- ITP
- 2019
- 4
- PDF
Correct-by-Construction Implementation of Runtime Monitors Using Stepwise Refinement
- Computer Science
- SETTA
- 2018
- 2
- PDF
Formal Verification of an Executable LTL Model Checker with Partial Order Reduction
- Computer Science
- Journal of Automated Reasoning
- 2017
- 10
- PDF
Automatic Refinement to Efficient Data Structures: A Comparison of Two Approaches
- Computer Science
- Journal of Automated Reasoning
- 2018
- 4
- PDF
Verifying Asymptotic Time Complexity of Imperative Programs in Isabelle
- Computer Science, Mathematics
- IJCAR
- 2018
- 9
- PDF
References
SHOWING 1-10 OF 45 REFERENCES
Characteristic formulae for the verification of imperative programs
- Computer Science
- ICFP '11
- 2011
- 89
- PDF
A Framework for Verified Depth-First Algorithms
- Computer Science
- ATx/WInG@IJCAR
- 2012
- 7
- Highly Influential
- PDF