Re:An Axiomatic Basis for Computer Programming (1969) [pdf]
by rssoconnor on Wednesday March 31, 2021 @12:45PM
(#26649551)
VerifiableC[1] provides Hoare rules for (a large subset[2] of) C that include function calls, pointers and heap allocation, and some amount of concurrency. It does use an extension to Hoare logic, called separation logic, to achieve some of these features. In particular, separation logic's frame rule is instrumental for the modularization needed for semantics of function calls.
[1]https://vst.cs.princeton.edu/veric/
[2]excludes setjmp/longjmp, unstructured switch statements, goto and maybe a few other moderately exotic constructions.
Re:An Axiomatic Basis for Computer Programming (1969) [pdf]
by Joker_vD on Wednesday March 31, 2021 @02:41PM
(#26651252)
No goto? Funny, but there is actually a Hoare rule for goto (by Hoare himself), and a rather straightforward one:
{ pre(L) } S; { P }
------------------------
{ pre(L) } L: S; { P }
{ pre(L) } goto L; { false }
You just have to use the same precondition pre(L) for every mention of the label L.
The closest thing to it I've seen is TLA+ but holy fatcats is it unwieldy.