Toward a verified relational database management system

Conference Record of the Annual ACM Symposium on Principles of Programming Languages

Volumn , Issue , 2010, Pages 237-248

  Malecha, Gregory ^a   Morrisett, Greg ^a   Shinnar, Avraham ^a   Wisnesky, Ryan ^a  

^a HARVARD UNIVERSITY   (United States)

Author keywords

B+ tree; Dependent types; Relational model; Separation logic

Indexed keywords

B+-TREES; DEPENDENT TYPES; FUNCTIONAL SPECIFICATION; QUERY OPTIMIZATION; RELATIONAL ALGEBRA; RELATIONAL DATABASE MANAGEMENT SYSTEMS; RELATIONAL MODEL; RUNTIMES; SEPARATION LOGIC; SYSTEMS SOFTWARE;

DATA STRUCTURES; DATABASE SYSTEMS; LINGUISTICS; MANAGEMENT; MANAGEMENT INFORMATION SYSTEMS; RESPONSE TIME (COMPUTER SYSTEMS); SPECIFICATIONS;

COMPUTER SOFTWARE;

EID: 77950884592     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1706299.1706329     Document Type: Conference Paper

References (27)

1. Serge Abiteboul, Richard Hull, and Victor Vianu. Database Foundations. Addison-Wesley, 1995.
2. Yves Bertot and Pierre Castéran. Interactive Theorem Proving and Program Development. Coq'Art: The Calculus of Inductive Constructions. Texts in Theoretical Computer Science. Springer Verlag, 2004.
3. R. Bornat, C. Calcagno, and P. OHearn. Local Reasoning, Separation and Aliasing. Proc. SPACE, volume 4, 2004.
4. Stephen Brookes. A semantics for concurrent separation logic. Theor. Comput. Sci., 375(1-3):227-270, 2007.
5. Adam Chlipala, Gregory Malecha, Greg Morrisett, Avraham Shinnar, and Ryan Wisnesky. Effective interactive proofs for higher-order imperative programs. In Proc. ICFP, 2009.
6. C. J. Date. Introduction to Database Systems. Addison-Wesley Longman Publishing Co., Inc., 2002.
7. Ramez Elmasri and Shamkant B. Navathe. Fundamentals of Database Systems (5th Edition). Addison Wesley, 2006.
8. Parke Godfrey, Jarek Gryz, and Calisto Zuzarte. Exploiting constraint-like data characterizations in query optimization. In Proc. SIGMOD, 2001.
9. Carlos Gonzalia. Relations in Dependent Type Theory. PhD Thesis, Chalmers University of Technology, 2006.
10. Conor Mcbride. Elimination with a motive. In Proc. TYPES, 2000.
11. Conor McBride and James McKinna. The view from the left. J. Functional Programming, 14(1):69-111, 2004.
12. James Mckinna and Joel Wright. A type-correct, stack-safe, provably correct expression compiler in epigram. In J. Functional Programming, 2006.
13. Aleksandar Nanevski, Paul Govereau, and Greg Morrisett. Towards type-theoretic semantics for transactional concurrency. In Proc. TLDI, 2009.
14. Aleksandar Nanevski, Greg Morrisett, and Lars Birkedal. Polymorphism and separation in hoare type theory. In Proc. ICFP, 2006.
15. Aleksandar Nanevski, Greg Morrisett, Avraham Shinnar, Paul Govereau, and Lars Birkedal. Ynot: Dependent types for imperative programs. In Proc. ICFP, 2008.
16. Ulf Norell. Towards a Practical Programming Language Based on Dependent Type Theory. PhD thesis, Chalmers University of Technology, 2007.
17. Peter W. OHearn. Resources, concurrency, and local reasoning. Theor. Comput. Sci., 375(1-3):271-307, 2007.
18. Peter W. O'Hearn, John C. Reynolds, and Hongseok Yang. Local reasoning about programs that alter data structures. In Proc. CSL, 2001.
19. Nicolas Oury and Wouter Swierstra. The power of pi. Proc. ICFP, 2008.
20. Sharon E. Perl and Margo Seltzer. Data management for internet-scale single-sign-on. In Proc. WORLDS, 2006.
21. P. Rajagopalan and C. P. Tsang. A generic algebra for data collections based on constructive logic. In Algebraic Methodology and Software Technology, volume 936 of LNCS, pages 546-560. Springer Berlin / Heidelberg, 1995.
22. John C. Reynolds. Separation logic: A logic for shared mutable data structures. In Proc. LICS, 2002.
23. Alan Sexton and Hayo Thielecke. Reasoning about b+ trees with operational semantics and separation logic. Electron. Notes Theor. Comput. Sci., 218:355-369, 2008.
24. Alan Sexton and Hayo Thielecke. Reasoning about b+ trees with operational semantics and separation logic. Electron. Notes Theor. Comput. Sci., 218:355-369, 2008.
25. Carsten Sinz. System description: Ara - an automatic theorem prover for relation algebras. In Proc. CADE-17, 2000.
26. Matthieu Sozeau. Program-ing finger trees in coq. In Proc. ICFP, 2007.
27. Matthieu Sozeau and Nicolas Oury. First-class type classes. In Proc. TPHOLs, 2008.