Cynthia Kop

Publication Activity (10 Years)

Years Active: 2008-2024
Publications (10 Years): 39

Top Topics

Top Venues

Log. Methods Comput. Sci.

Publications

Cynthia Kop
A weakly monotonic, logically constrained, HORPO-variant. CoRR (2024)
Liye Guo, Cynthia Kop
Higher-Order LCTRSs and Their Termination. ESOP (2) (2024)
Patrick Baillot, Ugo Dal Lago, Cynthia Kop, Deivid Vale
On Basic Feasible Functionals and the Interpretation Method. FoSSaCS (2) (2024)
Patrick Baillot, Ugo Dal Lago, Cynthia Kop, Deivid Vale
On Basic Feasible Functionals and the Interpretation Method. CoRR (2024)
Liye Guo, Kasper Hagens, Cynthia Kop, Deivid Vale
Higher-Order Constrained Dependency Pairs for (Universal) Computability. MFCS (2024)
Liye Guo, Kasper Hagens, Cynthia Kop, Deivid Vale
Higher-Order Constrained Dependency Pairs for (Universal) Computability. CoRR (2024)
Niels van der Weide, Deivid Vale, Cynthia Kop
Certifying Higher-Order Polynomial Interpretations. ITP (2023)
Cynthia Kop, Deivid Vale
Cost-Size Semantics for Call-By-Value Higher-Order Rewriting. FSCD (2023)
Liye Guo, Cynthia Kop
Higher-Order LCTRSs and Their Termination. CoRR (2023)
Cynthia Kop, Deivid Vale
Complexity Analysis for Call-by-Value Higher-Order Rewriting. CoRR (2023)
Siddharth Bhaskar, Cynthia Kop, Jakob Grue Simonsen
Subclasses of Ptime Interpreted by Programming Languages. Theory Comput. Syst. 67 (3) (2023)
Niels van der Weide, Deivid Vale, Cynthia Kop
Certifying Higher-Order Polynomial Interpretations. CoRR (2023)
Cynthia Kop, Deivid Vale
Tuple Interpretations and Applications to Higher-Order Runtime Complexity. CoRR (2022)
Cynthia Kop
Cutting a Proof into Bite-Sized Chunks: Incrementally proving termination in higher-order term rewriting (Invited Talk). FSCD (2022)
Deivid Vale, Cynthia Kop
Tuple Interpretations for Higher-Order Rewriting. CoRR (2021)
Cynthia Kop, Deivid Vale
Tuple Interpretations for Higher-Order Complexity. FSCD (2021)
Markus Klinik, Bernard van Gastel, Cynthia Kop, Marko C. J. D. van Eekelen
Skylines for Symbolic Energy Consumption Analysis. FMICS (2020)
Cynthia Kop
WANDA - a Higher Order Termination Tool (System Description). FSCD (2020)
Neil D. Jones, Siddharth Bhaskar, Cynthia Kop, Jakob Grue Simonsen
Cons-free Programs and Complexity Classes between LOGSPACE and PTIME. VPT/HCVS@ETAPS (2020)
Carsten Fuhs, Cynthia Kop
A Static Higher-Order Dependency Pair Framework. ESOP (2019)
Lukasz Czajka, Cynthia Kop
Polymorphic Higher-Order Termination. FSCD (2019)
Lukasz Czajka, Cynthia Kop
Polymorphic Higher-order Termination. CoRR (2019)
Carsten Fuhs, Cynthia Kop
A static higher-order dependency pair framework. CoRR (2019)
Carsten Fuhs, Cynthia Kop
The unified higher-order dependency pair framework. CoRR (2018)
Cynthia Kop, Jakob Grue Simonsen
Higher-order Cons-free Interpreters. CoRR (2017)
Cynthia Kop, Jakob Grue Simonsen
The Power of Non-Determinism in Higher-Order Implicit Complexity. CoRR (2017)
Cynthia Kop, Kristoffer Rose
h: A Plank for Higher-order Attribute Contraction Schemes. CoRR (2017)
Cynthia Kop, Jakob Grue Simonsen
The Power of Non-determinism in Higher-Order Implicit Complexity - Characterising Complexity Classes Using Non-deterministic Cons-Free Programming. ESOP (2017)
Cynthia Kop, Jakob Grue Simonsen
Complexity Hierarchies and Higher-order Cons-free Term Rewriting. Log. Methods Comput. Sci. 13 (3) (2017)
Cynthia Kop
Quasi-reductivity of Logically Constrained Term Rewriting Systems. CoRR (2017)
Cynthia Kop
Non-deterministic Characterisations. CoRR (2017)
Carsten Fuhs, Cynthia Kop, Naoki Nishida
Verifying Procedural Programs via Constrained Rewriting Induction. ACM Trans. Comput. Log. 18 (2) (2017)
Cynthia Kop
On First-order Cons-free Term Rewriting and PTIME. CoRR (2017)
Cynthia Kop, Aart Middeldorp, Thomas Sternagel
Complexity of Conditional Term Rewriting. Log. Methods Comput. Sci. 13 (1) (2017)
Cynthia Kop
Cons-free Programming with Immutable Functions. CoRR (2017)
Cynthia Kop
Termination of LCTRSs. CoRR (2016)
Cynthia Kop, Jakob Grue Simonsen
Complexity Hierarchies and Higher-order Cons-free Term Rewriting. CoRR (2016)
Cynthia Kop, Jakob Grue Simonsen
Complexity Hierarchies and Higher-Order Cons-Free Rewriting. FSCD (2016)
Cynthia Kop, Jakob Grue Simonsen
Complexity Hierarchies and Higher-Order Cons-Free Rewriting. CoRR (2016)
Cynthia Kop, Naoki Nishida
Constrained Term Rewriting tooL. LPAR (2015)
Cynthia Kop, Aart Middeldorp, Thomas Sternagel
Conditional Complexity. RTA (2015)
Carsten Fuhs, Cynthia Kop
First-Order Formative Rules. RTA-TLCA (2014)
Carsten Fuhs, Cynthia Kop
First-Order Formative Rules. CoRR (2014)
Cynthia Kop, Naoki Nishida
Towards Verifying Procedural Programs using Constrained Rewriting Induction. CoRR (2014)
Cynthia Kop, Naoki Nishida
Automatic Constrained Rewriting Induction towards Verifying Procedural Programs. APLAS (2014)
Cynthia Kop, Naoki Nishida
Term Rewriting with Logical Constraints. FroCos (2013)
Carsten Fuhs, Cynthia Kop
Polynomial Interpretations for Higher-Order Rewriting. RTA (2012)
Carsten Fuhs, Cynthia Kop
Polynomial Interpretations for Higher-Order Rewriting CoRR (2012)
Cynthia Kop, Femke van Raamsdonk
Dynamic Dependency Pairs for Algebraic Functional Systems Log. Methods Comput. Sci. 8 (2) (2012)
Carsten Fuhs, Cynthia Kop
Harnessing First Order Termination Provers Using Higher Order Dependency Pairs. FroCoS (2011)
Cynthia Kop, Femke van Raamsdonk
Higher Order Dependency Pairs for Algebraic Functional Systems. RTA (2011)
Cynthia Kop
Simplifying Algebraic Functional Systems. CAI (2011)
Cynthia Kop, Femke van Raamsdonk
A Higher-Order Iterative Path Ordering. LPAR (2008)