Follow
Sarah Winkler
Sarah Winkler
postdoctoral researcher, Free University Bolzano
Verified email at unibz.it - Homepage
Title
Cited by
Cited by
Year
Multi-completion with termination tools (system description)
H Sato, S Winkler, M Kurihara, A Middeldorp
International Joint Conference on Automated Reasoning, 306-312, 2008
232008
MædMax: A Maximal Ordered Completion Tool
S Winkler, G Moser
International Joint Conference on Automated Reasoning, 472-480, 2018
182018
Multi-completion with termination tools
S Winkler, H Sato, A Middeldorp, M Kurihara
Journal of Automated Reasoning 50 (3), 317-354, 2013
172013
Infinite runs in abstract completion
N Hirokawa, A Middeldorp, C Sternagel, S Winkler
2nd International Conference on Formal Structures for Computation and …, 2017
152017
Ordinals and knuth-bendix orders
S Winkler, H Zankl, A Middeldorp
International Conference on Logic for Programming Artificial Intelligence …, 2012
142012
Optimizing mkbTT
S Winkler, H Sato, A Middeldorp, M Kurihara
Proceedings of the 21st International Conference on Rewriting Techniques and …, 2010
142010
Constraint-based multi-completion procedures for term rewriting systems
H Sato, M Kurihara, S Winkler, A Middeldorp
IEICE transactions on information and systems 92 (2), 220-234, 2009
142009
Formalizing soundness and completeness of unravelings
S Winkler, R Thiemann
International Symposium on Frontiers of Combining Systems, 239-255, 2015
132015
Termination tools in ordered completion
S Winkler, A Middeldorp
International Joint Conference on Automated Reasoning, 518-532, 2010
122010
CoCoMoT: Conformance checking of multi-perspective processes via SMT
P Felli, A Gianola, M Montali, A Rivkin, S Winkler
International Conference on Business Process Management, 217-234, 2021
112021
CeTA-A Tool for Certified Termination Analysis
C Sternagel, R Thiemann, S Winkler, H Zankl
arXiv preprint arXiv:1208.1591, 2012
112012
Normalized completion revisited
S Winkler, A Middeldorp
24th International Conference on Rewriting Techniques and Applications (RTA …, 2013
92013
Completion for logically constrained rewriting
S Winkler, A Middeldorp
3rd International Conference on Formal Structures for Computation and …, 2018
82018
Beyond polynomials and Peano arithmetic—Automation of elementary and ordinal interpretations
H Zankl, S Winkler, A Middeldorp
Journal of Symbolic Computation 69, 129-158, 2015
82015
Recording completion for certificates in equational reasoning
T Sternagel, S Winkler, H Zankl
Proceedings of the 2015 Conference on Certified Programs and Proofs, 41-47, 2015
72015
Beyond Peano arithmetic–automatically proving termination of the Goodstein sequence
S Winkler, H Zankl, A Middeldorp
24th International Conference on Rewriting Techniques and Applications (RTA …, 2013
72013
Encoding dependency pair techniques and control strategies for maximal completion
H Sato, S Winkler
International Conference on Automated Deduction, 152-162, 2015
62015
Linear-time verification of data-aware dynamic systems with arithmetic
P Felli, M Montali, S Winkler
Proceedings of 36th AAAI, 2022
52022
A ground joinability criterion for ordered completion
S Winkler
Proc. 6th IWC, 45-49, 2017
52017
AC completion with termination tools
S Winkler, A Middeldorp
International Conference on Automated Deduction, 492-498, 2011
52011
The system can't perform the operation now. Try again later.
Articles 1–20