• English
    • svenska
  • svenska 
    • English
    • svenska
  • Logga in
Redigera dokument 
  •   Startsida
  • Student essays / Studentuppsatser
  • Department of Applied Information Technology / Institutionen för tillämpad informationsteknologi
  • Kandidatuppsatser/Bachelor theses / Institutionen för tillämpad informationsteknologi
  • Redigera dokument
  •   Startsida
  • Student essays / Studentuppsatser
  • Department of Applied Information Technology / Institutionen för tillämpad informationsteknologi
  • Kandidatuppsatser/Bachelor theses / Institutionen för tillämpad informationsteknologi
  • Redigera dokument
JavaScript is disabled for your browser. Some features of this site may not work without it.

Model Based Testing of Data Constraints

Sammanfattning
Correct implementation of data constraints, such as referential integrity constraints and business rules is an essential precondition for data consistency. Though most modern commercial DBMSs support data constraints, the latter are often implemented in the business logic of the applications. This is especially true for non relational DBMS likeMnesia, which do not provide constraints enforcement mechanisms. This case study examines a database application which uses Mnesia as data storage in order to determine, express and test data constraints with Quviq QuickCheck, adopting a model-based testing approach. Some of the important stages of the study described in the article are: reverse engineering of the database, analysis of the obtained database structure diagrams and extraction of data constraint, validation of constraints, formulating the test specifications and finally running the generated test suits. As a result of running the test suits randomly generated by QuickCheck, we have detected several violations of the identified and validated business rules. We have found that the applied methodology is suitable for applications using non relational, unnormalized databases. It is important to note the methodology applied within the case study is not bound to a specific application or DBMS, and can be applied to other database applications
Examinationsnivå
Kandidatuppsats
Bachelor thesis
URL:
http://hdl.handle.net/2077/21658
Samlingar
  • Kandidatuppsatser/Bachelor theses / Institutionen för tillämpad informationsteknologi
Fil(er)
gupea_2077_21658_1.pdf (195.5Kb)
Datum
2009-12-21
Författare
Paladi, Nicolae
Serie/rapportnr.
Report/Department of Applied Information Technology
2009:004
Språk
eng
Metadata
Visa fullständig post

DSpace software copyright © 2002-2016  DuraSpace
gup@ub.gu.se | Teknisk hjälp
Theme by 
Atmire NV
 

 

Visa

VisaSamlingarI datumordningFörfattareTitlarNyckelordDenna samlingI datumordningFörfattareTitlarNyckelord

Mitt konto

Logga inRegistrera dig

DSpace software copyright © 2002-2016  DuraSpace
gup@ub.gu.se | Teknisk hjälp
Theme by 
Atmire NV