M.J. Butler. Calculational Derivation of Pointer Algorithms from Tree Operations. Science of Computer Programming, 33 (1999) 221--260. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Functional Pearls - Unfolding pointer algorithms - Bird (2001) (1 citation) (Correct)
.... The Schorr Waite algorithm is the rst mountain that any formalism for pointer aliasing should climb . Then it went more or less quiet for a while, but in the last few years there has been a resurgence of interest, driven by new ideas in relational algebras (M oller,1997) in data re nement (Butler,1999), in type theory (Hofmann,2000; Walker and Morrisett,2000) in novel kinds of assertion (Reynolds,2000) and by the demands of mechanised reasoning (Bornat,2000) Most approaches end up being based in the Floyd Dijkstra Hoare tradition with loops and invariant assertions. To be sure, when dealing ....
Butler, M. (1999) Calculational derivation of pointer algorithms from tree operations. Science of Computer Programming, 33(3), pp: 221-260.
Performing Algorithmic Refinement before Data Refinement in B - Butler, Meagher (2000) (1 citation) Self-citation (Butler) (Correct)
No context found.
M.J. Butler. Calculational Derivation of Pointer Algorithms from Tree Operations. Science of Computer Programming, 33 (1999) 221--260.
Case Studies For The Derivation Of Pointer Algorithms - Ehm (2003) (Correct)
No context found.
M. Butler. Calculational derivation of pointer algorithms from tree operations. Science of Computer Programming, 33(3):221--260, March 1999.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC