A Quadratic Lower Bound for Simulation
Fuente:
arXiv
Saved in:
| Main Authors: | Groote, Jan Friso, Martens, Jan |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
A Complete Axiomatization of Branching Bisimilarity for a Simple Process Language with Probabilistic Choice
by: van Glabbeek, Rob, et al.
Published: (2025)
by: van Glabbeek, Rob, et al.
Published: (2025)
Proving Cutoff Bounds for Safety Properties in First-Order Logic
by: Lotan, Raz, et al.
Published: (2024)
by: Lotan, Raz, et al.
Published: (2024)
Formal Verification of COO to CSR Sparse Matrix Conversion (Invited Paper)
by: Appel, Andrew W.
Published: (2025)
by: Appel, Andrew W.
Published: (2025)
Implicit Rankings for Verifying Liveness Properties in First-Order Logic
by: Lotan, Raz, et al.
Published: (2024)
by: Lotan, Raz, et al.
Published: (2024)
Verifying First-Order Temporal Properties of Infinite-State Systems via Timers and Rankings
by: Lotan, Raz, et al.
Published: (2026)
by: Lotan, Raz, et al.
Published: (2026)
Exponential Resolution Lower Bounds for Weak Pigeonhole Principle and Perfect Matching Formulas over Sparse Graphs
by: de Rezende, Susanna F., et al.
Published: (2019)
by: de Rezende, Susanna F., et al.
Published: (2019)
The Autonomous Data Language -- Concepts, Design and Formal Verification
by: Franken, Tom T. P., et al.
Published: (2025)
by: Franken, Tom T. P., et al.
Published: (2025)
Dormancy-aware timed branching bisimilarity, with an application to communication protocol analysis
by: Middelburg, C. A.
Published: (2021)
by: Middelburg, C. A.
Published: (2021)
Calculational Design of Hyperlogics by Abstract Interpretation
by: Cousot, Patrick, et al.
Published: (2024)
by: Cousot, Patrick, et al.
Published: (2024)
Safety, Relative Tightness and the Probabilistic Frame Rule
by: Jereb, Janez Ignacij, et al.
Published: (2025)
by: Jereb, Janez Ignacij, et al.
Published: (2025)
Relation-Algebraic Verification of Disjoint-Set Forests
by: Guttmann, Walter
Published: (2023)
by: Guttmann, Walter
Published: (2023)
Chronology as a Consistency Invariant in Composable Information Systems
by: Calvo, Anherutowa, et al.
Published: (2026)
by: Calvo, Anherutowa, et al.
Published: (2026)
Modelling Recursion and Probabilistic Choice in Guarded Type Theory
by: Stassen, Philipp Jan Andries, et al.
Published: (2024)
by: Stassen, Philipp Jan Andries, et al.
Published: (2024)
Formally Modelling the Rijkswaterstaat Tunnel Control Systems in a Constrained Industrial Environment
by: Jilissen, Kevin H. J., et al.
Published: (2024)
by: Jilissen, Kevin H. J., et al.
Published: (2024)
Fracterm Calculus for Partial Meadows
by: Bergstra, Jan A., et al.
Published: (2025)
by: Bergstra, Jan A., et al.
Published: (2025)
Conditional logic as a short-circuit logic
by: Bergstra, Jan A., et al.
Published: (2023)
by: Bergstra, Jan A., et al.
Published: (2023)
Inductive First-Order Formula Synthesis by ASP: A Case Study in Invariant Inference
by: Yang, Ziyi, et al.
Published: (2026)
by: Yang, Ziyi, et al.
Published: (2026)
Propositional logic with short-circuit evaluation: a non-commutative and a commutative variant
by: Bergstra, Jan A., et al.
Published: (2018)
by: Bergstra, Jan A., et al.
Published: (2018)
Infinitary Refinement Types for Temporal Properties in Scott Domains
by: Riba, Colin, et al.
Published: (2025)
by: Riba, Colin, et al.
Published: (2025)
Separation Logic of Generic Resources via Sheafeology
by: van Starkenburg, Berend, et al.
Published: (2025)
by: van Starkenburg, Berend, et al.
Published: (2025)
Unified Fairness for Weak Memory Verification
by: Abdulla, Parosh Aziz, et al.
Published: (2023)
by: Abdulla, Parosh Aziz, et al.
Published: (2023)
A Rust-to-Lean Verification Pipeline with AI Provers: An Experience Report
by: Klaus, Natalia, et al.
Published: (2026)
by: Klaus, Natalia, et al.
Published: (2026)
Constrained LTL Specification Learning from Examples
by: Zhang, Changjian, et al.
Published: (2024)
by: Zhang, Changjian, et al.
Published: (2024)
Forall-Exists Relational Verification by Filtering to Forall-Forall
by: Nagasamudram, Ramana, et al.
Published: (2025)
by: Nagasamudram, Ramana, et al.
Published: (2025)
Bayesian Separation Logic
by: Ho, Shing Hin, et al.
Published: (2025)
by: Ho, Shing Hin, et al.
Published: (2025)
Explicit Weakening
by: Wadler, Philip
Published: (2024)
by: Wadler, Philip
Published: (2024)
A Graded Modal Type Theory for Pulse Schedules
by: Adams, Robin, et al.
Published: (2025)
by: Adams, Robin, et al.
Published: (2025)
Formal Methods for Mobile Ad Hoc Networks: A Survey
by: Fokkink, Wan, et al.
Published: (2025)
by: Fokkink, Wan, et al.
Published: (2025)
FastLEC: Parallel Datapath Equivalence Checking with Hybrid Engines
by: Zhang, Xindi, et al.
Published: (2025)
by: Zhang, Xindi, et al.
Published: (2025)
On the Satisfaction Probabilities of $k$-CNF Formulas
by: Tantau, Till
Published: (2022)
by: Tantau, Till
Published: (2022)
Constant time testability of first-order logic with modulo counting on finitary graphs
by: Adler, Isolde, et al.
Published: (2026)
by: Adler, Isolde, et al.
Published: (2026)
Non-Ground Congruence Closure
by: Leidinger, Hendrik, et al.
Published: (2024)
by: Leidinger, Hendrik, et al.
Published: (2024)
Automating the Derivation of Unification Algorithms: A Case Study in Deductive Program Synthesis
by: Waldinger, Richard
Published: (2025)
by: Waldinger, Richard
Published: (2025)
Monitoring Unmanned Aircraft: Specification, Integration, and Lessons-learned
by: Baumeister, Jan, et al.
Published: (2024)
by: Baumeister, Jan, et al.
Published: (2024)
Complementing an imperative process algebra with a rely/guarantee logic
by: Middelburg, C. A.
Published: (2025)
by: Middelburg, C. A.
Published: (2025)
Probabilistic imperative process algebra
by: Middelburg, C. A.
Published: (2026)
by: Middelburg, C. A.
Published: (2026)
Ranking Functions for Linear-Constraint Loops
by: Ben-Amram, Amir M., et al.
Published: (2012)
by: Ben-Amram, Amir M., et al.
Published: (2012)
Ohana trees, linear approximation and multi-types for the $λ$I-calculus: No variable gets left behind or forgotten!
by: Cerda, Rémy, et al.
Published: (2025)
by: Cerda, Rémy, et al.
Published: (2025)
Fully Evaluated Left-Sequential Logics
by: Ponse, Alban, et al.
Published: (2024)
by: Ponse, Alban, et al.
Published: (2024)
Intrinsically Correct Sorting in Cubical Agda
by: Alexandru, Cass, et al.
Published: (2024)
by: Alexandru, Cass, et al.
Published: (2024)
Similar Items
-
A Complete Axiomatization of Branching Bisimilarity for a Simple Process Language with Probabilistic Choice
by: van Glabbeek, Rob, et al.
Published: (2025) -
Proving Cutoff Bounds for Safety Properties in First-Order Logic
by: Lotan, Raz, et al.
Published: (2024) -
Formal Verification of COO to CSR Sparse Matrix Conversion (Invited Paper)
by: Appel, Andrew W.
Published: (2025) -
Implicit Rankings for Verifying Liveness Properties in First-Order Logic
by: Lotan, Raz, et al.
Published: (2024) -
Verifying First-Order Temporal Properties of Infinite-State Systems via Timers and Rankings
by: Lotan, Raz, et al.
Published: (2026)