A relational symbolic execution algorithm for constraint-based testing of database programs

• Published in: 2013 IEEE 13th International Working Conference on Source Code Analysis and Manipulation (SCAM) pp. 179 - 188
• Main Authors: Marcozzi, Michael, Vanhoof, Wim, Hainaut, Jean-Luc
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01.09.2013
• Subjects: Conferences; Indexes; Java; Metals; Software; Testing
• DOI: 10.1109/SCAM.2013.6648200

In constraint-based program testing, symbolic execution is a technique which allows to generate test data exercising a given execution path, selected within the program to be tested. Applied to a set of paths covering a sufficient part of the code under test, this technique permits to generate automatically adequate test sets for units of code. As databases are ubiquitous in software, generalizing such a technique for efficient testing of programs manipulating databases is an interesting approach to enhance the reliability of software. In this work, we propose a relational symbolic execution algorithmto be used for testing of simple Java methods, reading and writing with transactional SQL in a relational database, subject to integrity constraints. This algorithm considers the Java method under test as a sequence of operations over a set of constrained relational variables, modeling both the database tables and the method variables. By integrating this relational model of the method and database with the classical symbolic execution process, the algorithm can generate a set of Alloy constraints for any finite path to test in the control-flow graph of the method. Solutions of these constraints are data which constitute a test case, including valid content for the database, which exercises the selected path in the method. A tool implementing the proposed algorithm is demonstrated over a number of examples.