Cynthia Kop

Orcid: 0000-0002-6337-2544

Affiliations:
  • Radboud University Nijmegen, Department of Software Science, The Netherlands
  • University of Copenhagen, Denmark (former)
  • University of Innsbruck, Austria (former)
  • VU University of Amsterdam, The Netherlands (former)


According to our database1, Cynthia Kop authored at least 41 papers between 2008 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
On Basic Feasible Functionals and the Interpretation Method.
CoRR, 2024

2023
Subclasses of Ptime Interpreted by Programming Languages.
Theory Comput. Syst., June, 2023

Higher-Order LCTRSs and Their Termination.
CoRR, 2023

Complexity Analysis for Call-by-Value Higher-Order Rewriting.
CoRR, 2023

Certifying Higher-Order Polynomial Interpretations.
Proceedings of the 14th International Conference on Interactive Theorem Proving, 2023

Cost-Size Semantics for Call-By-Value Higher-Order Rewriting.
Proceedings of the 8th International Conference on Formal Structures for Computation and Deduction, 2023

2022
Tuple Interpretations and Applications to Higher-Order Runtime Complexity.
CoRR, 2022

Cutting a Proof into Bite-Sized Chunks: Incrementally proving termination in higher-order term rewriting (Invited Talk).
Proceedings of the 7th International Conference on Formal Structures for Computation and Deduction, 2022

2021
Tuple Interpretations for Higher-Order Rewriting.
CoRR, 2021

Tuple Interpretations for Higher-Order Complexity.
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.
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).
Proceedings of the 5th International Conference on Formal Structures for Computation and Deduction, 2020

Skylines for Symbolic Energy Consumption Analysis.
Proceedings of the Formal Methods for Industrial Critical Systems, 2020

2019
Polymorphic Higher-Order Termination.
Proceedings of the 4th International Conference on Formal Structures for Computation and Deduction, 2019

A Static Higher-Order Dependency Pair Framework.
Proceedings of the Programming Languages and Systems, 2019

2018
The unified higher-order dependency pair framework.
CoRR, 2018

2017
Verifying Procedural Programs via Constrained Rewriting Induction.
ACM Trans. Comput. Log., 2017

Complexity Hierarchies and Higher-order Cons-free Term Rewriting.
Log. Methods Comput. Sci., 2017

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

Cons-free Programming with Immutable Functions.
CoRR, 2017

Non-deterministic Characterisations.
CoRR, 2017

Higher-order Cons-free Interpreters.
CoRR, 2017

On First-order Cons-free Term Rewriting and PTIME.
CoRR, 2017

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

Complexity of Conditional Term Rewriting.
Log. Methods Comput. Sci., 2017

Quasi-reductivity of Logically Constrained Term Rewriting Systems.
CoRR, 2017

The Power of Non-determinism in Higher-Order Implicit Complexity - Characterising Complexity Classes Using Non-deterministic Cons-Free Programming.
Proceedings of the Programming Languages and Systems, 2017

2016
Termination of LCTRSs.
CoRR, 2016

Complexity Hierarchies and Higher-Order Cons-Free Rewriting.
Proceedings of the 1st International Conference on Formal Structures for Computation and Deduction, 2016

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

Constrained Term Rewriting tooL.
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2015

2014
Towards Verifying Procedural Programs using Constrained Rewriting Induction.
CoRR, 2014

First-Order Formative Rules.
Proceedings of the Rewriting and Typed Lambda Calculi - Joint International Conference, 2014

Automatic Constrained Rewriting Induction towards Verifying Procedural Programs.
Proceedings of the Programming Languages and Systems - 12th Asian Symposium, 2014

2013
Term Rewriting with Logical Constraints.
Proceedings of the Frontiers of Combining Systems, 2013

2012
Dynamic Dependency Pairs for Algebraic Functional Systems
Log. Methods Comput. Sci., 2012

Polynomial Interpretations for Higher-Order Rewriting.
Proceedings of the 23rd International Conference on Rewriting Techniques and Applications (RTA'12) , 2012

2011
Higher Order Dependency Pairs for Algebraic Functional Systems.
Proceedings of the 22nd International Conference on Rewriting Techniques and Applications, 2011

Harnessing First Order Termination Provers Using Higher Order Dependency Pairs.
Proceedings of the Frontiers of Combining Systems, 8th International Symposium, 2011

Simplifying Algebraic Functional Systems.
Proceedings of the Algebraic Informatics - 4th International Conference, 2011

2008
A Higher-Order Iterative Path Ordering.
Proceedings of the Logic for Programming, 2008


  Loading...