Cynthia Kop

According to our database, Cynthia Kop authored at least 44 papers between 2008 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2024

A weakly monotonic, logically constrained, HORPO-variant.

Cynthia Kop

CoRR, 2024

Higher-Order Constrained Dependency Pairs for (Universal) Computability.

Liye Guo, Kasper Hagens, Cynthia Kop, Deivid Vale

Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024

Rewriting Induction for Higher-Order Constrained Term Rewriting Systems.

Kasper Hagens, Cynthia Kop

Proceedings of the Logic-Based Program Synthesis and Transformation, 2024

On Basic Feasible Functionals and the Interpretation Method.

Patrick Baillot, Ugo Dal Lago, Cynthia Kop, Deivid Vale

Proceedings of the Foundations of Software Science and Computation Structures, 2024

Higher-Order LCTRSs and Their Termination.

Liye Guo, Cynthia Kop

Proceedings of the Programming Languages and Systems, 2024

2023

Subclasses of Ptime Interpreted by Programming Languages.

Siddharth Bhaskar, Cynthia Kop, Jakob Grue Simonsen

Theory Comput. Syst., June, 2023

Complexity Analysis for Call-by-Value Higher-Order Rewriting.

Cynthia Kop, Deivid Vale

CoRR, 2023

Certifying Higher-Order Polynomial Interpretations.

Niels van der Weide, Deivid Vale, Cynthia Kop

Proceedings of the 14th International Conference on Interactive Theorem Proving, 2023

Cost-Size Semantics for Call-By-Value Higher-Order Rewriting.

Cynthia Kop, Deivid Vale

Proceedings of the 8th International Conference on Formal Structures for Computation and Deduction, 2023

2022

Tuple Interpretations and Applications to Higher-Order Runtime Complexity.

Cynthia Kop, Deivid Vale

CoRR, 2022

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

Cynthia Kop

Proceedings of the 7th International Conference on Formal Structures for Computation and Deduction, 2022

2021

Tuple Interpretations for Higher-Order Rewriting.

Deivid Vale, Cynthia Kop

CoRR, 2021

Tuple Interpretations for Higher-Order Complexity.

Cynthia Kop, Deivid Vale

Proceedings of the 6th International Conference on Formal Structures for Computation and Deduction, 2021

2020

Cons-free Programs and Complexity Classes between LOGSPACE and PTIME.

Neil D. Jones, Siddharth Bhaskar, Cynthia Kop, Jakob Grue Simonsen

Proceedings of the Proceedings 8th International Workshop on Verification and Program Transformation and 7th Workshop on Horn Clauses for Verification and Synthesis, 2020

WANDA - a Higher Order Termination Tool (System Description).

Cynthia Kop

Proceedings of the 5th International Conference on Formal Structures for Computation and Deduction, 2020

Skylines for Symbolic Energy Consumption Analysis.

Markus Klinik, Bernard van Gastel, Cynthia Kop, Marko C. J. D. van Eekelen

Proceedings of the Formal Methods for Industrial Critical Systems, 2020

2019

Polymorphic Higher-Order Termination.

Lukasz Czajka, Cynthia Kop

Proceedings of the 4th International Conference on Formal Structures for Computation and Deduction, 2019

A Static Higher-Order Dependency Pair Framework.

Carsten Fuhs, Cynthia Kop

Proceedings of the Programming Languages and Systems, 2019

2018

The unified higher-order dependency pair framework.

Carsten Fuhs, Cynthia Kop

CoRR, 2018

2017

Verifying Procedural Programs via Constrained Rewriting Induction.

Carsten Fuhs, Cynthia Kop, Naoki Nishida

ACM Trans. Comput. Log., 2017

Complexity Hierarchies and Higher-order Cons-free Term Rewriting.

Cynthia Kop, Jakob Grue Simonsen

Log. Methods Comput. Sci., 2017

h: A Plank for Higher-order Attribute Contraction Schemes.

Cynthia Kop, Kristoffer Rose

CoRR, 2017

Cons-free Programming with Immutable Functions.

Cynthia Kop

CoRR, 2017

Non-deterministic Characterisations.

Cynthia Kop

CoRR, 2017

Higher-order Cons-free Interpreters.

Cynthia Kop, Jakob Grue Simonsen

CoRR, 2017

On First-order Cons-free Term Rewriting and PTIME.

Cynthia Kop

CoRR, 2017

The Power of Non-Determinism in Higher-Order Implicit Complexity.

Cynthia Kop, Jakob Grue Simonsen

CoRR, 2017

Complexity of Conditional Term Rewriting.

Cynthia Kop, Aart Middeldorp, Thomas Sternagel

Log. Methods Comput. Sci., 2017

Quasi-reductivity of Logically Constrained Term Rewriting Systems.

Cynthia Kop

CoRR, 2017

The Power of Non-determinism in Higher-Order Implicit Complexity - Characterising Complexity Classes Using Non-deterministic Cons-Free Programming.

Cynthia Kop, Jakob Grue Simonsen

Proceedings of the Programming Languages and Systems, 2017

2016

Termination of LCTRSs.

Cynthia Kop

CoRR, 2016

Complexity Hierarchies and Higher-Order Cons-Free Rewriting.

Cynthia Kop, Jakob Grue Simonsen

Proceedings of the 1st International Conference on Formal Structures for Computation and Deduction, 2016

2015

Conditional Complexity.

Cynthia Kop, Aart Middeldorp, Thomas Sternagel

Proceedings of the 26th International Conference on Rewriting Techniques and Applications, 2015

Constrained Term Rewriting tooL.

Cynthia Kop, Naoki Nishida

Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2015

2014

Towards Verifying Procedural Programs using Constrained Rewriting Induction.

Cynthia Kop, Naoki Nishida

CoRR, 2014

First-Order Formative Rules.

Carsten Fuhs, Cynthia Kop

Proceedings of the Rewriting and Typed Lambda Calculi - Joint International Conference, 2014

Automatic Constrained Rewriting Induction towards Verifying Procedural Programs.

Cynthia Kop, Naoki Nishida

Proceedings of the Programming Languages and Systems - 12th Asian Symposium, 2014

2013

Term Rewriting with Logical Constraints.

Cynthia Kop, Naoki Nishida

Proceedings of the Frontiers of Combining Systems, 2013

2012

Dynamic Dependency Pairs for Algebraic Functional Systems

Cynthia Kop, Femke van Raamsdonk

Log. Methods Comput. Sci., 2012

Polynomial Interpretations for Higher-Order Rewriting.

Carsten Fuhs, Cynthia Kop

Proceedings of the 23rd International Conference on Rewriting Techniques and Applications (RTA'12) , 2012

2011

Higher Order Dependency Pairs for Algebraic Functional Systems.

Cynthia Kop, Femke van Raamsdonk

Proceedings of the 22nd International Conference on Rewriting Techniques and Applications, 2011

Harnessing First Order Termination Provers Using Higher Order Dependency Pairs.

Carsten Fuhs, Cynthia Kop

Proceedings of the Frontiers of Combining Systems, 8th International Symposium, 2011

Simplifying Algebraic Functional Systems.

Cynthia Kop

Proceedings of the Algebraic Informatics - 4th International Conference, 2011

2008

A Higher-Order Iterative Path Ordering.

Cynthia Kop, Femke van Raamsdonk

Proceedings of the Logic for Programming, 2008