Functional Pearls Unfolding pointer algorithms (2001)  (Make Corrections)  (1 citation)
Richard S. Bird

 @ NUS   Home/Search   Context   Related

 
View or download:
comlab.ox.ac.uk/oucl/work/...pointer.ps
Cached:  PS.gz  PS  PDF  Image  Update  Help

From:  web.comlab.ox.ac.uk/oucl/work/... (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: Introduction A fair amount has been written on the subject of reasoning about pointer algorithms. There was a peak about 1980 when everyone seemed to be tackling the formal veri cation of the Schorr-Waite marking algorithm, including (Gries,1979; Morris,1982; Topor,1979). Bornat (2000) writes: \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... (Update)

Cited by:   More
Case Studies For The Derivation Of Pointer Algorithms - Ehm (2003)   (Correct)

Active bibliography (related documents):   More   All
0.3:   Performing Algorithmic Refinement before Data Refinement in B - Butler, Meagher (2000)   (Correct)
0.2:   Expressions, Commands, and Assertions - Reynolds (2002)   (Correct)
0.2:   Static Detection of Pointer Errors: An Axiomatisation .. - Fradet, Gaugne.. (1996)   (Correct)

Similar documents based on text:   More   All
0.3:   Inverting the Burrows-Wheeler transform - Bird, Mu (2001)   (Correct)
0.2:   Theory and Applications of Inverting Functions as Folds - Mu, Bird   (Correct)
0.2:   Proving pointer programs in Hoare Logic - Bornat (2000)   (Correct)

BibTeX entry:   (Update)

R. S. Bird. Functional pearl: Unfolding pointer algorithms. Journal of Functional Programming, 11(3):347--358, May 2001. http://citeseer.comp.nus.edu.sg/399066.html   More

@misc{ bird01functional,
  author = "R. Bird",
  title = "Functional pearl: Unfolding pointer algorithms",
  text = "R. S. Bird. Functional pearl: Unfolding pointer algorithms. Journal of
    Functional Programming, 11(3):347--358, May 2001.",
  year = "2001",
  url = "citeseer.comp.nus.edu.sg/399066.html" }
Citations (may not include all citations):
108   Introduction to Functional Programming using Haskell (context) - Bird - 1998
82   Alias types for recursive data structures - Walker, Morrisett - 2000
42   A type system for bounded space and functional in-place upda.. - Hofmann - 2000
32   Proving pointer programs in Hoare Logic - Bornat - 2000
25   The underappreciated unfold - Gibbons, Jones - 1998
7   The Schorr-Waite graph marking algorithm (context) - Gries - 1979
5   Calculating with pointers (context) - Bijlsma - 1989
5   Verication of programs that destructively manipulate data (context) - Mason - 1988
3   Calculational derivation of pointer algorithms from tree ope.. - Butler - 1999
1   Calculating with acyclic and cyclic lists (context) - oller - 1999
1   The correctness of the Schorr-Waite marking algorithm (context) - Topor - 1979
1   Verication of array (context) - Luckham, Suzuki - 1979
1   An ecient machine-independent procedure for Functional pearl.. (context) - Schorr, Waite - 1967
1   Calculating with pointer structures (context) - oller - 1997

Documents on the same site (http://web.comlab.ox.ac.uk/oucl/work/richard.bird/):
Functional Pearls - Maximum Marking Problems - Bird   (Correct)

Online articles have much greater impact   More about CiteSeer.IST at NUS   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST at NUS - Copyright Penn State and NEC. Hosted by the School of Computing, National University of Singapore.