| Scalable automatic test data generation from modeling diagrams |
| Full text |
Pdf
(715 KB)
|
Source
|
Automated Software Engineering
archive
Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering
table of contents
Atlanta, Georgia, USA
Pages 4-13
Year of Publication: 2007
ISBN:978-1-59593-882-4
|
|
Authors
|
|
| Sponsors |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 9, Downloads (12 Months): 76, Citation Count: 1
|
|
|
ABSTRACT
We explore the automatic generation of test data that respect constraints expressed in the Object-Role Modeling(ORM) language. ORM is a popular conceptual modelinglanguage, primarily targeting database applications, withsignificant uses in practice. The general problem of evenchecking whether an ORM diagram is satisfiable is quitehard: restricted forms are easily NP-hard and the problemis undecidable for some expressive formulations of ORM.Brute-force mapping to input for constraint and SAT solversdoes not scale: state-of-the-art solvers fail to find data to satisfy uniqueness and mandatory constraints in realistic time even for small examples. We instead define a restricted subset of ORM that allows efficient reasoning yet contains most constraints overwhelmingly used in practice. We show that the problem of deciding whether these constraints are consistent (i.e., whether we can generate appropriate test data) is solvable in polynomial time, and we produce a highly efficient (interactive speed) checker. Additionally, we analyze over 160 ORM diagrams that capture data models from industrial practice and demonstrate that our subset of ORM is expressive enough to handle their vast majority
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
F. A. Aloul, A. Ramani, I. L. Markov, and K. A. Sakallah. PBS: A backtrack search pseudo-boolean solver and optimizer. In Proc. Int. Symp. on the Theory and Applications of Satisfiability Testing (SAT), 2002.
|
| |
2
|
|
 |
3
|
|
 |
4
|
|
| |
5
|
|
 |
6
|
|
| |
7
|
|
| |
8
|
|
| |
9
|
T. A. Halpin. Object-role modeling (ORM/NIAM). In Handbook on Architectures of Information Systems, 1998.
|
| |
10
|
|
| |
11
|
|
| |
12
|
S. Heynmans. Decidable Open Answer Set Programming. PhD thesis, Vrije Universiteit Brussel, Department of Computer Science, 2006.
|
| |
13
|
|
| |
14
|
M. Jarrar and S. Heymans. Unsatisfiability reasoning in ORM conceptual schemes. In Int. Conf. on Semantics of a Networked World (ICSNW), 2005.
|
| |
15
|
C. M. Keet. Prospects for and issues with mapping the object-role modeling language into DLRifd. In Proc. Int. Workshop on Description Logics, 2007.
|
| |
16
|
|
 |
17
|
|
| |
18
|
|
| |
19
|
|
| |
20
|
|
| |
21
|
I. Shlyakhter, R. Seater, D. Jackson, M. Sridharan, and M. Taghdiri. Debugging overconstrained declarative models using unsatisfiable cores. In Proc. Automated Software Engineering (ASE), 2003.
|
| |
22
|
|
| |
23
|
P. van Bommel, A. ter Hofstede, and T. van der Weide. Semantics and verification of object-role models. Information Systems, 16(5):471--495, 1991.
|
| |
24
|
|
 |
25
|
|
|