Imagen de Portada

Parametrizing Reads-From Equivalence for Predictive Monitoring

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Farzan, Azadeh, Mathur, Umang
Formato:	Preprint
Publicado:	2026
Materias:	Programming Languages 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

Enhanced Data Race Prediction Through Modular Reasoning
por: Ang, Zhendong, et al.
Publicado: (2025)

The Decision Problem for Regular First-Order Theories
por: Mathur, Umang, et al.
Publicado: (2024)

Counting and Sampling Traces in Regular Languages
por: de Colnet, Alexis, et al.
Publicado: (2025)

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

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

Generalized Parameter Lifting: Finer Abstractions for Parametric Markov Chains
por: Heck, Linus, et al.
Publicado: (2025)

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

A Diagrammatic Axiomatisation of Behavioural Distance of Nondeterministic Processes
por: Różowski, Wojciech, et al.
Publicado: (2026)

SuperDP: Differential Privacy Refutation via Supermartingales
por: Chatterjee, Krishnendu, et al.
Publicado: (2026)

Finding Regular Herbrand Models for CHCs using Answer Set Programming
por: Maire, Gregoire, et al.
Publicado: (2025)

Weighted GKAT: Completeness and Complexity
por: Van Koevering, Spencer, et al.
Publicado: (2025)

Verifying Asynchronous Hyperproperties in Reactive Systems
por: Beutner, Raven, et al.
Publicado: (2025)

Syntactically and semantically regular languages of lambda-terms coincide through logical relations
por: Moreau, Vincent, et al.
Publicado: (2023)

Towards a Coq-verified Chain of Esterel Semantics
por: Berry, Gérard, et al.
Publicado: (2019)

Monitoring Timed Properties (Revisited)
por: Grosen, Thomas Møller, et al.
Publicado: (2022)

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

Runtime Verification: Monitoring, Knowledge, and Uncertainty (Lecture Notes)
por: Bollig, Benedikt
Publicado: (2026)

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

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

From Sound Workflow Nets to LTLf Declarative Specifications by Casting Three Spells
por: Barbaro, Luca, 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)

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)

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)

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)

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

Cypher is Turing-Complete: A Formal Proof via 2-Counter Machine Simulation
por: Halftermeyer, Pierre
Publicado: (2026)

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

How Concise are Chains of co-Büchi Automata?
por: Ehlers, Rüdiger
Publicado: (2026)

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

Knowledge Compilation for Quantification in Alternating Automata
por: Akshay, S., et al.
Publicado: (2026)

Minimization of Streaming Transducers
por: Bianchini, Christian, et al.
Publicado: (2026)

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

Intersecting Dense Automata
por: Chistikov, Dmitry, et al.
Publicado: (2026)

Variants of Higher-Dimensional Automata
por: Bazille, Hugo, et al.
Publicado: (2026)

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

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