skip to main content
10.1145/1321631.1321635acmconferencesArticle/Chapter ViewAbstractPublication PagesaseConference Proceedingsconference-collections
keynote

Scalable automatic test data generation from modeling diagrams

Published: 05 November 2007 Publication History

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

[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]
D. Calvanese and M. Lenzerini. On the interaction between isa and cardinality constraints. In Proc. Int. Conf. on Data Engineering (ICDE), 1994.
[3]
Y. Deng, P. G. Frankl, and D. Chays. Testing database transactions with AGENDA. In Proc. Int. Conf. on Software Engineering (ICSE), 2005.
[4]
A. Egyed. Instant consistency checking for the UML. In Proc. Int. Conf. on Software Engineering (ICSE), 2006.
[5]
A. Egyed. Fixing inconsistencies in UML design models. In Proc. Int. Conf. on Software Engineering (ICSE), 2007.
[6]
W. Fan and L. Libkin. On XML integrity constraints in the presence of DTDs. J. ACM, 49(3):368--406, 2002.
[7]
J. Grant and J. Minker. Inferences for numerical dependencies. Theor. Comput. Sci., 41(2--3):271--287, 1985.
[8]
T. A. Halpin. A fact-oriented approach to schema transformation. In Proc. Mathematical Fundamentals of Database and Knowledge Base Systems (MFDBS), 1991.
[9]
T. A. Halpin. Object-role modeling (ORM/NIAM). In Handbook on Architectures of Information Systems, 1998.
[10]
T. A. Halpin. Information Modeling and Relational Databases. Morgan Kaufmann, 2001.
[11]
T. A. Halpin and H. A. Proper. Database schema transformation and optimization. In Proc. Object-Oriented and Entity-Relationship Modelling (OOER), 1995.
[12]
S. Heynmans. Decidable Open Answer Set Programming. PhD thesis, Vrije Universiteit Brussel, Department of Computer Science, 2006.
[13]
D. Jackson. Software abstractions: Logic, language, and analysis. MIT Press, 2006.
[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]
S. Khurshid and D. Jackson. Exploring the design of an intentional naming scheme with an automatic constraint analyzer. In Proc. Automated Software Engineering (ASE), 2000.
[17]
P. Manolios, G. Subramanian, and D. Vroon. Automating component-based system assembly. In Proc. Int. Symp. on Software Testing and Analysis (ISSTA), 2007.
[18]
C. Nentwich, W. Emmerich, and A. Finkelstein. Consistency management with repair actions. In Proc. Int. Conf. on Software Engineering (ICSE), 2003.
[19]
A. Neufeld, G. Moerkotte, and P. C. Lockemann. Generating consistent test data: Restricting the search space by a generator formula. VLDB Journal, 2:173--213, 1993.
[20]
G. M. Nijssen and T. A. Halpin. Conceptual schema and relational database design: A fact oriented approach. Prentice-Hall, 1989.
[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]
M. Taghdiri. Inferring specifications to detect errors in code. In Proc. Automated Software Engineering (ASE), 2004.
[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]
I. Warren, J. Sun, S. Krishnamohan, and T. Weerasinghe. An automated formal approach to managing dynamic reconfiguration. In Proc. Automated Software Engineering (ASE), 2006.
[25]
D. Willmor and S. M. Embury. An intensional approach to the specification of test cases for database applications. In Proc. Int. Conf. on Software Engineering (ICSE), 2006.

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
ASE '07: Proceedings of the 22nd IEEE/ACM International Conference on Automated Software Engineering
November 2007
590 pages
ISBN:9781595938824
DOI:10.1145/1321631
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 05 November 2007

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. NP-hardness
  2. ORM
  3. ORM-modeling
  4. test databases

Qualifiers

  • Keynote

Conference

ASE07

Acceptance Rates

Overall Acceptance Rate 82 of 337 submissions, 24%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)4
  • Downloads (Last 6 weeks)0
Reflects downloads up to 08 Feb 2025

Other Metrics

Citations

Cited By

View all

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media