Pages that link to "Item:Q2914741"

The following pages link to Applying Data Refinement for Monadic Programs to Hopcroft’s Algorithm (Q2914741):

Displaying 22 items.

• Formal verification of an executable LTL model checker with partial order reduction (Q682350) (← links)
• Verified iptables firewall analysis and verification (Q1663231) (← links)
• Formalizing network flow algorithms: a refinement approach in Isabelle/HOL (Q1722647) (← links)
• Refinement to imperative HOL (Q1739909) (← links)
• For a few dollars more. Verified fine-grained algorithm analysis down to LLVM (Q2233462) (← links)
• From LCF to Isabelle/HOL (Q2280211) (← links)
• A formalisation of the Myhill-Nerode theorem based on regular expressions (Q2351151) (← links)
• Automatic refinement to efficient data structures: a comparison of two approaches (Q2417948) (← links)
• Formalizing the Edmonds-Karp Algorithm (Q2829260) (← links)
• Equational Reasoning with Applicative Functors (Q2829262) (← links)
• Refinement to Imperative/HOL (Q2945637) (← links)
• Formalization and Execution of Linear Algebra: From Theorems to Algorithms (Q3453644) (← links)
• Efficient Verified Implementation of Introsort and Pdqsort (Q5049010) (← links)
• (Q5875421) (← links)
• (Q5875428) (← links)
• (Q5875431) (← links)
• (Q5875432) (← links)
• Effect polymorphism in higher-order logic (proof pearl) (Q5915785) (← links)
• Efficient verified (UN)SAT certificate checking (Q5919480) (← links)
• Effect polymorphism in higher-order logic (proof pearl) (Q5919584) (← links)
• Flexible Correct-by-Construction Programming (Q6135766) (← links)
• Refinement of parallel algorithms down to LLVM: applied to practically efficient parallel sorting (Q6611962) (← links)