Separation Logic
From MaRDI portal
Software:40263
swMATH28549MaRDI QIDQ40263FDOQ40263
Author name not available (Why is that?)
Cited In (9)
- Efficient verification of imperative programs using auto2
- Verifying the Correctness of Disjoint-Set Forests with Kleene Relation Algebras
- Refinement to imperative HOL
- Formalizing the Edmonds-Karp Algorithm
- For a few dollars more. Verified fine-grained algorithm analysis down to LLVM
- Refinement to Imperative/HOL
- Verifying asymptotic time complexity of imperative programs in Isabelle
- Verifying the correctness and amortized complexity of a union-find implementation in separation logic with time credits
- Formalizing network flow algorithms: a refinement approach in Isabelle/HOL
This page was built for software: Separation Logic
