Abstract
We study the problem of generating a database and parameters for a given parameterized SQL query satisfying a given test condition. We introduce a formal background theory that includes arithmetic, tuples, and sets, and translate the generation problem into a satisfiability or model generation problem modulo the background theory. We use the satisfiability modulo theories (SMT) solver Z3 in the concrete implementation. We describe an application of model generation in the context of the database unit testing framework of Visual Studio. © Springer-Verlag Berlin Heidelberg 2009.
Cite
CITATION STYLE
Veanes, M., Grigorenko, P., De Halleux, P., & Tillmann, N. (2009). Symbolic query exploration. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5885 LNCS, pp. 49–68). https://doi.org/10.1007/978-3-642-10373-5_3
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
