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