Validating SMT Solvers for Correctness and Performance via Grammar-Based Enumeration. - Winterer, Dominik; Su, Zhendong (Proc. ACM Program. Lang., 2024)

Compilation Quotient (CQ): A Metric for the Compilation Hardness of Programming Languages. - Szabo, Vince; Winterer, Dominik; Su, Zhendong (CoRR, 2024)

Finding and Understanding Incompleteness Bugs in SMT Solvers. - Bringolf, Mauro; Winterer, Dominik; Su, Zhendong (2022)

Generative type-aware mutation for testing SMT solvers. - Park, Jiwon; Winterer, Dominik; Zhang, Chengyu; Su, Zhendong (Proc. ACM Program. Lang., 2021)

On the unusual effectiveness of type-aware operator mutations for testing SMT solvers. - Winterer, Dominik; Zhang, Chengyu; Su, Zhendong (Proc. ACM Program. Lang., 2020)

Validating SMT solvers via semantic fusion. - Winterer, Dominik; Zhang, Chengyu; Su, Zhendong (2020)

On the Unusual Effectiveness of Type-aware Mutations for Testing SMT Solvers. - Winterer, Dominik; Zhang, Chengyu; Su, Zhendong (CoRR, 2020)

Oversubscription Planning as Classical Planning with Multiple Cost Functions. - Katz, Michael; Keyder, Emil; Winterer, Dominik; Pommerening, Florian (2019)

A Novel Iterative Approach to Top-k Planning. - Katz, Michael; Sohrabi, Shirin; Udrea, Octavian; Winterer, Dominik (2018)

Stubborn Sets for Fully Observable Nondeterministic Planning. - Winterer, Dominik; Alkhazraji, Yusra; Katz, Michael; Wehrle, Martin (2017)

Structural Symmetries for Fully Observable Nondeterministic Planning. - Winterer, Dominik; Wehrle, Martin; Katz, Michael (2016)