arXiv (All)
open access
Model Checking Probabilistic Operator Precedence Automata
We address the problem of model checking context-free specifications for probabilistic pushdown automata, with applications in the verification of recursive probabilistic programs. Operator Precedence Languages (OPLs) are an expressive subclass of context-free languages suitable for model checking r
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Formulating Decision Theory as Program Search#108176
- Formal Verification of Proofs from Automated Theorem Provers for Higher-Order Logic#1051004
- Neuro-Formal Verification: Agentic Language-Agnostic Formal Program Reasoning#482228
- HoarePrompt: Structural Reasoning About Program Correctness in Natural Language#984837
- LANGUAGES FOR DECISION SUPPORT SYSTEMS: AN OVERVIEW#933703
Record · ID 1051959
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive