Dominik Winterer

Orcid: 0000-0002-4122-5981

According to our database1, Dominik Winterer authored at least 10 papers between 2016 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Compilation Quotient (CQ): A Metric for the Compilation Hardness of Programming Languages.
CoRR, 2024

2022
Finding and Understanding Incompleteness Bugs in SMT Solvers.
Proceedings of the 37th IEEE/ACM International Conference on Automated Software Engineering, 2022

2021
Generative type-aware mutation for testing SMT solvers.
Proc. ACM Program. Lang., 2021

2020
On the unusual effectiveness of type-aware operator mutations for testing SMT solvers.
Proc. ACM Program. Lang., 2020

On the Unusual Effectiveness of Type-aware Mutations for Testing SMT Solvers.
CoRR, 2020

Validating SMT solvers via semantic fusion.
Proceedings of the 41st ACM SIGPLAN International Conference on Programming Language Design and Implementation, 2020

2019
Oversubscription Planning as Classical Planning with Multiple Cost Functions.
Proceedings of the Twenty-Ninth International Conference on Automated Planning and Scheduling, 2019

2018
A Novel Iterative Approach to Top-k Planning.
Proceedings of the Twenty-Eighth International Conference on Automated Planning and Scheduling, 2018

2017
Stubborn Sets for Fully Observable Nondeterministic Planning.
Proceedings of the Twenty-Seventh International Conference on Automated Planning and Scheduling, 2017

2016
Structural Symmetries for Fully Observable Nondeterministic Planning.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016


  Loading...