Completeness of Hoare logic with inputs over the standard model

DOI10.1016/j.tcs.2015.08.004zbMath1333.68182OpenAlexW2187700024MaRDI QIDQ896915

Zhaowei Xu, Yuefei Sui, Wen-Hui Zhang

Publication date: 15 December 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2015.08.004

zbMATH Keywords

standard modelPeano arithmeticcomputationHoare logicarithmetical definabilitylogical completeness

Mathematics Subject Classification ID

Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) First-order arithmetic and fragments (03F30)

Related Items (1)

Completeness of Hoare Logic Relative to the Standard Model

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Expressiveness and the completeness of Hoare's logic
• Hoare's logic and Peano's arithmetic
• On the completeness of propositional Hoare logic
• Computability and Logic
• Ten Years of Hoare's Logic: A Survey—Part I
• Soundness and Completeness of an Axiom System for Program Verification
• An axiomatic basis for computer programming

This page was built for publication: Completeness of Hoare logic with inputs over the standard model