Abstract
In constraint-based program testing, sym- bolic 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 algorithm to 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.
| Original language | English |
|---|---|
| Title of host publication | IEEE 13th International Working Conference on Source Code Analysis and Manipulation, SCAM 2013 |
| Publisher | IEEE Computer society |
| Pages | 179-188 |
| Number of pages | 10 |
| ISBN (Print) | 9781467357395 |
| DOIs | |
| Publication status | Published - 22 Sep 2013 |
| Event | 2013 IEEE 13th International Working Conference on Source Code Analysis and Manipulation, SCAM 2013 - Eindhoven, Netherlands Duration: 22 Sep 2013 → 23 Sep 2013 |
Conference
| Conference | 2013 IEEE 13th International Working Conference on Source Code Analysis and Manipulation, SCAM 2013 |
|---|---|
| Country | Netherlands |
| City | Eindhoven |
| Period | 22/09/13 → 23/09/13 |
Fingerprint
Cite this
}
A relational symbolic execution algorithm for constraint-based testing of database programs. / Marcozzi, Michaël; Vanhoof, Wim; Hainaut, Jean-Luc.
IEEE 13th International Working Conference on Source Code Analysis and Manipulation, SCAM 2013. IEEE Computer society, 2013. p. 179-188 6648200.Research output: Contribution in Book/Catalog/Report/Conference proceeding › Conference contribution
TY - GEN
T1 - A relational symbolic execution algorithm for constraint-based testing of database programs
AU - Marcozzi, Michaël
AU - Vanhoof, Wim
AU - Hainaut, Jean-Luc
PY - 2013/9/22
Y1 - 2013/9/22
N2 - In constraint-based program testing, sym- bolic 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 algorithm to 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.
AB - In constraint-based program testing, sym- bolic 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 algorithm to 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.
UR - http://www.scopus.com/inward/record.url?scp=84891067383&partnerID=8YFLogxK
U2 - 10.1109/SCAM.2013.6648200
DO - 10.1109/SCAM.2013.6648200
M3 - Conference contribution
AN - SCOPUS:84891067383
SN - 9781467357395
SP - 179
EP - 188
BT - IEEE 13th International Working Conference on Source Code Analysis and Manipulation, SCAM 2013
PB - IEEE Computer society
ER -