Inferences for numerical dependencies
Theoretical Computer Science
Conceptual schema and relational database design: a fact oriented approach
Conceptual schema and relational database design: a fact oriented approach
A fact-oriented approach to schema transformation
MFDBS 91 Proceedings of the 3rd symposium on Mathematical fundamentals of database and knowledge base systems
On XML integrity constraints in the presence of DTDs
Journal of the ACM (JACM)
Generating consistent test data: restricting the search space by a generator formula
The VLDB Journal — The International Journal on Very Large Data Bases
On the Interaction Between ISA and Cardinality Constraints
Proceedings of the Tenth International Conference on Data Engineering
On The Satisfiability of Dependency Constraints in Entity-Relationship Schemata
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Database Schema Transformation and Optimization
OOER '95 Proceedings of the 14th International Conference on Object-Oriented and Entity-Relationship Modelling
Consistency management with repair actions
Proceedings of the 25th International Conference on Software Engineering
Exploring the Design of an Intentional Naming Scheme with an Automatic Constraint Analyzer
ASE '00 Proceedings of the 15th IEEE international conference on Automated software engineering
Inferring Specifications to Detect Errors in Code
Proceedings of the 19th IEEE international conference on Automated software engineering
Testing database transactions with AGENDA
Proceedings of the 27th international conference on Software engineering
Reasoning on UML class diagrams
Artificial Intelligence
An intensional approach to the specification of test cases for database applications
Proceedings of the 28th international conference on Software engineering
Instant consistency checking for the UML
Proceedings of the 28th international conference on Software engineering
Software Abstractions: Logic, Language, and Analysis
Software Abstractions: Logic, Language, and Analysis
An Automated Formal Approach to Managing Dynamic Reconfiguration
ASE '06 Proceedings of the 21st IEEE/ACM International Conference on Automated Software Engineering
Fixing Inconsistencies in UML Design Models
ICSE '07 Proceedings of the 29th international conference on Software Engineering
Automating component-based system assembly
Proceedings of the 2007 international symposium on Software testing and analysis
Scalable automatic test data generation from modeling diagrams
Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering
Information Modeling and Relational Databases
Information Modeling and Relational Databases
ECMDA-FA'07 Proceedings of the 3rd European conference on Model driven architecture-foundations and applications
Consistency checking algorithms for restricted UML class diagrams
FoIKS'06 Proceedings of the 4th international conference on Foundations of Information and Knowledge Systems
Scalable analysis of conceptual data models
Proceedings of the 2011 International Symposium on Software Testing and Analysis
Unbounded data model verification using SMT solvers
Proceedings of the 27th IEEE/ACM International Conference on Automated Software Engineering
Scalable test data generation from multidimensional models
Proceedings of the ACM SIGSOFT 20th International Symposium on the Foundations of Software Engineering
Data model property inference and repair
Proceedings of the 2013 International Symposium on Software Testing and Analysis
Hi-index | 0.00 |
We explore the automatic generation of test data that respect constraints expressed in the Object-Role Modeling (ORM) language. ORM is a popular conceptual modeling language, primarily targeting database applications, with significant uses in practice. The general problem of even checking whether an ORM diagram is satisfiable is quite hard: restricted forms are easily NP-hard and the problem is undecidable for some expressive formulations of ORM. Brute-force mapping to input for constraint and SAT solvers does 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.