Cover Image

Fast Ramsey Quantifier Elimination in LIRA (with applications to liveness checking)

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Lichtner, Kilian, Bergsträßer, Pascal, Ganardi, Moses, Lin, Anthony W., Zetzsche, Georg
Format:	Preprint
Published:	2025
Subjects:	Logic in Computer Science Formal Languages and Automata Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Existential Definability over the Subword Ordering
by: Baumann, Pascal, et al.
Published: (2022)

Length Generalization Bounds for Transformers
by: Yang, Andy, et al.
Published: (2026)

Transformers are Inherently Succinct
by: Bergsträßer, Pascal, et al.
Published: (2025)

The Power of Hard Attention Transformers on Data Sequences: A Formal Language Theoretic Perspective
by: Bergsträßer, Pascal, et al.
Published: (2024)

Directed Regular and Context-Free Languages
by: Ganardi, Moses, et al.
Published: (2024)

Slice closures of indexed languages and word equations with counting constraints
by: Ciobanu, Laura, et al.
Published: (2024)

An efficient quantifier elimination procedure for Presburger arithmetic
by: Haase, Christoph, et al.
Published: (2024)

Softmax Transformers are Turing-Complete
by: Jiang, Hongjian, et al.
Published: (2025)

General Decidability Results for Systems with Continuous Counters
by: Balasubramanian, A. R., et al.
Published: (2025)

A Complexity Dichotomy for Semilinear Target Sets in Automata with One Counter
by: Shakiba, Yousef, et al.
Published: (2025)

The complexity of downward closures of indexed languages
by: Mandel, Richard, et al.
Published: (2026)

Parikh's Theorem Made Symbolic
by: Hague, Matthew, et al.
Published: (2023)

Generalised Quantifiers Based on Rabin-Mostowski Index
by: Kuperberg, Denis, et al.
Published: (2026)

HornStr: Invariant Synthesis for Regular Model Checking as Constrained Horn Clauses(Technical Report)
by: Jiang, Hongjian, et al.
Published: (2025)

A Subclass of Mu-Calculus with the Freeze Quantifier Equivalent to Buchi Register Automata
by: Takata, Yoshiaki, et al.
Published: (2024)

Fast Obligation Translation and Synthesis
by: Duret-Lutz, Alexandre, et al.
Published: (2026)

On the Impact of the Communication Model on Realisability
by: Di Giusto, Cinzia, et al.
Published: (2025)

Module checking of pushdown multi-agent systems
by: Bozzelli, Laura, et al.
Published: (2020)

Simple grammar bisimilarity, with an application to session type equivalence
by: Poças, Diogo, et al.
Published: (2024)

Infinite-state Games with Energy Objectives Beyond Counters
by: Sağlam, Irmak, et al.
Published: (2026)

Synthesizing POMDP Policies: Sampling Meets Model-checking via Learning
by: Chakraborty, Debraj, et al.
Published: (2026)

On the complexity of computing Strahler numbers
by: Ganardi, Moses, et al.
Published: (2025)

Dynamic Programming for Symbolic Boolean Realizability and Synthesis
by: Lin, Yi, et al.
Published: (2024)

Bounded treewidth, multiple context-free grammars, and downward closures
by: Aiswarya, C., et al.
Published: (2025)

A cyclic proof system for Guarded Kleene Algebra with Tests (full version)
by: Rooduijn, Jan, et al.
Published: (2024)

A proof theory of right-linear (omega-)grammars via cyclic proofs
by: Das, Anupam, et al.
Published: (2024)

The Alternation Hierarchy of First-Order Logic on Words is Decidable
by: Barloy, Corentin, et al.
Published: (2025)

Positive First-order Logic on Words and Graphs
by: Kuperberg, Denis
Published: (2022)

An algebraic theory of ω-regular languages, via μν-expressions
by: Das, Anupam, et al.
Published: (2025)

Function spaces for orbit-finite sets
by: Bojańczyk, Mikołaj, et al.
Published: (2024)

Cyclic system for an algebraic theory of alternating parity automata
by: Das, Anupam, et al.
Published: (2025)

Parameterized Verification of Quantum Circuits (Technical Report)
by: Abdulla, Parosh Aziz, et al.
Published: (2025)

AutoQ 2.0: From Verification of Quantum Circuits to Verification of Quantum Programs (Technical Report)
by: Chen, Yu-Fang, et al.
Published: (2024)

Verifying Quantum Circuits with Level-Synchronized Tree Automata (Technical Report)
by: Abdulla, Parosh Aziz, et al.
Published: (2024)

Regular Languages in the Sliding Window Model
by: Ganardi, Moses, et al.
Published: (2024)

Model-checking real-time systems: revisiting the alternating automaton route
by: Bouyer, Patricia, et al.
Published: (2025)

The complexity of separability for semilinear sets and Parikh automata
by: Collins, Elias Rojas, et al.
Published: (2024)

The Role of Logic and Automata in Understanding Transformers
by: Lin, Anthony W., et al.
Published: (2025)

A Dichotomy Theorem for Automatic Structures
by: Cuvelier, Antoine, et al.
Published: (2026)

The Queue Automaton Revisited
by: Baeten, Jos C. M., et al.
Published: (2025)