Cover Image

Effective MSO-Definability for Tree-width Bounded Models of an Inductive Separation Logic of Relations

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Bueri, Lucas, Iosif, Radu, Zuleger, Florian
Format:	Preprint
Published:	2024
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

The Treewidth Boundedness Problem for an Inductive Separation Logic of Relations
by: Bozga, Marius, et al.
Published: (2023)

Characterizations of Monadic Second Order Definable Context-Free Sets of Graphs
by: Iosif, Radu, et al.
Published: (2023)

Tree-Verifiable Graph Grammars
by: Chimes, Mark, et al.
Published: (2024)

Regular Grammars as Effective Representations of Recognizable Sets of Series-Parallel Graphs
by: Bozga, Marius, et al.
Published: (2026)

Regular Grammars for Sets of Graphs of Tree-Width 2
by: Bozga, Marius, et al.
Published: (2024)

The structure of polynomial growth for tree automata/transducers and MSO set queries
by: Gallot, Paul, et al.
Published: (2025)

Iterating Non-Aggregative Structure Compositions
by: Bozga, Marius, et al.
Published: (2025)

Aperiodicity, Star-freeness, and First-order Logic Definability of Operator Precedence Languages
by: Mandrioli, Dino, et al.
Published: (2020)

HistMSO: A Logic for Reasoning about Consistency Models with MONA
by: Coget, Isabelle, et al.
Published: (2026)

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

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

Characterization and Decidability of FC-Definable Regular Languages
by: Thompson, Sam M., et al.
Published: (2025)

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

An Automaton-based Characterisation of First-Order Logic over Infinite Trees
by: Benerecetti, Massimo, et al.
Published: (2025)

Automaton-based Characterisations of First Order Logic over Infinite Trees
by: Benerecetti, Massimo, et al.
Published: (2026)

Logics for Context-free Hyperproperties
by: Winter, Sarah, et al.
Published: (2026)

Positional Properties in Temporal Logic
by: Newman, Jessica, et al.
Published: (2026)

Robust Probabilistic Temporal Logics
by: Zimmermann, Martin
Published: (2023)

Separators in Continuous Petri Nets
by: Blondin, Michael, et al.
Published: (2022)

Logic and Languages of Higher-Dimensional Automata
by: Amrane, Amazigh, et al.
Published: (2024)

Bisimulations and Logics for Higher-Dimensional Automata
by: Zouari, Safa, et al.
Published: (2024)

On-the-fly Unfolding with Optimal Exploration for Linear Temporal Logic Model Checking of Concurrent Software and Systems
by: Li, Shuo, et al.
Published: (2023)

Positive Hennessy-Milner Logic for Branching Bisimulation
by: Geuvers, Herman, et al.
Published: (2022)

Automatic Generation of Safety-compliant Linear Temporal Logic via Large Language Model: A Self-supervised Framework
by: Li, Junle, et al.
Published: (2025)

SENTIL: A Runtime Verification Tool for Probabilistic Temporal Logic
by: Quansah, Paapa Kwesi, et al.
Published: (2026)

A Complete Propositional Dynamic Logic for Regular Expressions with Lookahead
by: Nakamura, Yoshiki
Published: (2026)

Online Monitoring of Metric Temporal Logic using Sequential Networks
by: Ulus, Dogan
Published: (2019)

Set Automata and Limits of Decidability of Two-Variable Logic on Data Words
by: Guha, Shibashis, et al.
Published: (2026)

Language Inclusion for Boundedly-Ambiguous Vector Addition Systems is Decidable
by: Czerwiński, Wojciech, et al.
Published: (2022)

The Algebras for Automatic Relations
by: Morvan, Rémi
Published: (2024)

Uncertainty Removal in Verification of Nonlinear Systems against Signal Temporal Logic via Incremental Reachability Analysis
by: Besset, Antoine, et al.
Published: (2025)

Relating Reversible Petri Nets and Reversible Event Structures, categorically
by: Melgratti, Hernán, et al.
Published: (2023)

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

Arbitrary-arity Tree Automata and QCTL
by: Laroussinie, François, et al.
Published: (2024)

Tree Automata Acceptance up to Measurable Defect
by: Moyasari, Anita, et al.
Published: (2026)

Slightly Non-Linear Higher-Order Tree Transducers
by: Nguyên, Lê Thành Dũng, et al.
Published: (2024)

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

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

Tree transducers of linear size-to-height increase (and the additive conjunction of linear logic)
by: Dartois, Luc, et al.
Published: (2026)

Learning Verified Monitors for Hidden Markov Models
by: van der Maas, Luko, et al.
Published: (2025)