Refinement of parallel algorithms down to LLVM: applied to practically efficient parallel sorting
From MaRDI portal
Publication:6611962
DOI10.1007/S10817-024-09701-WMaRDI QIDQ6611962
Publication date: 27 September 2024
Published in: Journal of Automated Reasoning (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Formal verification of an executable LTL model checker with partial order reduction
- Formalizing network flow algorithms: a refinement approach in Isabelle/HOL
- For a few dollars more. Verified fine-grained algorithm analysis down to LLVM
- Verified model checking of timed automata
- Formalizing the Edmonds-Karp Algorithm
- Verified Efficient Implementation of Gabow’s Strongly Connected Component Algorithm
- Applying Data Refinement for Monadic Programs to Hopcroft’s Algorithm
- Mechanised Separation Algebra
- Lifting and Transfer: A Modular Design for Quotients in Isabelle/HOL
- Refinement to Imperative/HOL
- Iris from the ground up: A modular foundation for higher-order concurrent separation logic
- Efficient Verified Implementation of Introsort and Pdqsort
- Permission accounting in separation logic
- CONCUR 2004 - Concurrency Theory
- Automatic Data Refinement
- The Isabelle Collections Framework
- Automated deduction -- CADE 29. 29th international conference on automated deduction, Rome, Italy, July 1--4, 2023. Proceedings
- A Generic Approach to the Verification of the Permutation Property of Sequential and Parallel Swap-Based Sorting Algorithms
- Refinement of parallel algorithms down to LLVM
This page was built for publication: Refinement of parallel algorithms down to LLVM: applied to practically efficient parallel sorting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6611962)
