Continuous T-Wise Coverage-Reference-Cited by-同舟云学术

Continuous T-Wise Coverage

Published:2023-08-28 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 27th ACM International Systems and Software Product Line Conference - Volume A
language:
Short-container-title:

Author:

Pett Tobias¹^ORCID,Heß Tobias²^ORCID,Krieter Sebastian²^ORCID,Thüm Thomas²^ORCID,Schaefer Ina³^ORCID

Affiliation:

1. Karlsruhe Institute for Technology (KIT), Germany

2. University of Ulm, Germany

3. Karlsruhe Institute for Technology (KIT); KASTEL, Germany

Funder

SofDCar

Engineering Secure Systems of the Helmholtz Association (HGF)

Ministry of Science, Research and Arts of the Federal State of Baden-Württemberg

KASTEL Security Research Labs

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3579027.3608980

Reference34 articles.

1. Mustafa Al-Hajjaji Sebastian Krieter Thomas Thüm Malte Lochau and Gunter Saake. 2016. IncLing: Efficient Product-line Testing Using Incremental Pairwise Sampling. 144--155. Mustafa Al-Hajjaji Sebastian Krieter Thomas Thüm Malte Lochau and Gunter Saake. 2016. IncLing: Efficient Product-line Testing Using Incremental Pairwise Sampling. 144--155.

2. Paul Ammann and Jeff Offutt . 2016. Introduction to software testing . Cambridge University Press . Paul Ammann and Jeff Offutt. 2016. Introduction to software testing. Cambridge University Press.

3. Sven Apel Don Batory Christian Kästner and Gunter Saake. 2013. Feature-Oriented Software Product Lines. Sven Apel Don Batory Christian Kästner and Gunter Saake. 2013. Feature-Oriented Software Product Lines.

4. Thorsten Berger Ralf Rublack Divya Nair Joanne M. Atlee Martin Becker Krzysztof Czarnecki and Andrzej Wąsowski. 2013. A Survey of Variability Modeling in Industrial Practice. 7:1--7:8. Thorsten Berger Ralf Rublack Divya Nair Joanne M. Atlee Martin Becker Krzysztof Czarnecki and Andrzej Wąsowski. 2013. A Survey of Variability Modeling in Industrial Practice. 7:1--7:8.

5. Vasek Chvatal . 1979. A Greedy Heuristic for the Set-Covering Problem. Mathematics of operations research 4, 3 ( 1979 ), 233--235. https://pubsonline.informs.org/doi/abs/10.1287/moor.4.3.233 Vasek Chvatal. 1979. A Greedy Heuristic for the Set-Covering Problem. Mathematics of operations research 4, 3 (1979), 233--235. https://pubsonline.informs.org/doi/abs/10.1287/moor.4.3.233

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Collecting Feature Models from the Literature: A Comprehensive Dataset for Benchmarking;28th ACM International Systems and Software Product Line Conference;2024-09-02

2. MulTi-Wise Sampling: Trading Uniform T-Wise Feature Interaction Coverage for Smaller Samples;28th ACM International Systems and Software Product Line Conference;2024-09-02

3. UnWise: High T-Wise Coverage from Uniform Sampling;Proceedings of the 18th International Working Conference on Variability Modelling of Software-Intensive Systems;2024-02-07