Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

77

Voted

MPC
2000
Springer

favoriteEmaildiscussreport

113views Mathematics» more MPC 2000»

Proving Pointer Programs in Hoare Logic

15 years 1 months ago

Proving Pointer Programs in Hoare Logic

Download www.eis.mdx.ac.uk

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

Richard Bornat

Real-time Traffic

Data Structures | Hoare Logic | Hoare Logic Treatment | Mathematics | MPC 2000 |

claim paper

Related Content

» Proving Pointer Programs in HigherOrder Logic

» A General Framework for Sound and Complete FloydHoare Logics

» Towards Mechanized Program Verification with Separation Logic

» Matching Logic An Alternative to HoareFloyd Logic

» Modular Protections against Noncontrol Data Attacks

» Hoare Logic for Realistically Modelled Machine Code

» A Hoare Logic for the State Monad

» A Hoare Logic for the Coinductive TraceBased BigStep Semantics of While

» Frame rules from answer types for code pointers

Post Info
More Details (n/a)

Added	25 Aug 2010
Updated	25 Aug 2010
Type	Conference
Year	2000
Where	MPC
Authors	Richard Bornat

Comments (0)