Filters








7,726 Hits in 6.1 sec

Combining Satisfiability Solving and Heuristics to Constrained Combinatorial Interaction Testing [chapter]

Andrea Calvagna, Angelo Gargantini
2009 Lecture Notes in Computer Science  
In this context we dened a new greedy approach to generate a combinatorial interaction test suites in the presence of constraints, based on integration of an SMT solver, and ordered processing of test  ...  Combinatorial interaction testing aims at revealing errors inside a system under test triggered by unintended interaction between values of its input parameters.  ...  If constraints are considered, then the combinatorial testing becomes constrained combinatorial interaction testing (CCIT).  ... 
doi:10.1007/978-3-642-02949-3_4 fatcat:hvm2m2ocnfc7hnotvnckvel6j4

Constrained Interaction Testing: A Systematic Literature Study

Bestoun S. Ahmed, Kamal Z. Zamli, Wasif Afzal, Miroslav Bures
2017 IEEE Access  
Handling constraints effectively and efficiently in combinatorial interaction testing is a challenging problem.  ...  This paper presents the first comprehensive and systematic literature study to structure and categorize the research contributions for constrained interaction testing.  ...  In fact, this method is initiated and solved by normal combinatorial interaction testing.  ... 
doi:10.1109/access.2017.2771562 fatcat:atudnzauiveolbmq6cx5ol4kti

Constraints: The Future of Combinatorial Interaction Testing

Justyna Petke
2015 2015 IEEE/ACM 8th International Workshop on Search-Based Software Testing  
Combinatorial Interaction Testing (CIT) has gained a lot of attention in the area of software engineering in the last few years. CIT problems have their roots in combinatorics.  ...  With the adoption of these techniques into the area of software testing, an important gap has been identified -namely consideration of real-world constraints.  ...  A comprehensive survey on Combinatorial Interaction Testing has been conducted by Nie and Leung in 2011 [4] .  ... 
doi:10.1109/sbst.2015.11 dblp:conf/icse/Petke15 fatcat:rrbwyyxxxfbhtmix5oazlygfia

Applications of Simulated Annealing-Based Approaches to Electric Power Systems [chapter]

Yann-Chang Huang, Huo-Ching Sun, Kun-Yuan Huang
2012 Simulated Annealing - Advances, Applications and Hybridizations  
An interactive satisfying method, a two-level structure, was proposed to solve the multiobjective power system Var planning (Chen & Liu, 1995) .  ...  Recently, these new heuristic tools have been combined with each other and with knowledge to solve extremely challenging problems.  ... 
doi:10.5772/50388 fatcat:wxex3l3w3vauremkbili5r35am

Combinatorial Interaction Testing for Automated Constraint Repair

Angelo Gargantini, Justyna Petke, Marco Radavelli
2017 2017 IEEE International Conference on Software Testing, Verification and Validation Workshops (ICSTW)  
Combinatorial Interaction Testing (CIT) methods are already often used to drive systematic testing of software system configurations.  ...  Our technique can be used to detect and fix faults both in the model and in the real software system.  ...  ACKNOWLEDGEMENTS We would like to thank Laleh Sh. Ghandehari for her assistance in the use of BEN and Paolo Vavassori for help with the experiments.  ... 
doi:10.1109/icstw.2017.44 dblp:conf/icst/GargantiniPR17 fatcat:kx437bb3cbh5zjgjm4jlt6dd4y

A Survey of Constrained Combinatorial Testing [article]

Huayao Wu, Changhai Nie, Justyna Petke, Yue Jia, Mark Harman
2019 arXiv   pre-print
Since real-world programs are usually constrained, this survey can be of interest to researchers and practitioners who are looking to use and study constrained combinatorial testing techniques.  ...  To ensure the wider applicability of CT in the presence of constrained problem domains, large and diverse efforts have been invested towards the techniques and applications of constrained combinatorial  ...  These papers are collected from Combinatorial Testing Repository (http://gist.nju.edu.cn/ct repository).  ... 
arXiv:1908.02480v1 fatcat:6lwlajcyfjha7avjnqpl77naiy

PLEDGE

Christopher Henard, Mike Papadakis, Gilles Perrouin, Jacques Klein, Yves Le Traon
2013 Proceedings of the 17th International Software Product Line Conference co-located workshops on - SPLC '13 Workshops  
Ideally, testing a SPL involves testing all the software products that can be configured through the combination of features.  ...  This, however, is intractable in practice since a) large SPLs can lead to millions of possible software variants and b) the testing process is usually limited by budget and time constraints.  ...  It solves the challenge of testing a SPL in the context of Combinatorial Interaction Testing by selecting the products which maximize the t-wise interactions between features.  ... 
doi:10.1145/2499777.2499778 dblp:conf/splc/HenardPPKT13a fatcat:qqw3rjipmrb6dlussl5be6z7wi

Interaction testing of highly-configurable systems in the presence of constraints

Myra B. Cohen, Matthew B. Dwyer, Jiangfan Shi
2007 Proceedings of the 2007 international symposium on Software testing and analysis - ISSTA '07  
Combinatorial interaction testing (CIT) is a method to sample configurations of a software system systematically for testing.  ...  We then present a general constraint representation and solving technique that can be integrated with existing CIT algorithms and compare two constraint-enhanced algorithm implementations with existing  ...  , and 0541263.  ... 
doi:10.1145/1273463.1273482 dblp:conf/issta/CohenDS07 fatcat:2vshgkqazreevdxq72pwquzrpy

Bounded rationality in problem solving: Guiding search with domain-independent heuristics

Pat Langley, Chris Pearce, Mike Barley, Miranda Emery
2014 Mind & Society  
Humans exhibit the remarkable ability to solve complex, multi-step problems despite their limited capacity for search.  ...  We describe FPS, a flexible architecture for problem solving that supports a variety of different strategies and heuristics, and we report its use in an experiment that studies the effectiveness of two  ...  The first author is also affiliated with Carnegie Mellon Silicon Valley and Institute for the Study of Learning and Expertise.  ... 
doi:10.1007/s11299-014-0143-y fatcat:zojokvqbpzfnzdoigjsplgqntm

A Formal Logic Approach to Constrained Combinatorial Testing

Andrea Calvagna, Angelo Gargantini
2010 Journal of automated reasoning  
In this approach, test predicates are used to formalize combinatorial testing as a logical problem, and an external formal logic tool is applied to solve it.  ...  Combinatorial testing is as an eective testing technique to reveal failures in a given system, based on input combinations coverage and combinatorial optimization.  ...  Acknowledgements The authors would like to thank Myra B. Cohen for kindly supporting us in the performance evaluation work by giving us access to the specications of the SPIN and GCC case studies.  ... 
doi:10.1007/s10817-010-9171-4 fatcat:f3rcbtitxjf65pue6bfwuikm4u

Constrained Combinatorial Optimization with Reinforcement Learning [article]

Ruben Solozabal and Josu Ceberio and Martin Takáč
2020 arXiv   pre-print
Conducted experiments on the constrained Job Shop and Resource Allocation problems prove the superiority of the proposal for computing rapid solutions when compared to classical heuristic, metaheuristic  ...  This paper presents a framework to tackle constrained combinatorial optimization problems using deep Reinforcement Learning (RL).  ...  Acknowledgments and Disclosure of Funding  ... 
arXiv:2006.11984v1 fatcat:cp3mnl5tkrdhvfjobkckspgngi

The unconstrained binary quadratic programming problem: a survey

Gary Kochenberger, Jin-Kao Hao, Fred Glover, Mark Lewis, Zhipeng Lü, Haibo Wang, Yang Wang
2014 Journal of combinatorial optimization  
In recent years the unconstrained binary quadratic program (UBQP) has grown in importance in the field of combinatorial optimization due to its application potential and its computational challenge.  ...  In this paper we survey the literature on this important model, providing an overview of the applications and solution methods.  ...  The new bounding techniques and variable fixing conditions were combined in a branch-and-bound method and tested on standard problems with up to 200 variables.  ... 
doi:10.1007/s10878-014-9734-0 fatcat:327tskcshbdz3bzt6j4ijkgx7e

Combinatorial Test Suites Generation Strategy Utilizing the Whale Optimization Algorithm

Ali Abdullah Hassan, Salwani Abdullah, Kamal Z. Zamli, Rozilawati Razali
2020 IEEE Access  
The first au-thor would like to express his gratitude to Hadhramout Foundation, Yemen, for their support in tuition fees.  ...  ACKNOWLEDGMENT This work was supported by the Ministry of Education, Malaysia (FRGS /1/2019/ICT02/UKM/01/1), and the Universiti Kebangsaan Malaysia (DIP-2016-024).  ...  RELATED WORK Combinatorial interaction testing strategies use Greedy test suite construction algorithms [17] . Every iteration of the design process aims to cover the maximum number of combinations.  ... 
doi:10.1109/access.2020.3032851 fatcat:gt7kdvcojzc5fgu7b3cg7koc3u

An Efficient Algorithm for Constraint Handling in Combinatorial Test Generation

Linbin Yu, Yu Lei, Mehra Nourozborazjany, Raghu N. Kacker, D. Richard Kuhn
2013 2013 IEEE Sixth International Conference on Software Testing, Verification and Validation  
An important problem in combinatorial testing is dealing with constraints, i.e., restrictions that must be satisfied in order for a test to be valid.  ...  Combinatorial testing has been shown to be a very effective testing strategy.  ...  Both combinatorial testing and constraint solving are computation-intensive processes. The main challenge of constrained combinatorial test generation is dealing with this complexity.  ... 
doi:10.1109/icst.2013.35 dblp:conf/icst/YuLBKK13 fatcat:b2wweoqre5f5hk2xf5syhl6hhe

Analytics and Machine Learning in Vehicle Routing Research [article]

Ruibin Bai and Xinan Chen and Zhi-Long Chen and Tianxiang Cui and Shuhui Gong and Wentao He and Xiaoping Jiang and Huan Jin and Jiahuan Jin and Graham Kendall and Jiawei Li and Zheng Lu and Jianfeng Ren and Paul Weng and Ning Xue and Huayan Zhang
2021 arXiv   pre-print
To tackle the complexities, uncertainties and dynamics involved in real-world VRP applications, Machine Learning (ML) methods have been used in combination with analytical approaches to enhance problem  ...  formulations and algorithmic performance across different problem solving scenarios.  ...  Ningbo Science and Technology Bureau (grant numbers 2019B10026, 2017D10034).  ... 
arXiv:2102.10012v1 fatcat:ihs27x2qu5c55fljxuy4fhawgq
« Previous Showing results 1 — 15 out of 7,726 results