Reasoning about B+ Trees with Operational Semantics and Separation Logic

Electronic Notes in Theoretical Computer Science

Volumn 218, Issue C, 2008, Pages 355-369

  Sexton, Alan ^a   Thielecke, Hayo ^a  

^a UNIVERSITY OF BIRMINGHAM   (United Kingdom)

Author keywords

Abstract Machines; B+ Trees; Data Structure; Invariant; Separation Logic

Indexed keywords

ABSTRACTING; COMPUTER PROGRAMMING LANGUAGES; DATA STRUCTURES; DATABASE SYSTEMS; FILE ORGANIZATION; GRAPH THEORY; INFORMATION THEORY; ISOMERS; PROGRAMMING THEORY; SEMANTICS; SEPARATION;

ABSTRACT MACHINES; B+ TREES; COMPUTING; FORMALISATION; INVARIANT; OPERATIONAL SEMANTICS; ORDERED TREES; PRECISE; PROGRAMMING LANGUAGE THEORIES; SEARCHING; SEPARATION LOGIC; SEPARATION LOGICS; SUBTREE;

TREES (MATHEMATICS);

EID: 54049107387     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2008.10.021     Document Type: Article

References (12)

1. Bayer R., and McCreight E.M. Organization and maintenance of large ordered indexes. Acta Informatica 1 3 (1972) 173-189
2. N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger. The R*-tree: an efficient and robust access method for points and rectangles. In ACM SIGMOD, 322-331, 1990
3. R. Bornat, C. Calcagno, and P. O'Hearn. Local reasoning, separation and aliasing. In SPACE 04 workshop, 2004
4. Comer D. The ubiquitous B-tree. Computing Surveys 11 2 (June 1979) 121-137
5. M. Freeston. A general solution of the n-dimensional B-tree problem. In ACM SIGMOD, 80-91, 1995
6. S. Ishtiaq and P. O'Hearn. BI as an assertion language for mutable data structures. In ACM POPL. 2001
7. Landin P.J. The mechanical evaluation of expressions. The Computer Journal 6 4 (Jan 1964) 308-320
8. Lomet D.B., and Salzberg B. The hB-tree: a multiattribute indexing method with good guaranteed performance. ACM Trans. Database Syst. 15 4 (1990) 625-658
9. J.C. Reynolds. Separation logic: A logic for shared mutable data structures. In Logic in Computer Science (LICS), 55-74, 2002
10. A.P. Sexton and R. Swinbank. Virtual forced splitting, demotion and the BV-tree. In British National Conference on Databases, BNCOD'08, LNCS. Springer Verlag, June 2008. to appear
11. R. Swinbank. Virtual Forced Splitting in Multidimensional Access Methods. PhD thesis, School o Computer Science, University of Birmingham, 2008. Due for completion May 2008
12. H. Thielecke. Frame rules from answer types for code pointers. In ACM POPL, 309-319. 2006