Follow
Dominik Winterer
Title
Cited by
Cited by
Year
Validating SMT Solvers via Semantic Fusion
D Winterer, C Zhang, Z Su
PLDI 2020, 2020
952020
A Novel Iterative Approach to Top-k Planning
M Katz, S Sohrabi, U Octavian, D Winterer
ICAPS 2018, 2018
762018
On the Unusual Effectiveness of Type-aware Operator Mutations for Testing SMT Solvers
D Winterer, C Zhang, Z Su
SPLASH/OOPSLA 2020, 2020
662020
Generative type-aware mutation for testing SMT solvers
J Park, D Winterer, C Zhang, Z Su
SPLASH/OOPSLA 2021, 2021
362021
Oversubscription Planning as Classical Planning with Multiple Cost Functions
M Katz, E Keyder, F Pommerening, D Winterer
ICAPS 2019, 2019
132019
Stubborn Sets for Fully Observable Nondeterministic Planning
D Winterer, R Mattmüller, M Wehrle
ICAPS 2017, 2017
112017
Structural Symmetries for Fully Observable Nondeterministic Planning
D Winterer, M Wehrle, M Katz
IJCAI 2016, 2016
82016
Finding and Understanding Incompleteness Bugs in SMT Solvers
M Bringolf, D Winterer, Z Su
ASE 2022, 2022
62022
Compilation Quotient (CQ): A Metric for the Compilation Hardness of Programming Languages
V Szabo, D Winterer, Z Su
arXiv preprint arXiv:2406.04778, 2024
2024
Validating SMT Solvers for Correctness and Performance via Grammar-based Enumeration
D Winterer, Z Su
SPLASH/OOPSLA 2024, 2024
2024
Demonstrations Committee
A Arrieta, A Martin-Lopez, A Gorla, A Marchetto, B Xu, C Menghi, C Nagy, ...
The system can't perform the operation now. Try again later.
Articles 1–11