We study the automated verification of pointer safety for heap-manipulating imperative programs with unknown procedure calls. Given a Hoare-style partial correctness specificati...
er presents an abstraction of Hoare logic to traced symmetric monoidal categories, a eral framework for the theory of systems. Our abstraction is based on a traced monoidal functor...
Rob Arthan, Ursula Martin, Erik A. Mathiesen, Paul...
We present a trace semantics for a language of parallel programs which share access to mutable data. We introduce a resource-sensitive logic for partial correctness, based on a re...
Separation logic [20,21,14] began life as an extended formalisation of Burstall's treatment of list-mutating programs [8]. It rapidly became clear that there was more that it...
Verification of programs requires reasoning about sets of program states. In case of programs manipulating pointers, program states are pointer graphs. Verification of such prog...