V-Star: Learning Visibly Pushdown Grammars from Program Inputs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Jia, Xiaodong, Tan, Gang
Format:	Preprint
Published:	2024
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

Input-Driven Pushdown Automata with Translucent Input Letters
by: Kutrib, Martin, et al.
Published: (2025)

Visibly Pushdown Languages in Groups
by: Ciobanu, Laura, et al.
Published: (2026)

Reachability in Trace-Pushdown Systems
by: Köcher, Chris, et al.
Published: (2025)

Passive Model Learning of Visibly Deterministic Context-free Grammars
by: Muškardin, Edi, et al.
Published: (2025)

Explorability in Pushdown Automata
by: Bedi, Ayaan, et al.
Published: (2025)

Reachability in One-Dimensional Pushdown Vector Addition Systems is Decidable
by: Bizière, Clotilde, et al.
Published: (2024)

A Bionic Natural Language Parser Equivalent to a Pushdown Automaton
by: Wei, Zhenghao, et al.
Published: (2024)

Bonding Grammars
by: Pshenitsyn, Tikhon
Published: (2024)

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

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)

Detecting and Explaining (In-)equivalence of Context-Free Grammars
by: Schmellenkamp, Marko, et al.
Published: (2024)

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

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

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

Computational Model for Parsing Expression Grammars
by: Rubtsov, Alexander, et al.
Published: (2024)

Forbidden-Context & Ordered Grammar Systems
by: Fernau, Henning, et al.
Published: (2026)

On Decidability and Expressive Power of Fusion Grammars
by: Pshenitsyn, Tikhon
Published: (2023)

Tahr: The Generative Attribute Grammar Framework
by: Ciccaglione, Matteo, et al.
Published: (2025)

Closure Properties of General Grammars -- Formally Verified
by: Dvorak, Martin, et al.
Published: (2023)

Idefix-Closed Languages and Their Application in Contextual Grammars
by: Ködding, Marvin, et al.
Published: (2025)

A Synthesis Method of Safe Rust Code Based on Pushdown Colored Petri Nets
by: Zhang, Kaiwen, et al.
Published: (2026)

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

Regular Grammars for Sets of Graphs of Tree-Width 2
by: Bozga, Marius, et al.
Published: (2024)

The No Endmarker Theorem for One-Way Probabilistic Pushdown Automata
by: Yamakami, Tomoyuki
Published: (2021)

Characterizations of Controlled Generation of Right Linear Grammars with Unknown Behaviors
by: Ise, Daihei, et al.
Published: (2024)

Uniform Membership for Hyperedge Replacement Grammars and Related Decision Problems
by: Pshenitsyn, Tikhon
Published: (2025)

Verifying Parameterized Networks Specified by Vertex-Replacement Graph Grammars
by: Iosif, Radu, et al.
Published: (2025)

Visual Execution and Validation of Finite-State Machines and Pushdown Automata
by: Morazán, Marco T., et al.
Published: (2025)

The $\mathsf{AC}^0$-Complexity Of Visibly Pushdown Languages
by: Göller, Stefan, et al.
Published: (2023)

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

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

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

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

Automating the Analysis and Improvement of Dynamic Programming Algorithms with Applications to Natural Language Processing
by: Vieira, Tim
Published: (2026)

Abstract String Domain Defined with Word Equations as a Reduced Product (Extended Version)
by: Nepeivoda, Antonina, et al.
Published: (2025)

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

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

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

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