Cynthia Kop
Title
Cited by
Cited by
Year
Higher Order Termination: Automatable Techniques for Proving Termination of Higher-Order Term Rewriting Systems
CLM Kop
492012
Term rewriting with logical constraints
C Kop, N Nishida
International Symposium on Frontiers of Combining Systems, 343-358, 2013
342013
Polynomial interpretations for higher-order rewriting
C Fuhs, C Kop
Rewriting Techniques and Applications (Proc. RTA'12), 176-192, 2012
232012
Higher order dependency pairs for algebraic functional systems
C Kop, F Van Raamsdonk
22nd International Conference on Rewriting Techniques and Applications (RTA'11), 2011
222011
Verifying procedural programs via constrained rewriting induction
C Fuhs, C Kop, N Nishida
ACM Transactions on Computational Logic (TOCL) 18 (2), 1-50, 2017
192017
Constrained term rewriting tool
C Kop, N Nishida
Logic for Programming, Artificial Intelligence, and Reasoning, 549-557, 2015
192015
Automatic constrained rewriting induction towards verifying procedural programs
C Kop, N Nishida
Asian Symposium on Programming Languages and Systems, 334-353, 2014
182014
WANDA–a higher order termination tool
CLM Kop
Dagstuhl: Schloss Dagstuhl--Leibniz-Zentrum für Informatik, 2020
17*2020
Dynamic dependency pairs for algebraic functional systems
C Kop, F van Raamsdonk
Selected papers of the "22nd International Conference on Rewriting …, 2012
172012
Simplifying algebraic functional systems
C Kop
International Conference on Algebraic Informatics, 201-215, 2011
142011
Harnessing first order termination provers using higher order dependency pairs
C Fuhs, C Kop
International Symposium on Frontiers of Combining Systems, 147-162, 2011
132011
A higher-order iterative path ordering
C Kop, F van Raamsdonk
International Conference on Logic for Programming Artificial Intelligence …, 2008
132008
Termination of LCTRSs
C Kop
13th International Workshop on Termination (WST 2013), 59-63, 2013
122013
Higher-order dependency pairs with argument filterings
C Kop, F van Raamsdonk
Proc. WST 10, 2010
92010
A Static Higher-Order Dependency Pair Framework.
C Fuhs, C Kop
ESOP 11423, 752-782, 2019
72019
Complexity hierarchies and higher-order cons-free rewriting
C Kop, JG Simonsen
arXiv preprint arXiv:1604.08936, 2016
72016
Complexity of conditional term rewriting
C Kop, A Middeldorp, T Sternagel
arXiv preprint arXiv:1510.07276, 2015
62015
First-order formative rules
C Fuhs, C Kop
Rewriting and Typed Lambda Calculi, 240-256, 2014
52014
The power of non-determinism in higher-order implicit complexity
C Kop, JG Simonsen
European Symposium on Programming, 668-695, 2017
42017
Conditional Complexity
C Kop, A Middeldorp, T Sternagel
RTA 2015 36, 223--240, 2015
32015
The system can't perform the operation now. Try again later.
Articles 1–20