Imagen de Portada

Refinement orders for quantum programs

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Feng, Yuan, Zhou, Li
Formato:	Preprint
Publicado:	2025
Materias:	Logic in Computer Science Quantum Physics F.3.1
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

A Complete Axiomatization of Branching Bisimilarity for a Simple Process Language with Probabilistic Choice
por: van Glabbeek, Rob, et al.
Publicado: (2025)

U-Turn: Enhancing Incorrectness Analysis by Reversing Direction
por: Ascari, Flavio, et al.
Publicado: (2025)

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

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

Sufficient Incorrectness Logic: SIL and Separation SIL
por: Ascari, Flavio, et al.
Publicado: (2023)

Centralized vs Decentralized Monitors for Hyperproperties
por: Aceto, Luca, et al.
Publicado: (2024)

Safe Composition of Systems of Communicating Finite State Machines
por: Barbanera, Franco, et al.
Publicado: (2024)

Embedding Differential Dynamic Logic in PVS
por: Slagel, J. Tanner, et al.
Publicado: (2024)

Loop Termination and Generalized Collatz Sequences
por: Carelli, Mishel
Publicado: (2026)

Uniform Substitution for Differential Refinement Logic
por: Prebet, Enguerrand, et al.
Publicado: (2024)

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

Relation-Algebraic Verification of Disjoint-Set Forests
por: Guttmann, Walter
Publicado: (2023)

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

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

Refactoring-as-Propositions: Proved Refactoring of Hybrid Systems via Proved Refinements
por: Prebet, Enguerrand, et al.
Publicado: (2026)

A Real-Analytic Approach to Differential-Algebraic Dynamic Logic
por: Hellwig, Jonathan, et al.
Publicado: (2025)

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

The General and Finite Satisfiability Problems for PCTL are Undecidable
por: Chodil, Miroslav, et al.
Publicado: (2024)

The Thins Ordering on Relations
por: Voermans, Ed, et al.
Publicado: (2024)

Diagonals and Block-Ordered Relations
por: Backhouse, Roland, et al.
Publicado: (2024)

The Index and Core of a Relation. With Applications to the Axiomatics of Relation Algebra
por: Backhouse, Roland, et al.
Publicado: (2023)

Probabilistic Epistemic Dynamic Agentive Logic
por: Logan, Shay Allen
Publicado: (2026)

Symmetries in Sorting
por: Choudhury, Vikraman, et al.
Publicado: (2025)

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

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

Generically Automating Separation Logic by Functors, Homomorphisms and Modules
por: Xu, Qiyuan, et al.
Publicado: (2024)

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

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

An example of goal-directed, calculational proof
por: Backhouse, Roland, et al.
Publicado: (2023)

Bounded Modal Logic
por: Murase, Yuito, et al.
Publicado: (2026)

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

Propositional Dynamic Logic has Craig Interpolation: a tableau-based proof
por: Borzechowski, Manfred, et al.
Publicado: (2025)

Simple Types for Polymorphic Functions
por: Jay, Barry, et al.
Publicado: (2026)

How to Verify a Turing Machine with Dafny
por: Lederer, Edgar F. A.
Publicado: (2026)

Non-Numerical Weakly Relational Domains
por: Seidl, Helmut, et al.
Publicado: (2024)

Non-Ground Congruence Closure
por: Leidinger, Hendrik, et al.
Publicado: (2024)

Well-Scoped Locally Nameless Representation of Syntax
por: Pitts, Andrew M.
Publicado: (2026)

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

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