Purdue_University_Thesis___Kia_Rahmani (4).pdf (6.89 MB)
SYMBOLIC ANALYSIS OF WEAK CONCURRENCY SEMANTICS IN MODERN DATABASE PROGRAMS
The goal of this dissertation is to design a collection of techniques and tools that enable
the ease of programming under the traditional strong concurrency guarantees, without sacrificing the performance offered by modern distributed database systems. Our main thesis
is that language-centric reasoning can help developers efficiently identify and eliminate con-
currency anomalies in modern database programs, and we have demonstrated that it results
in faster and safer database programs
History
Degree Type
- Doctor of Philosophy
Department
- Computer Science
Campus location
- West Lafayette