Follow
Cynthia Kop
Title
Cited by
Cited by
Year
Higher order termination
C Kop
Faculty of Sciences, Department of Computer Science, VUA 14, 2012-15, 2012
512012
Term rewriting with logical constraints
C Kop, N Nishida
Frontiers of Combining Systems: 9th International Symposium, FroCoS 2013 …, 2013
412013
Polynomial interpretations for higher-order rewriting
C Fuhs, C Kop
Rewriting Techniques and Applications (Proc. RTA'12), 176-192, 2012
262012
Verifying procedural programs via constrained rewriting induction
C Fuhs, C Kop, N Nishida
ACM Transactions on Computational Logic (TOCL) 18 (2), 1-50, 2017
252017
WANDA–a higher order termination tool
CLM Kop
Dagstuhl: Schloss Dagstuhl--Leibniz-Zentrum für Informatik, 2020
23*2020
Higher order dependency pairs for algebraic functional systems
C Kop, F van Raamsdonk
22nd International Conference on Rewriting Techniques and Applications (RTA'11), 2011
232011
Dynamic dependency pairs for algebraic functional systems
C Kop, F van Raamsdonk
Selected papers of the "22nd International Conference on Rewriting …, 2012
20*2012
Constrained term rewriting tool
C Kop, N Nishida
Logic for Programming, Artificial Intelligence, and Reasoning: 20th …, 2015
192015
Automatic constrained rewriting induction towards verifying procedural programs
C Kop, N Nishida
Programming Languages and Systems: 12th Asian Symposium, APLAS 2014 …, 2014
182014
Harnessing first order termination provers using higher order dependency pairs
C Fuhs, C Kop
Frontiers of Combining Systems: 8th International Symposium, FroCoS 2011 …, 2011
142011
A higher-order iterative path ordering
C Kop, F van Raamsdonk
Logic for Programming, Artificial Intelligence, and Reasoning: 15th …, 2008
142008
Simplifying algebraic functional systems
C Kop
Algebraic Informatics: 4th International Conference, CAI 2011, Linz, Austria …, 2011
132011
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
82019
Complexity of conditional term rewriting
C Kop, A Middeldorp, T Sternagel
arXiv preprint arXiv:1510.07276, 2015
82015
Complexity hierarchies and higher-order cons-free rewriting
C Kop, JG Simonsen
arXiv preprint arXiv:1604.08936, 2016
72016
Tuple interpretations for higher-order complexity
C Kop, D Vale
6th International Conference on Formal Structures for Computation and …, 2021
52021
The power of non-determinism in higher-order implicit complexity: characterising complexity classes using non-deterministic cons-free programming
C Kop, JG Simonsen
Programming Languages and Systems: 26th European Symposium on Programming …, 2017
52017
First-order formative rules
C Fuhs, C Kop
Rewriting and Typed Lambda Calculi: Joint International Conference, RTA-TLCA …, 2014
52014
The system can't perform the operation now. Try again later.
Articles 1–20