Extended transitive separation logic

Dang, Han-Hing; Möller, Bernhard

doi:10.1016/j.jlamp.2014.12.002

Cited by 2 publications

(3 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…[lxi] Algebraic logics -An important step to an algebraic form of program logic was taken by Hoare and his colleagues [98]. More recently, the central aspects of Separation Logic [164,163] were treated algebraically [56,54,55].…”

Section: An Example: the Project Cipmentioning

confidence: 99%

Algorithmics

Bird

Gibbons

Hinze

et al. 2021

IFIP Advances in Information and Communication Technology

View full text Add to dashboard Cite

10 Algorithmics is the study and practice of taking a highlevel description of a program's purpose and, from it, producing an executable program of acceptable efficiency. Each step in that process is justified by rigorous, careful reasoning at the moment it is taken; and the repertoire of steps allowed by that rigour, at each stage, guides the development of the algorithm itself.IFIP's Working Group 2.1 [i] has always been concerned with Algorithmics: both the design of its notations and the laws that enable its calculations. ALGOL 60 had already shown that orthogonality, simplicity and rigour in a programming language improves the quality of its programs.Our Group's title "Algorithmic Languages and Calculi" describes our activities: the discovery of precise but more general rules of calculational reasoning for the many new styles of programming that have developed over the 60 years since IFIP's founding. As our contribution to the birthday celebrations, we outline how we have tried to contribute during those decades to the rigorous and reliable design of computer programs of all kinds -to Algorithmics.

show abstract

Section: An Example: the Project Cipmentioning

confidence: 99%

Algorithmics

Bird

Gibbons

Hinze

et al. 2021

IFIP Advances in Information and Communication Technology

View full text Add to dashboard Cite

show abstract

“…This is an elegant advance on works which use ad hoc means to express confinement (e.g., [BN05,BN12]). Dang and Möller [DM15] take further steps in this direction.…”

Section: Motivation and Backgroundmentioning

confidence: 99%

“…For first order concurrent programs, concurrent Kleene algebra provides a pointfree algebraic setting for reasoning about separation, mutable state and concurrency (e.g., [HvSM + 14]). Modal Kleene algebra is the basis for the extended separation logic of Dang and Möller [DM15], which they use to verify algorithms including list reversal and tree rotation, expressed in terms of load and store commands. Banerjee et al [BNR13] use explicit expressions to designate footprints of pointer structures, but only for post hoc verification.…”

Section: Motivation and Backgroundmentioning

confidence: 99%

Towards patterns for heaps and imperative lambdas

Naumann

2016

Journal of Logical and Algebraic Methods in Programming

View full text Add to dashboard Cite

In functional programming, point-free relation calculi have been fruitful for general theories of program construction, but for specific applications pointwise expressions can be more convenient and comprehensible. In imperative programming, refinement calculi have been tied to pointwise expression in terms of state variables, with the curious exception of the ubiquitous but invisible heap. To integrate pointwise with point-free, de Moor and Gibbons [dMG00] extended lambda calculus with non-injective pattern matching interpreted using relations. This article gives a semantics of that language using "ideal relations" between partial orders, and a second semantics using predicate transformers. The second semantics is motivated by its potential use with separation algebra, for pattern matching in programs acting on the heap. Laws including lax beta and eta are proved in these models and a number of open problems are posed.Dedicated to José Nuno Oliveira on the occasion of his 60th birthday.

show abstract

Extended transitive separation logic

Cited by 2 publications

References 27 publications

Algorithmics

Algorithmics

Towards patterns for heaps and imperative lambdas

Contact Info

Product

Resources

About