Image de couverture de livre

Proving Behavioural Apartness

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Turkenburg, Ruben, Beohar, Harsh, Kupke, Clemens, Rot, Jurriaan
Format:	Preprint
Publié:	2024
Sujets:	Logic in Computer Science
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Constructing Witnesses for Lower Bounds on Behavioural Distances
par: Turkenburg, Ruben, et autres
Publié: (2025)

Relating Apartness and Branching Bisimulation Games
par: Rot, Jurriaan, et autres
Publié: (2024)

A Categorical Approach to Coalgebraic Fixpoint Logic
par: Schoen, Ezra, et autres
Publié: (2024)

Trees in Coalgebra from Generalized Reachability
par: Wißmann, Thorsten, et autres
Publié: (2025)

Expressivity of bisimulation pseudometrics over analytic state spaces
par: Luckhardt, Daniel, et autres
Publié: (2025)

Tree Automata Acceptance up to Measurable Defect
par: Moyasari, Anita, et autres
Publié: (2026)

Graded Monads and Behavioural Equivalence Games
par: Ford, Chase, et autres
Publié: (2022)

Small Test Suites for Active Automata Learning
par: Kruger, Loes, et autres
Publié: (2024)

On Tools for Completeness of Kleene Algebra with Hypotheses
par: Pous, Damien, et autres
Publié: (2022)

Initial Algebra Correspondence under Reachability Conditions
par: Kori, Mayuko, et autres
Publié: (2025)

Complete Test Suites for Automata in Monoidal Closed Categories
par: Kocsis, Bálint, et autres
Publié: (2024)

On Kleisli liftings and decorated trace semantics
par: Luckhardt, Daniel, et autres
Publié: (2024)

Correspondences between codensity and coupling-based liftings, a practical approach
par: Humeau, Samuel, et autres
Publié: (2024)

State Matching and Multiple References in Adaptive Active Automata Learning
par: Kruger, Loes, et autres
Publié: (2024)

Error-awareness Accelerates Active Automata Learning
par: Kruger, Loes, et autres
Publié: (2026)

A Unifying Approach to Product Constructions for Quantitative Temporal Inference
par: Watanabe, Kazuki, et autres
Publié: (2024)

Relative fixed points of functors
par: Schoen, Ezra, et autres
Publié: (2023)

Pareto Curves for Compositionally Model Checking String Diagrams of MDPs
par: Watanabe, Kazuki, et autres
Publié: (2024)

Composing Codensity Bisimulations
par: Kori, Mayuko, et autres
Publié: (2024)

Expressive Quantale-valued Logics for Coalgebras: an Adjunction-based Approach
par: Beohar, Harsh, et autres
Publié: (2023)

Incremental Fingerprinting in an Open World
par: Kruger, Loes, et autres
Publié: (2026)

LLM-Powered Automatic Theorem Proving and Synthesis for Hybrid Systems and Game
par: Kabra, Aditi, et autres
Publié: (2026)

Quantitative Graded Semantics and Spectra of Behavioural Metrics
par: Forster, Jonas, et autres
Publié: (2023)

On the Complexity of Proving Polyhedral Reductions
par: Amat, Nicolas, et autres
Publié: (2023)

Intrinsically Correct Sorting in Cubical Agda
par: Alexandru, Cass, et autres
Publié: (2024)

Equational Theorem Proving for Clauses over Strings
par: Kim, Dohan
Publié: (2023)

Towards Proving Liveness on Weak Memory (Extended Version)
par: Bargmann, Lara, et autres
Publié: (2026)

Apartness relations between propositions
par: Kocsis, Zoltan A.
Publié: (2022)

Hyper Hoare Logic: (Dis-)Proving Program Hyperproperties (extended version)
par: Dardinier, Thibault, et autres
Publié: (2023)

Expansion Laws for Forward-Reverse, Forward, and Reverse Bisimilarities via Proved Encodings
par: Bernardo, Marco, et autres
Publié: (2024)

A Coinductive Reformulation of Milner's Proof System for Regular Expressions Modulo Bisimilarity
par: Grabmayer, Clemens
Publié: (2022)

Proving Confluence in the Confluence Framework with CONFident
par: Gutiérrez, Raúl, et autres
Publié: (2023)

Automated Theorem Proving for Prolog Verification
par: Mesnard, Fred, et autres
Publié: (2026)

Relational Connectors and Heterogeneous Bisimulations
par: Nora, Pedro, et autres
Publié: (2024)

A Formal Model to Prove Instantiation Termination for E-matching-Based Axiomatisations (Extended Version)
par: Ge, Rui, et autres
Publié: (2024)

Partial Label Learning for Automated Theorem Proving
par: Zombori, Zsolt, et autres
Publié: (2025)

Proving Circuit Functional Equivalence in Zero Knowledge
par: Shen, Sirui, et autres
Publié: (2026)

Discover and Prove: An Open-source Agentic Framework for Hard Mode Automated Theorem Proving in Lean 4
par: Liu, Chengwu, et autres
Publié: (2026)

Verifying Quantum Phase Estimation (QPE) using Prove-It
par: Witzel, Wayne M., et autres
Publié: (2023)

MerLean-Prover: A Recursive Looping Harness for Lean 4 Theorem Proving
par: Li, Jinzheng, et autres
Publié: (2026)