ISTA Publications
metadata only
Fixed point certificates for reachability and expected rewards in MDPs
The possibility of errors in human-engineered formal verification software, such as model checkers, poses a serious threat to the purpose of these tools. An established approach to mitigate this problem are certificates—lightweight, easy-to-check proofs of the verification results. In this paper, we
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
- Evaluation and Compliance in Persistent Autonomous Systems_ Testing Identity, Drift, and Verifiable Autonomy#103043
- From Automata Learning to Model Checking: Formal Security Verification of Black-Box Protocols#1070439
- Synthesizing Proofs Using Proof Sharding and Exploration#1076192
- LPOR: A Layered Proof of Reserves Framework for Usable and Publicly Auditable Solvency Verification#267593
- Deterministic Decision Verification and Proof-Gated Execution#127237
Record · ID 1039242
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