Generating Boundary Values from OCL Constraints using Constraints Rewriting and Search Algorithms

被引:0
|
作者
Ali, Shaukat [1 ]
Yue, Tao [1 ,2 ]
Qiu, Xiang [3 ]
Lu, Hong [1 ]
机构
[1] Simula Res Lab Norway, Fornebu, Norway
[2] Univ Oslo, N-0316 Oslo, Norway
[3] Beihang Univ, Sch Comp Sci & Engn, Beijing 100191, Peoples R China
关键词
UML; Object Constraint Language; Search-based testing; Test data; Boundary Value Analysis;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
A key component of model-based testing is the generation of test data from constraints (e.g., specified in the Object Constraint Language (OCL)) associated with models e.g., specified in the Unified Modeling Language (UML). The quality of test data eventually determines the effectiveness of test cases, e.g., fault detection and coverage. A simple way to generate test data from an OCL constraint is to find a set of values for all the variables that satisfies the constraint. One way of improving the quality of test data is by generating test data at the boundaries of each variable in the constraint. In this paper, we extend our search-based test data generation approach to generate test data at the boundaries of each variable involved in a constraint. We present different cases of constraints involving different types of variables and how we rewrite them in order to automatically generate boundary values using our existing OCL Solver called EsOCL based on a set of heuristics. We empirically evaluated our heuristics using three search algorithms, i.e., Genetic Algorithm, (1+1) Evolutionary Algorithm, and Alternating Variable Method, on industrial OCL constraints from our previous work. Results show that AVM on average achieved a 95% of success rate and outperformed the rest of the algorithms in finding all the boundary values of constraints in fewer generations.
引用
收藏
页码:379 / 386
页数:8
相关论文
共 50 条
  • [31] Safe reuse in modelling language engineering using model subtyping with OCL constraints
    Boronat, Artur
    SOFTWARE AND SYSTEMS MODELING, 2023, 22 (03): : 797 - 818
  • [32] A unified treatment of null values using constraints
    Candan, KS
    Grant, J
    Subrahmanian, VS
    INFORMATION SCIENCES, 1997, 98 (1-4) : 99 - 156
  • [33] DataSynth: Generating Synthetic Data using Declarative Constraints
    Arasu, Arvind
    Kaushik, Raghav
    Li, Jian
    PROCEEDINGS OF THE VLDB ENDOWMENT, 2011, 4 (12): : 1418 - 1421
  • [34] Using local search to speed up filtering algorithms for some NP-hard constraints
    Galinier, Philippe
    Hertz, Alain
    Paroz, Sandrine
    Pesant, Gilles
    ANNALS OF OPERATIONS RESEARCH, 2011, 184 (01) : 121 - 135
  • [35] Using local search to speed up filtering algorithms for some NP-hard constraints
    Philippe Galinier
    Alain Hertz
    Sandrine Paroz
    Gilles Pesant
    Annals of Operations Research, 2011, 184 : 121 - 135
  • [36] Using local search to speed up filtering algorithms for some NP-hard constraints
    Galinier, Philippe
    Hertz, Alain
    Paroz, Sandrine
    Pesant, Gilles
    INTEGRATION OF AI AND OR TECHNIQUES IN CONSTRAINT PROGRAMMING FOR COMBINATORIAL OPTIMIZATION PROBLEMS, 2008, 5015 : 298 - 302
  • [37] OPTIMAL SEARCH FOR CONJUNCTIVE GOALS USING CONSTRAINTS
    ELLMAN, J
    MEZZANATTO, G
    LECTURE NOTES IN ARTIFICIAL INTELLIGENCE, 1991, 549 : 98 - 107
  • [38] Rewriting queries using views with access patterns under integrity constraints
    Deutsch, A
    Ladäscher, B
    Nash, A
    DATABASE THEORY - ICDT 2005, PROCEEDINGS, 2005, 3363 : 352 - 367
  • [39] Rewriting queries using views with access patterns under integrity constraints
    Deutsch, Alin
    Ludascher, Bertram
    Nash, Alan
    THEORETICAL COMPUTER SCIENCE, 2007, 371 (03) : 200 - 226
  • [40] Attribute Handling for Generating Preconditions from Graph Constraints
    Deckwerth, Frederik
    Varro, Gergely
    GRAPH TRANSFORMATION, 2014, 8571 : 81 - 96