Michael Wagner

According to our database, Michael Wagner authored at least 16 papers between 2019 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

State of the CArt: evaluating covering array generators at scale.

Manuel Leithner, Andrea Bombarda, Michael Wagner, Angelo Gargantini, Dimitris E. Simos

Int. J. Softw. Tools Technol. Transf., June, 2024

Algorithmic Optimizations for Deriving Minimal Forbidden Tuples.

Michael Wagner, Irene Hiess, Ludwig Kampel, Dimitris E. Simos, Yu Lei

Proceedings of the IEEE International Conference on Software Testing, Verification and Validation, ICST 2024, 2024

2023

Algorithmic methods for covering arrays of higher index.

Ryan E. Dougherty, Kristoffer Kleine, Michael Wagner, Charles J. Colbourn, Dimitris E. Simos

J. Comb. Optim., 2023

Applying Pairwise Combinatorial Testing to Large Language Model Testing.

Bernhard Garn, Ludwig Kampel, Manuel Leithner, Berina Celic, Ceren Çulha, Irene Hiess, Klaus Kieseberg, Marlene Koelbing, Dominik-Philip Schreiber, Michael Wagner, Christoph Wech, Jovan Zivanovic, Dimitris E. Simos

Proceedings of the Testing Software and Systems, 2023

Summary of In-Parameter-Order strategies for covering perfect hash families.

Michael Wagner, Charles J. Colbourn, Dimitris E. Simos

Proceedings of the IEEE International Conference on Software Testing, Verification and Validation, ICST 2023, 2023

Applying CT-FLA for AEB Function Testing: A Virtual Driving Case Study.

Ludwig Kampel, Michael Wagner, Dimitris E. Simos, Mihai Nica, Dino Dodig, David Kaufmann, Franz Wotawa

Proceedings of the IEEE International Conference on Software Testing, Verification and Validation, ICST 2023, 2023

2022

A primer on the application of neural networks to covering array generation.

Ludwig Kampel, Michael Wagner, Ilias S. Kotsireas, Dimitris E. Simos

Optim. Methods Softw., 2022

In-Parameter-Order strategies for covering perfect hash families.

Michael Wagner, Charles J. Colbourn, Dimitris E. Simos

Appl. Math. Comput., 2022

IPO-MAXSAT: The In-Parameter-Order Strategy combined with MaxSAT solving for Covering Array Generation.

Irene Hiess, Ludwig Kampel, Michael Wagner, Dimitris E. Simos

Proceedings of the 24th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2022

IPO-MAXSAT: Combining the In-Parameter-Order Strategy for Covering Array Generation with MaxSAT Solving (Extended Abstract).

Irene Hiess, Ludwig Kampel, Michael Wagner, Dimitris E. Simos

Proceedings of the Fifteenth International Symposium on Combinatorial Search, 2022

Developing multithreaded techniques and improved constraint handling for the tool CAgen.

Michael Wagner, Manuel Leithner, Dimitris E. Simos, Rick Kuhn, Raghu Kacker

Proceedings of the 15th IEEE International Conference on Software Testing, 2022

2021

Heuristically Enhanced IPO Algorithms for Covering Array Generation.

Michael Wagner, Ludwig Kampel, Dimitris E. Simos

Proceedings of the Combinatorial Algorithms - 32nd International Workshop, 2021

2020

CAGEN: A fast combinatorial test generation tool with support for constraints and higher-index arrays.

Michael Wagner, Kristoffer Kleine, Dimitris E. Simos, Rick Kuhn, Raghu Kacker

Proceedings of the 13th IEEE International Conference on Software Testing, 2020

2019

Quantum-Inspired Evolutionary Algorithms for Covering Arrays of Arbitrary Strength.

Michael Wagner, Ludwig Kampel, Dimitris E. Simos

Proceedings of the Analysis of Experimental Algorithms - Special Event, 2019

IPO-Q: A Quantum-Inspired Approach to the IPO Strategy Used in CA Generation.

Michael Wagner, Ludwig Kampel, Dimitris E. Simos

Proceedings of the Mathematical Aspects of Computer and Information Sciences, 2019

How to Use Boltzmann Machines and Neural Networks for Covering Array Generation.

Ludwig Kampel, Michael Wagner, Ilias S. Kotsireas, Dimitris E. Simos

Proceedings of the Learning and Intelligent Optimization - 13th International Conference, 2019