Cover Image

HornStr: Invariant Synthesis for Regular Model Checking as Constrained Horn Clauses(Technical Report)

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Jiang, Hongjian, Lin, Anthony W., Markgraf, Oliver, Rümmer, Philipp, Stan, Daniel
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

Synthesis and Verification of Transformer Programs (Technical Report)
by: Jiang, Hongjian, et al.
Published: (2026)

Kofola 1.0: A Modular Approach to ω-Regular Complementation and Inclusion Checking (Technical Report)
by: Alexaj, Ondrej, et al.
Published: (2026)

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

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

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

String Solving with Stabilization and Transducers (Technical Report)
by: Chocholatý, David, et al.
Published: (2026)

Negated String Containment is Decidable (Technical Report)
by: Havlena, Vojtěch, et al.
Published: (2025)

Complementation of Emerson-Lei Automata (Technical Report)
by: Havlena, Vojtěch, et al.
Published: (2024)

Synthesis of Computable Regular Functions of Infinite Words
by: Dave, V., et al.
Published: (2019)

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

On Complementation of Nondeterministic Finite Automata without Full Determinization (Technical Report)
by: Holík, Lukáš, et al.
Published: (2025)

A Uniform Framework for Handling Position Constraints in String Solving (Technical Report)
by: Chen, Yu-Fang, et al.
Published: (2025)

A Practical Specification Language for Automatic Quantum Program Verification (Technical Report)
by: Tsai, Wei-Lun, et al.
Published: (2026)

Towards Efficient Matching of Regexes with Backreferences using Register Set Automata (Technical Report)
by: Havlena, Vojtěch, et al.
Published: (2022)

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

Simplifying LTL Model Checking Given Prior Knowledge
by: Duret-Lutz, Alexandre, et al.
Published: (2025)

Model Checking Temporal Properties of Recursive Probabilistic Programs
by: Winkler, Tobias, et al.
Published: (2021)

Automata Learning with an Incomplete but Inductive Teacher (Technical Report)
by: Stan, Daniel, et al.
Published: (2026)

DTMC Model Checking by Path Abstraction Revisited (extended version)
by: Hartmanns, Arnd, et al.
Published: (2025)

Complexity of Model Checking Second-Order Hyperproperties on Finite Structures
by: Finkbeiner, Bernd, et al.
Published: (2026)

Automata-less Monitoring via Trace-Checking (Extended Version)
by: Brunello, Andrea, et al.
Published: (2025)

Model-Checking PCTL Properties of Stateless Probabilistic Pushdown Systems
by: Lin, Deren, et al.
Published: (2014)

Modeling and specification of distributed timed systems
by: James J. Ortiz
Published: (2013)

Tracy, Traces, and Transducers: Computable Counterexamples and Explanations for HyperLTL Model-Checking
by: Winter, Sarah, et al.
Published: (2024)

Invariants for One-Counter Automata with Disequality Tests
by: Chistikov, Dmitry, et al.
Published: (2024)

Fast Ramsey Quantifier Elimination in LIRA (with applications to liveness checking)
by: Lichtner, Kilian, et al.
Published: (2025)

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)

Prophecies all the Way: Game-based Model-Checking for HyperQPTL beyond $\forall^*\exists^*$
by: Winter, Sarah, et al.
Published: (2025)

Fractals from Regular Behaviours
by: Schmid, Todd, et al.
Published: (2023)

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

A Completeness Theorem for Probabilistic Regular Expressions
by: Różowski, Wojciech, et al.
Published: (2023)

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

Algebraic Characterizations of Classes of Regular Languages in DynFO
by: Barloy, Corentin, et al.
Published: (2026)

On The Space Complexity of Partial Derivatives of Regular Expressions with Shuffle
by: Ancona, Davide, et al.
Published: (2025)

Some properties of $β$-$η$-normal forms in $λ$-K-calculus (Alcune proprietá delle forme $β$-$η$-normali nel $λ$-K-calcolo)
by: Böhm, Corrado, et al.
Published: (2025)

First-Order Intuitionistic Linear Logic and Hypergraph Languages
by: Pshenitsyn, Tikhon
Published: (2025)

A Diamond Structure in the Transducer Hierarchy
by: Kaufmann, Noah
Published: (2021)

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

Extracting Robust Register Automata from Neural Networks over Data Sequences
by: Hong, Chih-Duo, et al.
Published: (2025)

On Dependent Variables in Reactive Synthesis
by: Akshay, S., et al.
Published: (2024)