Imagen de Portada

Dynamic Programming for Symbolic Boolean Realizability and Synthesis

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Lin, Yi, Tabajara, Lucas M., Vardi, Moshe Y.
Formato:	Preprint
Publicado:	2024
Materias:	Formal Languages and Automata Theory Logic in Computer Science
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

LTLf+ and PPLTL+: Extending LTLf and PPLTL to Infinite Traces
por: Aminof, Benjamin, et al.
Publicado: (2024)

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

Inferring Symbolic Automata
por: Fisman, Dana, et al.
Publicado: (2021)

Symbolic ω-automata with obligations
por: Di Stefano, Luca
Publicado: (2025)

A GLR-like Parsing Algorithm for Three-Valued Interpretations of Boolean Grammars with Strong Negation
por: Adrián, Patrik, et al.
Publicado: (2024)

High-Level Message Sequence Charts: Satisfiability and Realizability Revisited
por: Bollig, Benedikt, et al.
Publicado: (2025)

Symbolic Synthesis for LTLf+ Obligations
por: De Giacomo, Giuseppe, et al.
Publicado: (2026)

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

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

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

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

Effective MSO-Definability for Tree-width Bounded Models of an Inductive Separation Logic of Relations
por: Bueri, Lucas, et al.
Publicado: (2024)

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

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

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

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

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

Extended CTG Generalization and Dynamic Adjustment of Generalization Strategies in IC3
por: Su, Yuheng, et al.
Publicado: (2025)

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

LTL$_f$ Learning Meets Boolean Set Cover
por: Bathie, Gabriel, et al.
Publicado: (2025)

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

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

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

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

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

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

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

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

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

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

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

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

Taking Complete Finite Prefixes To High Level, Symbolically
por: Würdemann, Nick, et al.
Publicado: (2023)

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

Attractors of Parikh mapping iterations
por: Chunikhin, Alexander
Publicado: (2024)

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

Proceedings Combined 31st International Workshop on Expressiveness in Concurrency and 21st Workshop on Structural Operational Semantics
por: Caltais, Georgiana, et al.
Publicado: (2024)

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

Complete Test Suites for Automata in Monoidal Closed Categories
por: Kocsis, Bálint, et al.
Publicado: (2024)