Paper Info
Title
Towards testing of full-scale SQL applications using relational symbolic execution
Abstract
Constraint-based testing is an automatic test case generation approach where the tested application is transformed into constraints whose solutions are adequate test data. In previous work, we have shown that this technique is particularly well-suited for testing SQL applications, as the semantics of SQL can be naturally transformed into standard SMT constraints, using so-called relational symbolic execution. In particular, we have demonstrated such testing to be possible in practice with current solver techniques for small-scale applications. In this work, we identify the main challenges and provide research directions towards constraint-based testing of full-scale SQL applications. We investigate the additional research work needed to integrate relational and dynamic symbolic execution, handle properly dynamic SQL, generate tractable SMT constraints for most SQL applications, detect SQL runtime errors and deal with non-deterministic SQL.
Year
DOI
Venue
2014
10.1145/2593735.2593738
CSTVA
Keywords
Field
DocType
sql,quantifiers,smt solvers,symbolic execution,mathematical logic,verification,test data generation,fault localization,languages,databases,testing and debugging
SQL,PL/SQL,Stored procedure,Programming language,Computer science,Language Integrated Query,Data definition language,User-defined function,Query by Example,Null (SQL)
Conference
Citations 
PageRank 
References 
1
0.35
30
Authors
3
Name
Order
Citations
PageRank
Michaël Marcozzi1275.55
Wim Vanhoof222621.26
Jean-Luc Hainaut3901254.54