A Higher-Order Iterative Path Ordering. - Cynthia Kop; Femke van Raamsdonk (LPAR, 2008)

Simplifying Algebraic Functional Systems. - Cynthia Kop (CAI, 2011)

Harnessing First Order Termination Provers Using Higher Order Dependency Pairs. - Carsten Fuhs; Cynthia Kop (FroCoS, 2011)

Higher Order Dependency Pairs for Algebraic Functional Systems. - Cynthia Kop; Femke van Raamsdonk (RTA, 2011)

Polynomial Interpretations for Higher-Order Rewriting. - Carsten Fuhs; Cynthia Kop (RTA, 2012)

Dynamic Dependency Pairs for Algebraic Functional Systems - Cynthia Kop; Femke van Raamsdonk (Log. Methods Comput. Sci., 2012)

Term Rewriting with Logical Constraints. - Cynthia Kop; Naoki Nishida 001 (FroCos, 2013)

Automatic Constrained Rewriting Induction towards Verifying Procedural Programs. - Cynthia Kop; Naoki Nishida 001 (APLAS, 2014)

First-Order Formative Rules. - Carsten Fuhs; Cynthia Kop (RTA-TLCA, 2014)

Towards Verifying Procedural Programs using Constrained Rewriting Induction. - Cynthia Kop; Naoki Nishida 001 (CoRR, 2014)

Constrained Term Rewriting tooL. - Cynthia Kop; Naoki Nishida 001 (LPAR, 2015)

Conditional Complexity. - Cynthia Kop; Aart Middeldorp; Thomas Sternagel (RTA, 2015)

Complexity Hierarchies and Higher-Order Cons-Free Rewriting. - Cynthia Kop; Jakob Grue Simonsen (FSCD, 2016)

Termination of LCTRSs. - Cynthia Kop (CoRR, 2016)

The Power of Non-determinism in Higher-Order Implicit Complexity - Characterising Complexity Classes Using Non-deterministic Cons-Free Programming. - Cynthia Kop; Jakob Grue Simonsen (ESOP, 2017)

Quasi-reductivity of Logically Constrained Term Rewriting Systems. - Cynthia Kop (CoRR, 2017)

Complexity of Conditional Term Rewriting. - Cynthia Kop; Aart Middeldorp; Thomas Sternagel (Log. Methods Comput. Sci., 2017)

The Power of Non-Determinism in Higher-Order Implicit Complexity. - Cynthia Kop; Jakob Grue Simonsen (CoRR, 2017)

On First-order Cons-free Term Rewriting and PTIME. - Cynthia Kop (CoRR, 2017)

Higher-order Cons-free Interpreters. - Cynthia Kop; Jakob Grue Simonsen (CoRR, 2017)

Non-deterministic Characterisations. - Cynthia Kop (CoRR, 2017)

Cons-free Programming with Immutable Functions. - Cynthia Kop (CoRR, 2017)

h: A Plank for Higher-order Attribute Contraction Schemes. - Cynthia Kop; Kristoffer Rose (CoRR, 2017)

Complexity Hierarchies and Higher-order Cons-free Term Rewriting. - Cynthia Kop; Jakob Grue Simonsen (Log. Methods Comput. Sci., 2017)

Verifying Procedural Programs via Constrained Rewriting Induction. - Carsten Fuhs; Cynthia Kop; Naoki Nishida 001 (ACM Trans. Comput. Log., 2017)

The unified higher-order dependency pair framework. - Carsten Fuhs; Cynthia Kop (CoRR, 2018)

A Static Higher-Order Dependency Pair Framework. - Carsten Fuhs; Cynthia Kop (ESOP, 2019)

Polymorphic Higher-Order Termination. - Lukasz Czajka 001; Cynthia Kop (FSCD, 2019)

Skylines for Symbolic Energy Consumption Analysis. - Markus Klinik; Bernard van Gastel; Cynthia Kop; Marko C. J. D. van Eekelen (FMICS, 2020)

WANDA - a Higher Order Termination Tool (System Description). - Cynthia Kop (FSCD, 2020)

Cons-free Programs and Complexity Classes between LOGSPACE and PTIME. - Neil D. Jones; Siddharth Bhaskar; Cynthia Kop; Jakob Grue Simonsen (VPT/HCVS@ETAPS, 2020)

Tuple Interpretations for Higher-Order Complexity. - Cynthia Kop; Deivid Vale (FSCD, 2021)

Tuple Interpretations for Higher-Order Rewriting. - Deivid Vale; Cynthia Kop (CoRR, 2021)

Cutting a Proof into Bite-Sized Chunks: Incrementally proving termination in higher-order term rewriting (Invited Talk). - Cynthia Kop (FSCD, 2022)

Tuple Interpretations and Applications to Higher-Order Runtime Complexity. - Cynthia Kop; Deivid Vale (CoRR, 2022)

Cost-Size Semantics for Call-By-Value Higher-Order Rewriting. - Cynthia Kop; Deivid Vale (FSCD, 2023)

Certifying Higher-Order Polynomial Interpretations. - Niels van der Weide; Deivid Vale; Cynthia Kop (ITP, 2023)

Complexity Analysis for Call-by-Value Higher-Order Rewriting. - Cynthia Kop; Deivid Vale (CoRR, 2023)

Subclasses of Ptime Interpreted by Programming Languages. - Siddharth Bhaskar; Cynthia Kop; Jakob Grue Simonsen (Theory Comput. Syst., 2023)

Higher-Order LCTRSs and Their Termination. - Liye Guo; Cynthia Kop (ESOP (2), 2024)

On Basic Feasible Functionals and the Interpretation Method. - Patrick Baillot; Ugo Dal Lago; Cynthia Kop; Deivid Vale (FoSSaCS (2), 2024)

Rewriting Induction for Higher-Order Constrained Term Rewriting Systems. - Kasper Hagens; Cynthia Kop (LOPSTR, 2024)

Higher-Order Constrained Dependency Pairs for (Universal) Computability. - Liye Guo; Kasper Hagens; Cynthia Kop; Deivid Vale (MFCS, 2024)

A weakly monotonic, logically constrained, HORPO-variant. - Cynthia Kop (CoRR, 2024)

An Innermost DP Framework for Constrained Higher-Order Rewriting. - Carsten Fuhs; Liye Guo; Cynthia Kop (FSCD, 2025)