Copertina

A Practical Specification Language for Automatic Quantum Program Verification (Technical Report)

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Tsai, Wei-Lun, Chen, Yu-Fang, Lengál, Ondřej
Natura:	Preprint
Pubblicazione:	2026
Soggetti:	Logic in Computer Science Formal Languages and Automata Theory
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

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

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

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

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

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

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

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

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

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

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

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

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

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

Safety Verification of Stochastic Systems under Signal Temporal Logic Specifications
di: Ma, Liqian, et al.
Pubblicazione: (2025)

The Algebras for Automatic Relations
di: Morvan, Rémi
Pubblicazione: (2024)

Automatic constraint satisfaction problem
di: Bulatov, Andrei, et al.
Pubblicazione: (2026)

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

Runtime Verification: Monitoring, Knowledge, and Uncertainty (Lecture Notes)
di: Bollig, Benedikt
Pubblicazione: (2026)

MightyPPL: Verification of MITL with Past and Pnueli Modalities
di: Ho, Hsi-Ming, et al.
Pubblicazione: (2025)

Recomposition: A New Technique for Efficient Compositional Verification
di: Dardik, Ian, et al.
Pubblicazione: (2024)

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

What is Formal Verification without Specifications? A Survey on mining LTL Specifications
di: Neider, Daniel, et al.
Pubblicazione: (2025)

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

Synthesizing Computable Functions from Rational Specifications over Infinite Words
di: Filiot, Emmanuel, et al.
Pubblicazione: (2021)

Unreliability in Practical Subclasses of Communicating Systems
di: Suresh, Amrita, et al.
Pubblicazione: (2025)

From Sound Workflow Nets to LTLf Declarative Specifications by Casting Three Spells
di: Barbaro, Luca, et al.
Pubblicazione: (2025)

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

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

Monitorability for the Modal mu-Calculus over Systems with Data: From Practice to Theory
di: Aceto, Luca, et al.
Pubblicazione: (2025)

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

Language Equivalence is Undecidable in VASS with Restricted Nondeterminism
di: Czerwiński, Wojciech, et al.
Pubblicazione: (2025)

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

A Uniform Framework for Language Inclusion Problems
di: Doveri, Kyveli, et al.
Pubblicazione: (2024)

Homomorphism Problems in Graph Databases and Automatic Structures
di: Morvan, Rémi
Pubblicazione: (2025)

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

Random Graph Generation in Context-Free Graph Languages
di: Vastarini, Federico, et al.
Pubblicazione: (2024)

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

Mata, a Fast and Simple Finite Automata Library (Technical Report)
di: Chocholatý, David, et al.
Pubblicazione: (2023)

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

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