Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSarah Winkler
Person information
- affiliation (since 2020): Free University of Bozen-Bolzano, Bolzano, Italy
- affiliation (2019-2020): University of Verona, Italy
- affiliation (until 2019, PhD 2013): University of Innsbruck, Austria
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c37]Alessandro Gianola, Marco Montali, Sarah Winkler:
Linear-Time Verification of Data-Aware Processes Modulo Theories via Covers and Automata. AAAI 2024: 10525-10534- 2023
- [j8]Paolo Felli
, Alessandro Gianola, Marco Montali, Andrey Rivkin, Sarah Winkler:
Multi-perspective conformance checking of uncertain process traces: An SMT-based approach. Eng. Appl. Artif. Intell. 126: 106895 (2023) - [j7]Paolo Felli, Alessandro Gianola, Marco Montali, Andrey Rivkin, Sarah Winkler:
Data-aware conformance checking with SMT. Inf. Syst. 117: 102230 (2023) - [j6]Maria Paola Bonacina, Sarah Winkler:
Semantically-Guided Goal-Sensitive Reasoning: Decision Procedures and the Koala Prover. J. Autom. Reason. 67(1): 6 (2023) - [c36]Paolo Felli, Marco Montali, Fabio Patrizi, Sarah Winkler:
Monitoring Arithmetic Temporal Properties on Finite Traces. AAAI 2023: 6346-6354 - [c35]Alessandro Gianola, Jonghyeon Ko, Fabrizio Maria Maggi, Marco Montali, Sarah Winkler:
Approximating Multi-perspective Trace Alignment Using Trace Encodings. BPM 2023: 74-91 - [c34]Yago Fontenla-Seco, Sarah Winkler, Alessandro Gianola, Marco Montali, Manuel Lama Penín, Alberto José Bugarín Diz:
The Droid You're Looking For: C-4PM, a Conversational Agent for Declarative Process Mining. BPM (Demos / Resources Forum) 2023: 112-116 - [c33]Marco Montali, Sarah Winkler:
Equivalence of Data Petri Nets with Arithmetic. Business Process Management Workshops 2023: 409-421 - [c32]Luca Geatti, Alessandro Gianola, Nicola Gigante, Sarah Winkler:
Decidable Fragments of LTLf Modulo Theories. ECAI 2023: 811-818 - [c31]Paolo Felli, Marco Montali, Sarah Winkler:
Repairing Soundness Properties in Data-Aware Processes. ICPM 2023: 41-48 - [i14]Luca Geatti, Alessandro Gianola, Nicola Gigante, Sarah Winkler:
Decidable Fragments of LTLf Modulo Theories (Extended Version). CoRR abs/2307.16840 (2023) - [i13]Alessandro Gianola, Marco Montali, Sarah Winkler:
Linear-Time Verification of Data-Aware Processes Modulo Theories via Covers and Automata (Extended Version). CoRR abs/2310.12180 (2023) - [i12]Alessandro Gianola, Marco Montali, Sarah Winkler:
Object-Centric Conformance Alignments with Synchronization (Extended Version). CoRR abs/2312.08537 (2023) - 2022
- [c30]Paolo Felli, Marco Montali, Sarah Winkler:
Linear-Time Verification of Data-Aware Dynamic Systems with Arithmetic. AAAI 2022: 5642-5650 - [c29]Paolo Felli, Alessandro Gianola, Marco Montali, Andrey Rivkin, Sarah Winkler:
A Modular SMT-based Approach for Data-aware Conformance Checking. OVERLAY@AI*IA 2022: 87-92 - [c28]Paolo Felli, Alessandro Gianola, Marco Montali, Andrey Rivkin, Sarah Winkler:
Conformance Checking with Uncertainty via SMT. BPM 2022: 199-216 - [c27]Paolo Felli, Marco Montali, Sarah Winkler:
CTL* Model Checking for Data-Aware Dynamic Systems with Arithmetic. IJCAR 2022: 36-56 - [c26]Paolo Felli, Marco Montali, Sarah Winkler:
Soundness of Data-Aware Processes with Arithmetic Conditions. CAiSE 2022: 389-406 - [c25]Paolo Felli, Marco Montali, Sarah Winkler:
Reasoning and Verification with Data Petri Nets. PMAI@IJCAI 2022: 73-76 - [c24]Maria Paola Bonacina, Sarah Winkler:
On SGGS and Horn Clauses. PAAR@IJCAR 2022 - [i11]Paolo Felli, Marco Montali, Sarah Winkler:
Linear-Time Verification of Data-Aware Dynamic Systems with Arithmetic. CoRR abs/2203.07982 (2022) - [i10]Paolo Felli, Marco Montali, Sarah Winkler:
Soundness of Data-Aware Processes with Arithmetic Conditions. CoRR abs/2203.14809 (2022) - [i9]Paolo Felli, Marco Montali, Sarah Winkler:
CTL* model checking for data-aware dynamic systems with arithmetic. CoRR abs/2205.08976 (2022) - [i8]Paolo Felli, Alessandro Gianola, Marco Montali, Andrey Rivkin, Sarah Winkler:
Conformance Checking with Uncertainty via SMT (Extended Version). CoRR abs/2206.07461 (2022) - [i7]Paolo Felli, Marco Montali, Fabio Patrizi, Sarah Winkler:
Monitoring Arithmetic Temporal Properties on Finite Traces. CoRR abs/2211.17166 (2022) - 2021
- [c23]Paolo Felli, Alessandro Gianola, Marco Montali, Andrey Rivkin, Sarah Winkler:
CoCoMoT: Conformance Checking of Multi-perspective Processes via SMT. BPM 2021: 217-234 - [e2]Martin Suda, Sarah Winkler:
Proceedings of the Third International Workshop on Automated Reasoning: Challenges, Applications, Directions, Exemplary Achievements, ARCADE@CADE 2021, Virtual Event, July 16, 2021. 2021 [contents] - [i6]Paolo Felli, Alessandro Gianola, Marco Montali, Andrey Rivkin, Sarah Winkler:
CoCoMoT: Conformance Checking of Multi-Perspective Processes via SMT (Extended Version). CoRR abs/2103.10507 (2021) - 2020
- [c22]Maria Paola Bonacina, Sarah Winkler:
SGGS Decision Procedures. IJCAR (1) 2020: 356-374 - [c21]Sarah Winkler, Georg Moser:
Runtime Complexity Analysis of Logically Constrained Rewriting. LOPSTR 2020: 37-55 - [i5]Sarah Winkler, Georg Moser:
Runtime Complexity Analysis of Logically Constrained Rewriting. CoRR abs/2012.06370 (2020)
2010 – 2019
- 2019
- [j5]Nao Hirokawa, Aart Middeldorp, Christian Sternagel, Sarah Winkler:
Abstract Completion, Formalized. Log. Methods Comput. Sci. 15(3) (2019) - [c20]Christian Sternagel, Sarah Winkler:
Certified Equational Reasoning via Ordered Completion. CADE 2019: 508-525 - [c19]Sarah Winkler:
Extending Maximal Completion (Invited Talk). FSCD 2019: 3:1-3:15 - [c18]Sarah Winkler, Georg Moser:
Smarter Features, Simpler Learning? ARCADE@CADE 2019: 25-31 - [c17]Sarah Winkler, Aart Middeldorp:
Tools in Term Rewriting for Education. ThEdu@CADE 2019: 54-72 - [e1]Martin Suda, Sarah Winkler:
Proceedings of the Second International Workshop on Automated Reasoning: Challenges, Applications, Directions, Exemplary Achievements, ARCADE@CADE 2019, Natal, Brazil, August 26, 2019. EPTCS 311, 2019 [contents] - 2018
- [c16]Sarah Winkler, Georg Moser:
MædMax: A Maximal Ordered Completion Tool. IJCAR 2018: 472-480 - [c15]Sarah Winkler, Aart Middeldorp:
Completion for Logically Constrained Rewriting. FSCD 2018: 30:1-30:18 - [c14]Naoki Nishida, Sarah Winkler:
Loop Detection by Logically Constrained Term Rewriting. VSTTE 2018: 309-321 - [i4]Nao Hirokawa, Aart Middeldorp, Christian Sternagel, Sarah Winkler:
Abstract Completion, Formalized. CoRR abs/1802.08437 (2018) - [i3]Christian Sternagel, Sarah Winkler:
Certified Ordered Completion. CoRR abs/1805.10090 (2018) - 2017
- [c13]Nao Hirokawa, Aart Middeldorp, Christian Sternagel, Sarah Winkler:
Infinite Runs in Abstract Completion. FSCD 2017: 19:1-19:16 - 2016
- [j4]Akihisa Yamada, Sarah Winkler, Nao Hirokawa, Aart Middeldorp:
AC-KBO revisited. Theory Pract. Log. Program. 16(2): 163-188 (2016) - 2015
- [j3]Harald Zankl, Sarah Winkler, Aart Middeldorp:
Beyond polynomials and Peano arithmetic - automation of elementary and ordinal interpretations. J. Symb. Comput. 69: 129-158 (2015) - [c12]Haruhiko Sato, Sarah Winkler:
Encoding Dependency Pair Techniques and Control Strategies for Maximal Completion. CADE 2015: 152-162 - [c11]Thomas Sternagel, Sarah Winkler, Harald Zankl:
Recording Completion for Certificates in Equational Reasoning. CPP 2015: 41-47 - [c10]Sarah Winkler, René Thiemann:
Formalizing Soundness and Completeness of Unravelings. FroCos 2015: 239-255 - 2014
- [c9]Akihisa Yamada, Sarah Winkler, Nao Hirokawa, Aart Middeldorp:
AC-KBO Revisited. FLOPS 2014: 319-335 - [c8]Julian Nagele, René Thiemann, Sarah Winkler:
Certification of Nontermination Proofs Using Strategies and Nonlooping Derivations. VSTTE 2014: 216-232 - [i2]Akihisa Yamada, Sarah Winkler, Nao Hirokawa, Aart Middeldorp:
AC-KBO Revisited. CoRR abs/1403.0406 (2014) - 2013
- [j2]Sarah Winkler, Haruhiko Sato, Aart Middeldorp, Masahito Kurihara:
Multi-Completion with Termination Tools. J. Autom. Reason. 50(3): 317-354 (2013) - [c7]Sarah Winkler, Aart Middeldorp:
Normalized Completion Revisited. RTA 2013: 319-334 - [c6]Sarah Winkler, Harald Zankl, Aart Middeldorp:
Beyond Peano Arithmetic - Automatically Proving Termination of the Goodstein Sequence. RTA 2013: 335-351 - 2012
- [c5]Sarah Winkler, Harald Zankl, Aart Middeldorp:
Ordinals and Knuth-Bendix Orders. LPAR 2012: 420-434 - [i1]Christian Sternagel, René Thiemann, Sarah Winkler, Harald Zankl:
CeTA - A Tool for Certified Termination Analysis. CoRR abs/1208.1591 (2012) - 2011
- [c4]Sarah Winkler, Aart Middeldorp:
AC Completion with Termination Tools. CADE 2011: 492-498 - 2010
- [c3]Sarah Winkler, Aart Middeldorp:
Termination Tools in Ordered Completion. IJCAR 2010: 518-532 - [c2]Sarah Winkler, Haruhiko Sato, Aart Middeldorp, Masahito Kurihara:
Optimizing mkbTT. RTA 2010: 373-384
2000 – 2009
- 2009
- [j1]Haruhiko Sato, Masahito Kurihara, Sarah Winkler, Aart Middeldorp:
Constraint-Based Multi-Completion Procedures for Term Rewriting Systems. IEICE Trans. Inf. Syst. 92-D(2): 220-234 (2009) - 2008
- [c1]Haruhiko Sato, Sarah Winkler, Masahito Kurihara, Aart Middeldorp:
Multi-completion with Termination Tools (System Description). IJCAR 2008: 306-312
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-06 22:56 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
