Cover Image

Formal Verification of COO to CSR Sparse Matrix Conversion (Invited Paper)

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Appel, Andrew W.
Format:	Preprint
Published:	2025
Subjects:	Numerical Analysis Logic in Computer Science F.3.1; F.2.2; G.1.3
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A Quadratic Lower Bound for Simulation
by: Groote, Jan Friso, et al.
Published: (2024)

Dormancy-aware timed branching bisimilarity, with an application to communication protocol analysis
by: Middelburg, C. A.
Published: (2021)

Exponential Resolution Lower Bounds for Weak Pigeonhole Principle and Perfect Matching Formulas over Sparse Graphs
by: de Rezende, Susanna F., et al.
Published: (2019)

Relation-Algebraic Verification of Disjoint-Set Forests
by: Guttmann, Walter
Published: (2023)

Unified Fairness for Weak Memory Verification
by: Abdulla, Parosh Aziz, et al.
Published: (2023)

Complementing an imperative process algebra with a rely/guarantee logic
by: Middelburg, C. A.
Published: (2025)

Probabilistic imperative process algebra
by: Middelburg, C. A.
Published: (2026)

On the Satisfaction Probabilities of $k$-CNF Formulas
by: Tantau, Till
Published: (2022)

A Rust-to-Lean Verification Pipeline with AI Provers: An Experience Report
by: Klaus, Natalia, et al.
Published: (2026)

Semi-Automated Modular Formal Verification of Critical Software: Liveness and Completeness Thresholds
by: Reinhard, Tobias
Published: (2024)

Forall-Exists Relational Verification by Filtering to Forall-Forall
by: Nagasamudram, Ramana, et al.
Published: (2025)

Safety, Relative Tightness and the Probabilistic Frame Rule
by: Jereb, Janez Ignacij, et al.
Published: (2025)

Calculational Design of Hyperlogics by Abstract Interpretation
by: Cousot, Patrick, et al.
Published: (2024)

From Zonotopes to Proof Certificates: A Formal Pipeline for Safe Control Envelopes
by: Hellwig, Jonathan, et al.
Published: (2025)

Separation Logic of Generic Resources via Sheafeology
by: van Starkenburg, Berend, et al.
Published: (2025)

Chronology as a Consistency Invariant in Composable Information Systems
by: Calvo, Anherutowa, et al.
Published: (2026)

Verifying First-Order Temporal Properties of Infinite-State Systems via Timers and Rankings
by: Lotan, Raz, et al.
Published: (2026)

Proving Cutoff Bounds for Safety Properties in First-Order Logic
by: Lotan, Raz, et al.
Published: (2024)

Implicit Rankings for Verifying Liveness Properties in First-Order Logic
by: Lotan, Raz, et al.
Published: (2024)

Infinitary Refinement Types for Temporal Properties in Scott Domains
by: Riba, Colin, et al.
Published: (2025)

Reasoning about distributive laws in a concurrent refinement algebra
by: Meinicke, Larissa A., et al.
Published: (2024)

Restructuring a concurrent refinement algebra
by: Hayes, Ian J., et al.
Published: (2024)

A Type Theory for Probabilistic and Bayesian Reasoning
by: Adams, Robin, et al.
Published: (2015)

Inductive First-Order Formula Synthesis by ASP: A Case Study in Invariant Inference
by: Yang, Ziyi, et al.
Published: (2026)

Explicit Weakening
by: Wadler, Philip
Published: (2024)

Verification of E-Voting Algorithms in Dafny
by: Büttner, Robert, et al.
Published: (2025)

A SAT-based Approach for Specification, Analysis, and Justification of Reductions between NP-complete Problems
by: Janičić, Predrag
Published: (2025)

Formal Methods for Mobile Ad Hoc Networks: A Survey
by: Fokkink, Wan, et al.
Published: (2025)

Faster Inversion and Other Black Box Matrix Computations Using Efficient Block Projections
by: Eberly, Wayne, et al.
Published: (2007)

Constrained LTL Specification Learning from Examples
by: Zhang, Changjian, et al.
Published: (2024)

Imperative process algebra and models of computation
by: Middelburg, C. A.
Published: (2022)

Efficient Solving of Quantified Inequality Constraints over the Real Numbers
by: Ratschan, Stefan
Published: (2002)

Modelling Recursion and Probabilistic Choice in Guarded Type Theory
by: Stassen, Philipp Jan Andries, et al.
Published: (2024)

Bayesian Separation Logic
by: Ho, Shing Hin, et al.
Published: (2025)

A Graded Modal Type Theory for Pulse Schedules
by: Adams, Robin, et al.
Published: (2025)

Non-Ground Congruence Closure
by: Leidinger, Hendrik, et al.
Published: (2024)

Gradual C0: Symbolic Execution for Gradual Verification
by: DiVincenzo, Jenna, et al.
Published: (2022)

Solving Sparse, Symmetric, Diagonally-Dominant Linear Systems in Time $O (m^{1.31})$
by: Spielman, Daniel A., et al.
Published: (2003)

FastLEC: Parallel Datapath Equivalence Checking with Hybrid Engines
by: Zhang, Xindi, et al.
Published: (2025)

Just Verification of Mutual Exclusion Algorithms with (Non-)Blocking and (Non-)Atomic Registers
by: van Glabbeek, Rob, et al.
Published: (2026)