From post

копировать удалить добавить публикацию в буфер
Запись сообщества
посмотреть историю данной записи
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Verifying Procedural Programs via Constrained Rewriting Induction.

C. Fuhs, C. Kop, и N. Nishida. ACM Trans. Comput. Log., 18 (2): 14:1-14:50 (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

WANDA - a Higher Order Termination Tool (System Description).C. Kop. FSCD, том 167 из LIPIcs, стр. 36:1-36:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Higher-order Cons-free Interpreters.C. Kop, и J. Simonsen. CoRR, (2017)Higher-Order LCTRSs and Their Termination.L. Guo, и C. Kop. CoRR, (2023)Cost-Size Semantics for Call-By-Value Higher-Order Rewriting.C. Kop, и D. Vale. FSCD, том 260 из LIPIcs, стр. 15:1-15:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)On Basic Feasible Functionals and the Interpretation Method.P. Baillot, U. Lago, C. Kop, и D. Vale. FoSSaCS (2), том 14575 из Lecture Notes in Computer Science, стр. 70-91. Springer, (2024)Termination of LCTRSs.C. Kop. CoRR, (2016)Cons-free Programming with Immutable Functions.C. Kop. CoRR, (2017)A Higher-Order Iterative Path Ordering.C. Kop, и F. van Raamsdonk. LPAR, том 5330 из Lecture Notes in Computer Science, стр. 697-711. Springer, (2008)Polymorphic Higher-Order Termination.L. Czajka, и C. Kop. FSCD, том 131 из LIPIcs, стр. 12:1-12:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Subclasses of Ptime Interpreted by Programming Languages.S. Bhaskar, C. Kop, и J. Simonsen. Theory Comput. Syst., 67 (3): 437-472 (июня 2023)