Image de couverture de livre

Optimization of the Context-Free Language Reachability Matrix-Based Algorithm

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Muravev, Ilia
Format:	Preprint
Publié:	2024
Sujets:	Programming Languages
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Program Analysis via Multiple Context Free Language Reachability
par: Conrado, Giovanna Kobus, et autres
Publié: (2024)

Free to Move: Reachability Types with Flow-Sensitive Effects for Safe Deallocation and Ownership Transfer
par: Deng, Haotian, et autres
Publié: (2025)

Pathological Cases for a Class of Reachability-Based Garbage Collectors
par: Sotoudeh, Matthew
Publié: (2025)

Modeling Reachability Types with Logical Relations
par: Bao, Yuyan, et autres
Publié: (2023)

Context-Free Grammar Inference for Complex Programming Languages in Black Box Settings
par: Li, Feifei, et autres
Publié: (2026)

On Higher-Order Reachability Games vs May Reachability
par: Asada, Kazuyuki, et autres
Publié: (2022)

A Modular Program-Transformation Framework for Reducing Specifications to Reachability
par: Beyer, Dirk, et autres
Publié: (2025)

Bounded Model Checking of RISC-V Machine Code with Context-Free-Language Ordered Binary Decision Diagrams
par: Bolotina, Anna, et autres
Publié: (2025)

Local Type Inference for Context-Free Session Types
par: Almeida, Bernardo, et autres
Publié: (2025)

Optimized Execution of FreeCHR
par: Rechenberger, Sascha, et autres
Publié: (2025)

Escape with Your Self: Sound and Expressive Bidirectional Typing with Avoidance for Reachability Types
par: Jia, Songlin, et autres
Publié: (2024)

When Lifetimes Liberate: A Type System for Arenas with Higher-Order Reachability Tracking
par: He, Siyuan, et autres
Publié: (2025)

Automatic Generation of Python Programs Using Context-Free Grammars
par: Yamani, Kamel, et autres
Publié: (2024)

Detecting and Explaining (In-)equivalence of Context-Free Grammars
par: Schmellenkamp, Marko, et autres
Publié: (2024)

A Note on Dynamic Bidirected Dyck-Reachability with Cycles
par: Zhang, Qirun
Publié: (2024)

Structured Prompt Language: Declarative Context Management for LLMs
par: Gong, Wen G.
Publié: (2026)

HYSYNTH: Context-Free LLM Approximation for Guiding Program Synthesis
par: Barke, Shraddha, et autres
Publié: (2024)

Reachability is Decidable for ATM-Typable Finitary PCF with Effect Handlers
par: Endo, Ryunosuke, et autres
Publié: (2025)

Algorithmic Language Models with Neurally Compiled Libraries
par: Saldyt, Lucas, et autres
Publié: (2024)

Constrained Decoding of Diffusion LLMs with Context-Free Grammars
par: Mündler, Niels, et autres
Publié: (2025)

Decomposition-Based Synthesis for Applying Divide-and-Conquer-Like Algorithmic Paradigms
par: Ji, Ruyi, et autres
Publié: (2022)

An Intermediate Program Representation for Optimizing Stream-Based Languages
par: Baumeister, Jan, et autres
Publié: (2025)

Leveraging Large Language Models for Generalizing Peephole Optimizations
par: Liao, Chunhao, et autres
Publié: (2026)

Compiling by Proving: Language-Agnostic Automatic Optimization from Formal Semantics
par: Zhao, Jianhong, et autres
Publié: (2025)

Dataflow-Based Optimization for Quantum Intermediate Representation Programs
par: Luo, Junjie, et autres
Publié: (2024)

HELIX: Verified compilation of cyber-physical control systems to LLVM IR
par: Zaliva, Vadim, et autres
Publié: (2026)

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

Context-Aware Separation Logic
par: Meyer, Roland, et autres
Publié: (2023)

Complete the Cycle: Reachability Types with Expressive Cyclic References (Extended Version)
par: Deng, Haotian, et autres
Publié: (2025)

Rule-Based Graph Programs Matching the Time Complexity of Imperative Algorithms
par: Alaoui, Ziad Ismaili, et autres
Publié: (2025)

A Novel Compiler Transformation for Fast Sparse Matrix Multiplication in GPUs
par: Albakri, Hossein, et autres
Publié: (2025)

DeGAS: Gradient-Based Optimization of Probabilistic Programs without Sampling
par: Randone, Francesca, et autres
Publié: (2026)

CompilerGPT: Leveraging Large Language Models for Analyzing and Acting on Compiler Optimization Reports
par: Pirkelbauer, Peter, et autres
Publié: (2025)

$μλεδ$-Calculus: A Self Optimizing Language that Seems to Exhibit Paradoxical Transfinite Cognitive Capabilities
par: Salgado, Ronie
Publié: (2024)

Deadlock-free Context-free Session Types
par: Mordido, Andreia, et autres
Publié: (2025)

The Incredible Shrinking Context... in a Decompiler Near You
par: Lagouvardos, Sifis, et autres
Publié: (2024)

Härpfer's Extended Indispensability Algorithm in Z
par: Lepper, Markus, et autres
Publié: (2025)

AwareCompiler: Agentic Context-Aware Compiler Optimization via a Synergistic Knowledge-Data Driven Framework
par: Lin, Hongyu, et autres
Publié: (2025)

Beyond Pass-by-Pass Optimization: Intent-Driven IR Optimization with Large Language Models
par: Qiu, Lei, et autres
Publié: (2026)

Verification Algorithms for Automated Separation Logic Verifiers
par: Eilers, Marco, et autres
Publié: (2024)