A Static Higher-Order Dependency Pair Framework

Autor: Fuhs, C., Kop, C.L.M., Caires, L.

Publikováno v: Caires, L. (ed.), Programming Languages and Systems: 28th European Symposium on Programming, ESOP 2019, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2019, Prague, Czech Republic, April 6–11, 2019. Proceedings, pp. 752-782
Caires, L. (ed.), Programming Languages and Systems: 28th European Symposium on Programming, ESOP 2019, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2019, Prague, Czech Republic, April 6–11, 2019. Proceedings, 752-782. Cham : Springer International Publishing
STARTPAGE=752;ENDPAGE=782;ISSN=0302-9743;TITLE=Caires, L. (ed.), Programming Languages and Systems: 28th European Symposium on Programming, ESOP 2019, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2019, Prague, Czech Republic, April 6–11, 2019. Proceedings

Contains fulltext : 204578.pdf (Publisher’s version ) (Open Access) Programming Languages and Systems: 28th European Symposium on Programming, ESOP 2019

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::6b54d0cf81f562f80356a385e90c9fdf
https://hdl.handle.net/2066/204578

Improving Static Dependency Pairs for Higher-Order Rewriting

Autor: Fuhs, C., Kop, C.L.M., Lucas, S.

Publikováno v: Lucas, S. (ed.), WST 2018: 16th International Workshop on Termination, July 18-19, 2018, Oxford, UK. Proceedings, 70-74. [S.l.] : S.l.
STARTPAGE=70;ENDPAGE=74;TITLE=Lucas, S. (ed.), WST 2018: 16th International Workshop on Termination, July 18-19, 2018, Oxford, UK. Proceedings
Lucas, S. (ed.), WST 2018: 16th International Workshop on Termination, July 18-19, 2018, Oxford, UK. Proceedings, pp. 70-74

Contains fulltext : 199877.pdf (Author’s version preprint ) (Open Access) Contains fulltext : 199877pub.pdf (Publisher’s version ) (Open Access) WST 2018: 16th International Workshop on Termination, July 18-19, 2018, Oxford, UK

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::6153f8b8037053f51582ef12b564eb43
http://hdl.handle.net/2066/199877

Polynomial Interpretations for Higher-Order Rewriting

Autor: Fuhs, C., Kop, C.L.M., Tiwari, A.

Publikováno v: Proceedings of RTA '12, 176-192
STARTPAGE=176;ENDPAGE=192;TITLE=Proceedings of RTA '12
Fuhs, C & Kop, C L M 2012, Polynomial Interpretations for Higher-Order Rewriting . in A Tiwari (ed.), Proceedings of RTA '12 . Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, pp. 176-192, Rewriting Techniques and Applications, 1/01/12 . https://doi.org/10.4230/LIPIcs.RTA.2012.176

The termination method of weakly monotonic algebras, which has been defined for higher-order rewriting in the HRS formalism, offers a lot of power, but has seen little use in recent years. We adapt and extend this method to the alternative formalism

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3f994644381d94296569ef133a139b85

Termination Analysis by Dependency Pair and Inductive Theorem Proving

Autor: Swiderski, S., Parting, M., Giesl, J., Fuhs, C., Schneider-Kamp, P.

Publikováno v: Swiderski, S, Parting, M, Giesl, J, Fuhs, C & Schneider-Kamp, P 2009, Termination Analysis by Dependency Pair and Inductive Theorem Proving . in R A Schmidt (ed.), Proceedings of the 22nd International Conference on Automated Deduction (CADE '09) . Springer, pp. 322-338, International Conference on Automated Deduction (CADE '09), Montreal, Canada, 24/08/2010 . https://doi.org/10.1007/978-3-642-02959-2_25

Current techniques and tools for automated termination analysis of term rewrite systems (TRSs) are already very powerful. However, they fail for algorithms whose termination is essentially due to an inductive argument. Therefore, we show how to coupl

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=od______3062::bd982dce6326b260e7111da7e0983f8c
https://portal.findresearcher.sdu.dk/da/publications/a3418f20-47bc-11de-b5e8-000ea68e967b

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.