| 2025 | FSCD | An Innermost DP Framework for Constrained Higher-Order Rewriting. | Carsten Fuhs, Liye Guo, Cynthia Kop |
| 2024 | ESOP | Higher-Order LCTRSs and Their Termination. | Liye Guo, Cynthia Kop |
| 2024 | FOSSACS | On Basic Feasible Functionals and the Interpretation Method. | Patrick Baillot, Ugo Dal Lago, Cynthia Kop, Deivid Vale |
| 2024 | LOPSTR | Rewriting Induction for Higher-Order Constrained Term Rewriting Systems. | Kasper Hagens, Cynthia Kop |
| 2024 | MFCS | Higher-Order Constrained Dependency Pairs for (Universal) Computability. | Liye Guo, Kasper Hagens, Cynthia Kop, Deivid Vale |
| 2023 | FSCD | Cost-Size Semantics for Call-By-Value Higher-Order Rewriting. | Cynthia Kop, Deivid Vale |
| 2023 | ITP | Certifying Higher-Order Polynomial Interpretations. | Niels van der Weide, Deivid Vale, Cynthia Kop |
| 2022 | FSCD | Cutting a Proof into Bite-Sized Chunks: Incrementally proving termination in higher-order term rewriting (Invited Talk). | Cynthia Kop |
| 2021 | FSCD | Tuple Interpretations for Higher-Order Complexity. | Cynthia Kop, Deivid Vale |
| 2020 | FMICS | Skylines for Symbolic Energy Consumption Analysis. | Markus Klinik, Bernard van Gastel, Cynthia Kop, Marko C. J. D. van Eekelen |
| 2020 | FSCD | WANDA - a Higher Order Termination Tool (System Description). | Cynthia Kop |
| 2019 | ESOP | A Static Higher-Order Dependency Pair Framework. | Carsten Fuhs, Cynthia Kop |
| 2017 | ESOP | The Power of Non-determinism in Higher-Order Implicit Complexity - Characterising Complexity Classes Using Non-deterministic Cons-Free Programming. | Cynthia Kop, Jakob Grue Simonsen |
| 2015 | LPAR | Constrained Term Rewriting tooL. | Cynthia Kop, Naoki Nishida |
| 2014 | APLAS | Automatic Constrained Rewriting Induction towards Verifying Procedural Programs. | Cynthia Kop, Naoki Nishida |
| 2008 | LPAR | A Higher-Order Iterative Path Ordering. | Cynthia Kop, Femke van Raamsdonk |