Treffer 1 - 20 von 70 für Suche 'Kop, Cynthia', Suchdauer: 0,78s Treffer weiter einschränken
  1. 1
    Verifying Procedural Programs via Constrained Rewriting Induction

    Verifying Procedural Programs via Constrained Rewriting Induction von Fuhs, Carsten, Kop, Cynthia, Nishida, Naoki


    Volltext
    Artikel

    Zu den Favoriten
    Gespeichert in:
  2. 2
    Cutting a Proof into Bite-Sized Chunks (Incrementally Proving Termination in Higher-Order Term Rewriting): Invited Talk at the 18th International Workshop on Logical and Semantic Frameworks, with Applications and 10th Workshop on Horn Clauses for Verification and Synthesis

    Cutting a Proof into Bite-Sized Chunks (Incrementally Proving Termination in Higher-Order Term Rewriting): Invited Talk at the 18th International Workshop on Logical and Semantic F... von Kop, Cynthia


    Volltext
    Artikel

    Zu den Favoriten
    Gespeichert in:
  3. 3
    Complexity Hierarchies and Higher-order Cons-free Term Rewriting

    Complexity Hierarchies and Higher-order Cons-free Term Rewriting von Cynthia Kop, Jakob Grue Simonsen


    Volltext
    Artikel

    Zu den Favoriten
    Gespeichert in:
  4. 4
    Complexity of Conditional Term Rewriting

    Complexity of Conditional Term Rewriting von Cynthia Kop, Aart Middeldorp, Thomas Sternagel


    Volltext
    Artikel

    Zu den Favoriten
    Gespeichert in:
  5. 5
    Dynamic Dependency Pairs for Algebraic Functional Systems

    Dynamic Dependency Pairs for Algebraic Functional Systems von Kop, Cynthia, van Raamsdonk, Femke


    Volltext
    Artikel

    Zu den Favoriten
    Gespeichert in:
  6. 6
    Subclasses of Ptime Interpreted by Programming Languages

    Subclasses of Ptime Interpreted by Programming Languages von Bhaskar, Siddharth, Kop, Cynthia, Simonsen, Jakob Grue

    Veröffentlicht in Theory of computing systems

    Volltext
    Artikel

    Zu den Favoriten
    Gespeichert in:
  7. 7
    Rewriting Induction for Higher-Order Constrained Term Rewriting Systems

    Rewriting Induction for Higher-Order Constrained Term Rewriting Systems von Hagens, Kasper, Kop, Cynthia


    Volltext
    Buchkapitel

    Zu den Favoriten
    Gespeichert in:
  8. 8
    On Basic Feasible Functionals and the Interpretation Method

    On Basic Feasible Functionals and the Interpretation Method von Baillot, Patrick, Dal Lago, Ugo, Kop, Cynthia, Vale, Deivid

    Volltext
    Tagungsbericht

    Zu den Favoriten
    Gespeichert in:
  9. 9
    Term Rewriting with Logical Constraints

    Term Rewriting with Logical Constraints von Kop, Cynthia, Nishida, Naoki


    Volltext
    Tagungsbericht

    Zu den Favoriten
    Gespeichert in:
  10. 10
    A weakly monotonic, logically constrained, HORPO-variant

    A weakly monotonic, logically constrained, HORPO-variant von Kop, Cynthia

    Volltext bestellen
    Artikel

    Zu den Favoriten
    Gespeichert in:
  11. 11
    Cons-free Programs and Complexity Classes between LOGSPACE and PTIME

    Cons-free Programs and Complexity Classes between LOGSPACE and PTIME von Jones, Neil D., Bhaskar, Siddharth, Kop, Cynthia, Simonsen, Jakob Grue


    Volltext
    Artikel

    Zu den Favoriten
    Gespeichert in:
  12. 12
    Constrained Term Rewriting tooL

    Constrained Term Rewriting tooL von Kop, Cynthia, Nishida, Naoki


    Volltext
    Buchkapitel

    Zu den Favoriten
    Gespeichert in:
  13. 13
    Complexity Analysis for Call-by-Value Higher-Order Rewriting

    Complexity Analysis for Call-by-Value Higher-Order Rewriting von Kop, Cynthia, Vale, Deivid

    Volltext bestellen
    Artikel

    Zu den Favoriten
    Gespeichert in:
  14. 14
    Higher-Order LCTRSs and Their Termination

    Higher-Order LCTRSs and Their Termination von Guo, Liye, Kop, Cynthia

    Volltext bestellen
    Artikel

    Zu den Favoriten
    Gespeichert in:
  15. 15
    A weakly monotonic, logically constrained, HORPO-variant

    A weakly monotonic, logically constrained, HORPO-variant von Kop, Cynthia

    Veröffentlicht in arXiv.org

    Volltext
    Artikel

    Zu den Favoriten
    Gespeichert in:
  16. 16
    The Power of Non-determinism in Higher-Order Implicit Complexity: Characterising Complexity Classes Using Non-deterministic Cons-Free Programming

    The Power of Non-determinism in Higher-Order Implicit Complexity: Characterising Complexity Classes Using Non-deterministic Cons-Free Programming von Kop, Cynthia, Simonsen, Jakob Grue


    Volltext
    Buchkapitel

    Zu den Favoriten
    Gespeichert in:
  17. 17
    Tuple Interpretations and Applications to Higher-Order Runtime Complexity

    Tuple Interpretations and Applications to Higher-Order Runtime Complexity von Kop, Cynthia, Vale, Deivid

    Volltext bestellen
    Artikel

    Zu den Favoriten
    Gespeichert in:
  18. 18
    Automatic Constrained Rewriting Induction towards Verifying Procedural Programs

    Automatic Constrained Rewriting Induction towards Verifying Procedural Programs von Kop, Cynthia, Nishida, Naoki


    Volltext
    Buchkapitel

    Zu den Favoriten
    Gespeichert in:
  19. 19
    Tuple Interpretations for Higher-Order Rewriting

    Tuple Interpretations for Higher-Order Rewriting von Vale, Deivid, Kop, Cynthia

    Volltext bestellen
    Artikel

    Zu den Favoriten
    Gespeichert in:
  20. 20
    Simplifying Algebraic Functional Systems

    Simplifying Algebraic Functional Systems von Kop, Cynthia


    Volltext
    Buchkapitel

    Zu den Favoriten
    Gespeichert in:

Suchwerkzeuge: