Cynthia Kop

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