A formal logic approach to constrained combinatorial testing

DOI10.1007/S10817-010-9171-4zbMath1213.68131OpenAlexW2000478763MaRDI QIDQ616856

Angelo Gargantini, Andrea Calvagna

Publication date: 12 January 2011

Published in: Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10817-010-9171-4

zbMATH Keywords

combinatorial optimizationverification and validationtest generationmodel-based testingcombinatorial testinghighly-configurable software systems

Mathematics Subject Classification ID

Logic in computer science (03B70) Reliability, testing and fault tolerance of networks and computer systems (68M15) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Uses Software

• SPIN
• AETG
• SAL

Cites Work

• Constraint models for the covering test problem
• Upper bounds for covering arrays by tabu search.
• Problems and algorithms for covering arrays
• Vector sets for exhaustive testing of logic circuits
• A Greedy Heuristic for the Set-Covering Problem
• Using Model Checking to Generate Fault Detecting Tests
• A Logic-Based Approach to Combinatorial Testing with Constraints
• Orthogonal Arrays of Strength two and three
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A formal logic approach to constrained combinatorial testing