Decode-Time Grammars: Constrained LLM Generation over a Refinement Order of Grammar Fragments
arXiv 2607.18357•0cbd48f3758f27ae77c9e9e348439141286ec58c1851130a818eead7211062d7
LLM safetyLLVMMLIRSQL safetyVirtualSetbuild authorizationcompiler securityconstrained decodingdecode-time grammarsformal methodsghost referencesgrounded generationguarded executionhardware verificationhigh-level synthesislink receiptspattern-unificationruntime environment typingschema-derived priorsweak-memory verification
Paper metadata
- arXiv ID
- 2607.18357
- Version
- Not specified by this published record
- Category
- Computer Science — Programming Languages (cs.PL)
The PDF link points to arxiv.org. Baitaphish does not expose a private stored PDF.
Evidence and limitations
- Source ID
- arxiv_cs_pl
- Record identifier
- 0cbd48f3758f27ae77c9e9e348439141286ec58c1851130a818eead7211062d7
- Enrichment time
- 2026-07-22T08:52:01Z
- AI-assisted enrichment
- Yes
This record may overlap with other records. Its enrichment can be incomplete or wrong, and machine assistance was used. Validate consequential decisions against the linked source and your own environment.