Image de couverture de livre

Weakly acyclic diagrams: A data structure for infinite-state symbolic verification

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Blondin, Michael, Cadilhac, Michaël, Cui, Xin-Yi, Czerner, Philipp, Esparza, Javier, Schulz, Jakob
Format:	Preprint
Publié:	2024
Sujets:	Logic in Computer Science Data Structures and Algorithms F.4.3; E.1
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Data Structures for Finite Downsets of Natural Vectors: Theory and Practice
par: Cadilhac, Michaël, et autres
Publié: (2025)

Scalable Learning of One-Counter Automata via State-Merging Algorithms
par: Guha, Shibashis, et autres
Publié: (2025)

First Order Logic on Pathwidth Revisited Again
par: Lampis, Michael
Publié: (2022)

Fine-grained Meta-Theorems for Vertex Integrity
par: Lampis, Michael, et autres
Publié: (2021)

Foundations for an Abstract Proof Theory in the Context of Horn Rules
par: Lyon, Tim S., et autres
Publié: (2023)

Exact Exploration
par: Blass, Andreas, et autres
Publié: (2024)

iSMC: A BDD-based Symbolic Model Checker with Interactive Certification
par: Czerner, Philipp, et autres
Publié: (2026)

Algorithms and Complexity of Difference Logic
par: Dabrowski, Konrad K., et autres
Publié: (2024)

Subgraph Isomorphism: Prolog vs. Conventional
par: Yin, Claire Y., et autres
Publié: (2025)

The Sherali-Adams and Weisfeiler-Leman hierarchies in (Promise Valued) Constraint Satisfaction Problems
par: Barto, Libor, et autres
Publié: (2024)

Efficient Coalgebraic Partition Refinement
par: Dorsch, Ulrich, et autres
Publié: (2017)

Derivation and Verification of Array Sorting by Merging, and its Certification in Dafny
par: Carbonell, Juan Pablo, et autres
Publié: (2025)

Model checking with temporal graphs and their derivative
par: Bui-Xuan, Binh-Minh, et autres
Publié: (2026)

MSO Queries on Trees: Enumerating Answers under Updates Using Forest Algebras
par: Kleest-Meißner, Sarah, et autres
Publié: (2022)

Approximate Model Counting, Sparse XOR Constraints and Minimum Distance
par: Boreale, Michele, et autres
Publié: (2019)

Maintaining $\mathsf{CMSO}_2$ properties on dynamic structures with bounded feedback vertex number
par: Majewski, Konrad, et autres
Publié: (2021)

Highway Preferential Attachment Models for Geographic Routing
par: Gila, Ofek, et autres
Publié: (2024)

Zip-zip Trees: Making Zip Trees More Balanced, Biased, Compact, or Persistent
par: Gila, Ofek, et autres
Publié: (2023)

Elementary first-order model checking for sparse graphs
par: Gajarský, Jakub, et autres
Publié: (2024)

On merge-models
par: Buffière, Hector, et autres
Publié: (2026)

CNFs and DNFs with Exactly $k$ Solutions
par: Chandran, L. Sunil, et autres
Publié: (2025)

Flipper games for monadically stable graph classes
par: Gajarský, Jakub, et autres
Publié: (2023)

Fast Geographic Routing in Fixed-Growth Graphs
par: Gila, Ofek, et autres
Publié: (2025)

A (Weakly) Polynomial Algorithm for AIVF Coding
par: Dolatabadi, Reza Hosseini, et autres
Publié: (2024)

Ranked Enumeration for MSO on Trees via Knowledge Compilation
par: Amarilli, Antoine, et autres
Publié: (2023)

Direct Access for Answers to Conjunctive Queries with Aggregation
par: Eldar, Idan, et autres
Publié: (2023)

Factorised Representations of Join Queries: Tight Bounds and a New Dichotomy
par: Berkholz, Christoph, et autres
Publié: (2025)

Separators in Continuous Petri Nets
par: Blondin, Michael, et autres
Publié: (2022)

Formal Primal-Dual Algorithm Analysis
par: Abdulaziz, Mohammad, et autres
Publié: (2026)

Toward a Uniform Algorithm and Uniform Reduction for Constraint Problems
par: Barto, Libor, et autres
Publié: (2026)

Color Refinement for Relational Structures
par: Scheidt, Benjamin, et autres
Publié: (2024)

Quadratic Sums-of-Powers for Fixed-Parameter Tractable Quantum-Circuit Simulation
par: de Colnet, Alexis, et autres
Publié: (2026)

The Iteration Number of the Weisfeiler-Leman Algorithm
par: Grohe, Martin, et autres
Publié: (2023)

Asymptotically Smaller Encodings for Graph Problems and Scheduling
par: Subercaseaux, Bernardo
Publié: (2025)

Compressing CFI Graphs and Lower Bounds for the Weisfeiler-Leman Refinements
par: Grohe, Martin, et autres
Publié: (2023)

A bargain for mergesorts -- How to prove your mergesort correct and stable, almost for free
par: Cohen, Cyril, et autres
Publié: (2024)

Automated Expected Amortised Cost Analysis of Probabilistic Data Structures
par: Leutgeb, Lorenz, et autres
Publié: (2022)

On classes of bounded tree rank, their interpretations, and efficient sparsification
par: Gajarský, Jakub, et autres
Publié: (2024)

New Algorithms and Hardness Results for Robust Satisfiability of (Promise) CSPs
par: Brakensiek, Joshua, et autres
Publié: (2026)

Beyond Value Iteration for Parity Games: Strategy Iteration with Universal Trees
par: Koh, Zhuan Khye, et autres
Publié: (2021)