Cover Image

TensorRight: Automated Verification of Tensor Graph Rewrites

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Arora, Jai, Lu, Sirui, Jain, Devansh, Xu, Tianfan, Houshmand, Farzin, Phothilimthana, Phitchaya Mangpo, Lesani, Mohsen, Narayanan, Praveen, Murthy, Karthik Srinivasa, Bodik, Rastislav, Sabne, Amit, Mendis, Charith
Format:	Preprint
Published:	2025
Subjects:	Programming Languages F.3.1; F.3.2; D.3.4
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Compile-Time Tensor Shape Checking via Staged Shape-Dependent Types
by: Suwa, Takashi, et al.
Published: (2026)

Generalized Tensor Completion with Non-Random Missingness
by: Zhang, Maoyu, et al.
Published: (2025)

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

Controlling Copatterns: There and Back Again (Extended Version)
by: Downen, Paul
Published: (2025)

Weak-Linear Types
by: Gramaglia, Hector
Published: (2024)

Accelerating Verified-Compiler Development with a Verified Rewriting Engine
by: Gross, Jason, et al.
Published: (2022)

Organic mater measured in surface water during AURIGA cruise PLUTUR3
by: OMEX Project Members, et al.
Published: (2004)

Modelling Distributed Applications with Mixed-Choice Stateful Typestates
by: Parrinha, Francisco, et al.
Published: (2026)

Partial Typing for Asynchronous Multiparty Sessions
by: Barbanera, Franco, et al.
Published: (2024)

Replicate, Reuse, Repeat: Capturing Non-Linear Communication via Session Types and Graded Modal Types
by: Marshall, Danielle, et al.
Published: (2022)

Probability and Angelic Nondeterminism with Multiset Semantics
by: Ong, Shawn, et al.
Published: (2024)

Weak-linearity, globality and in-place update
by: Gramaglia, Hector
Published: (2024)

LeanLTL: A unifying framework for linear temporal logics in Lean
by: Vin, Eric, et al.
Published: (2025)

What does it take to certify a conversion checker?
by: Lennon-Bertrand, Meven
Published: (2025)

Foundational Verification of Smart Contracts through Verified Compilation
by: Sjöberg, Vilhelm, et al.
Published: (2024)

Towards New Characterizations of Small Circuit Classes via Discrete Ordinary Differential Equations
by: Antonelli, Melissa, et al.
Published: (2025)

Complexity Classes Arising from Circuits over Finite Algebraic Structures
by: Kawałek, Piotr, et al.
Published: (2026)

Fair Termination of Asynchronous Binary Sessions
by: Padovani, Luca, et al.
Published: (2025)

Nominal Algebraic-Coalgebraic Data Types, with Applications to Infinitary Lambda-Calculi
by: Cerda, Rémy
Published: (2025)

Gradual Guarantee via Step-Indexed Logical Relations in Agda
by: Siek, Jeremy G.
Published: (2024)

Proof-Carrying Neuro-Symbolic Code
by: Komendantskaya, Ekaterina
Published: (2025)

Definitional Functoriality for Dependent (Sub)Types -- Extended version
by: Laurent, Théo, et al.
Published: (2023)

Simple Types for Polymorphic Functions
by: Jay, Barry, et al.
Published: (2026)

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

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

Trocq: Proof Transfer for Free, With or Without Univalence
by: Cohen, Cyril, et al.
Published: (2023)

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

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

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

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

Totality for Mixed Inductive and Coinductive Types
by: Hyvernat, Pierre
Published: (2019)

Fair Termination for Resource-Aware Active Objects
by: Dagnino, Francesco, et al.
Published: (2025)

Qurts: Automatic Quantum Uncomputation by Affine Types with Lifetime
by: Hirata, Kengo, et al.
Published: (2024)

Regular Model Checking for Systems with Effectively Regular Reachability Relation
by: Esparza, Javier, et al.
Published: (2025)

Non-reducible Modal Transition Systems
by: Basile, Davide
Published: (2023)

Learning real-time one-counter automata using polynomially many queries
by: Mathew, Prince, et al.
Published: (2024)

Local Reasoning about Probabilistic Behaviour for Classical-Quantum Programs
by: Wu, Huiling, et al.
Published: (2023)

Turn Complexity of Context-free Languages, Pushdown Automata and One-Counter Automata
by: Pighizzini, Giovanni
Published: (2026)

Regular Expressions with Backreferences: Polynomial-Time Matching Techniques
by: Schmid, Markus L.
Published: (2019)

Closure Conversion, Flat Environments, and the Complexity of Abstract Machines
by: Accattoli, Beniamino, et al.
Published: (2025)