Proving Pointer Programs in Hoare Logic

It is possible, but difficult, to reason in Hoare logic about programs which address and modify data structures defined by pointers. The challenge is to approach the simplicity of Hoare logic's treatment of variable assignment, where substitution affects only relevant assertion formul

• Type: Conference
• Year: 2000
• Where: MPC
• Authors: Richard Bornat
• Keywords: Data Structures, Hoare Logic, Hoare Logic Treatment, Mathematics, MPC 2000