Refinement Monadic
From MaRDI portal
Software:40265
swMATH28551MaRDI QIDQ40265FDOQ40265
Author name not available (Why is that?)
Cited In (9)
- Formal verification of an executable LTL model checker with partial order reduction
- Refinement to imperative HOL
- Formalizing the Edmonds-Karp Algorithm
- A verified ODE solver and the Lorenz attractor
- Verifying Faradžev-Read Type Isomorph-Free Exhaustive Generation
- Title not available (Why is that?)
- Verified Efficient Implementation of Gabow’s Strongly Connected Component Algorithm
- Title not available (Why is that?)
- Formalizing network flow algorithms: a refinement approach in Isabelle/HOL
This page was built for software: Refinement Monadic
