Maintaining Database Integrity with Refinement Types [chapter]

Ioannis G. Baltopoulos, Johannes Borgström, Andrew D. Gordon
2011 Lecture Notes in Computer Science  
Given recent advances in automated theorem proving, we present a new method for determining whether database transactions preserve integrity constraints. We consider check constraints and referential-integrity constraintsextracted from SQL table declarations-and application-level invariants expressed as formulas of first-order logic. Our motivation is to use static analysis of database transactions at development time, to catch bugs early, or during deployment, to allow only
more » ... stored procedures to be accepted. We work in the setting of a functional multi-tier language, where functional code is compiled to SQL that queries and updates a relational database. We use refinement types to track constraints on data and the underlying database. Our analysis uses a refinement-type checker, which relies on recent highly efficient SMT algorithms to check proof obligations. Our method is based on a list-processing semantics for an SQL fragment within the functional language, and is illustrated by a series of examples.
doi:10.1007/978-3-642-22655-7_23 fatcat:mt5tgb6yivfc7o2gw7pt5xfgvy