Springer Nature OA
open access
Weakest Precondition Rules for Programs with Linear Temporal Specifications
With today’s mature auto-active program verification tools complex functional requirements can be formalized and proved. To that end, they rely on verification condition generation to bridge between structured programs and high-level specifications and the automated theorem provers used in the backg
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
- Formal Verification of Proofs from Automated Theorem Provers for Higher-Order Logic#1051004
- ProofGap: Benchmarking Step-Level Formal Reasoning with Local Obligations Derived from Natural-Language Solutions#1077225
- Schwarz: Solver-Aware Agentic Program Verification#818849
- Schwarz: Solver-Aware Agentic Program Verification#808857
- SpecSyn: LLM-based Synthesis and Refinement of Formal Specifications for Real-world Program Verification#1326251
Record · ID 1428440
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