Abstract. Solvers for satisfiability modulo theories (SMT) check the satisfiability of first-order formulas containing operations from various theories such as the Booleans, bit-ve...
Abstract—Software Product Lines (SPL) are difficult to validate due to combinatorics induced by variability across their features. This leads to combinatorial explosion of the n...
Gilles Perrouin, Sagar Sen, Jacques Klein, Benoit ...
Abstract: This paper presents a new approach to Automatic GUI Test Case Generation and Validation: a use case-guided technique to reduce the effort required in GUI modeling and tes...
Pedro Luis Mateo Navarro, Diego Sevilla Ruiz, Greg...