Cover Image

Abstract String Domain Defined with Word Equations as a Reduced Product (Extended Version)

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Nepeivoda, Antonina, Afanasyev, Ilya
Format:	Preprint
Published:	2025
Subjects:	Programming Languages Formal Languages and Automata Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Decision Procedure for A Theory of String Sequences
by: Hu, Denghang, et al.
Published: (2025)

Verification under TSO with an infinite Data Domain
by: Abdulla, Parosh Aziz, et al.
Published: (2024)

Componentwise Automata Learning for System Integration (Extended Version)
by: Fujinami, Hiroya, et al.
Published: (2025)

Atomic Gliders and CA as Language Generators (Extended Version)
by: Fisman, Dana, et al.
Published: (2025)

Productive Quantum Programming Needs Better Abstract Machines
by: Núñez-Corrales, Santiago, et al.
Published: (2025)

Collaboration Miner: Discovering Collaboration Petri Nets (Extended Version)
by: Benzin, Janik-Vasily, et al.
Published: (2024)

On-The-Fly Algorithm for Reachability in Parametric Timed Games (Extended Version)
by: Dahlsen-Jensen, Mikael Bisgaard, et al.
Published: (2024)

Chance and Mass Interpretations of Probabilities in Markov Decision Processes (Extended Version)
by: Tsai, Yun Chen, et al.
Published: (2025)

Mind the Gap: A Formal Investigation of the Relationship Between Log and Model Complexity -- Extended Version
by: Schalk, Patrizia, et al.
Published: (2025)

TARZAN: A Region-Based Library for Forward and Backward Reachability of Timed Automata (Extended Version)
by: Manini, Andrea, et al.
Published: (2026)

Finite-valued Streaming String Transducers
by: Filiot, Emmanuel, et al.
Published: (2024)

Composing Copyless Streaming String Transducers
by: Alur, Rajeev, et al.
Published: (2022)

Minimizing Streaming String Transducers: An algebraic approach
by: Benalioua, Yahia Idriss, et al.
Published: (2026)

Type-Driven Prompt Programming: From Typed Interfaces to a Calculus of Constraints
by: Paul, Abhijit
Published: (2025)

Resynchronized Uniformization and Definability Problems for Rational Relations
by: Löding, Christof, et al.
Published: (2021)

On the Complexity of Language Membership for Probabilistic Words
by: Amarilli, Antoine, et al.
Published: (2025)

Classifying Words with 3-sort Automata
by: Jastrząb, Tomasz, et al.
Published: (2024)

Reversible Transducers over Infinite Words
by: Dartois, Luc, et al.
Published: (2024)

Certified Symbolic Finite Transducers: Formalization and Applications to String Analysis
by: Kan, Shuanglong, et al.
Published: (2025)

A Regular and Complete Notion of Delay for Streaming String Transducers
by: Filiot, Emmanuel, et al.
Published: (2022)

Some Remarks on First-Order Definable Tree Languages
by: Blumensath, Achim
Published: (2024)

An Automata-theoretic Basis for Specification and Type Checking of Multiparty Protocols
by: Stutz, Felix, et al.
Published: (2025)

Synthesizing DSLs for Few-Shot Learning
by: Krogmeier, Paul, et al.
Published: (2025)

Syntax Repair as Language Intersection
by: Considine, Breandan
Published: (2025)

Probabilistic Programming Meets Automata Theory: Exact Inference using Weighted Automata
by: Geißler, Dominik, et al.
Published: (2025)

Refuting Equivalence in Probabilistic Programs with Conditioning
by: Chatterjee, Krishnendu, et al.
Published: (2025)

Weighted Automata for Exact Inference in Discrete Probabilistic Programs
by: Geißler, Dominik, et al.
Published: (2025)

Formally Verified Linear-Time Invertible Lexing
by: Chassot, Samuel, et al.
Published: (2025)

Characterizing Implementability of Global Protocols with Infinite States and Data
by: Li, Elaine, et al.
Published: (2024)

Saturating automata for game semantics
by: Dixon, Alex, et al.
Published: (2023)

Maximal and minimal dynamic Petri net slicing
by: Llorens, Marisa, et al.
Published: (2021)

V-Star: Learning Visibly Pushdown Grammars from Program Inputs
by: Jia, Xiaodong, et al.
Published: (2024)

CIR+CVN: Bridging LLM Semantic Understanding and Petri-Net Verification for Concurrent Programs
by: Zhang, Kaiwen, et al.
Published: (2026)

Global Protocols under Rendezvous Synchrony: From Realizability to Type Checking
by: Li, Elaine, et al.
Published: (2026)

Equivalence and Similarity Refutation for Probabilistic Programs
by: Chatterjee, Krishnendu, et al.
Published: (2024)

Reactive graphs in action (extended version)
by: Tinoco, David, et al.
Published: (2024)

Polyregular equivalence is undecidable in higher-order types
by: Bojańczyk, Mikołaj, et al.
Published: (2026)

Synchronisability in Mailbox Communication
by: Di Giusto, Cinzia, et al.
Published: (2024)

Linear Matching of JavaScript Regular Expressions
by: Barrière, Aurèle, et al.
Published: (2023)

Exact Separation of Words via Trace Geometry
by: Chen, Zeyu, et al.
Published: (2026)