Verifying equivalence of database-driven applications

• Published in: Proceedings of ACM on programming languages 2018-01, Vol.2 (POPL), p.1-29
• Main Authors: Wang, Yuepeng, Dillig, Isil, Lahiri, Shuvendu K., Cook, William R.
• Format: Article
• Language: English
• ISSN: 2475-1421; 2475-1421
• DOI: 10.1145/3158144

This paper addresses the problem of verifying equivalence between a pair of programs that operate over databases with different schemas. This problem is particularly important in the context of web applications, which typically undergo database refactoring either for performance or maintainability reasons. While web applications should have the same externally observable behavior before and after schema migration, there are no existing tools for proving equivalence of such programs. This paper takes a first step towards solving this problem by formalizing the equivalence and refinement checking problems for database-driven applications. We also propose a proof methodology based on the notion of bisimulation invariants over relational algebra with updates and describe a technique for synthesizing such bisimulation invariants. We have implemented the proposed technique in a tool called Mediator for verifying equivalence between database-driven applications written in our intermediate language and evaluate our tool on 21 benchmarks extracted from textbooks and real-world web applications. Our results show that the proposed methodology can successfully verify 20 of these benchmarks.