Zobrazeno 1 - 10 of 13 pro vyhledávání: '"Kop, C.L.M."'
1
Skylines for Symbolic Energy Consumption Analysis
Autor: Klinik, M., Gastel, B.E. van, Kop, C.L.M., Eekelen, M.C.J.D. van, Beek, M.H. ter
Publikováno v: Beek, M.H. ter (ed.), Formal Methods for Industrial Critical Systems: 25th International Conference, FMICS 2020, Vienna, Austria, September 2–3, 2020, Proceedings, 93-112. Cham : Springer
STARTPAGE=93;ENDPAGE=112;ISSN=0302-9743;TITLE=Beek, M.H. ter (ed.), Formal Methods for Industrial Critical Systems: 25th International Conference, FMICS 2020, Vienna, Austria, September 2–3, 2020, Proceedings
Beek, M.H. ter (ed.), Formal Methods for Industrial Critical Systems: 25th International Conference, FMICS 2020, Vienna, Austria, September 2–3, 2020, Proceedings, pp. 93-112
Contains fulltext : 222055.pdf (Publisher’s version ) (Open Access) FMICS'20
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::ff51438ace5ec80940ce5e69f544f931
https://hdl.handle.net/2066/222055
Zobrazit plný text záznamu
2
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
Zobrazit plný text záznamu
3
WANDA – a Higher Order Termination Tool
Autor: Kop, C.L.M., Ariola, Z.M.
Publikováno v: Ariola, Z.M. (ed.), FSCD 2020: 5th International Conference on Formal Structures for Computation and Deduction, pp. 36:1-36:19
Ariola, Z.M. (ed.), FSCD 2020: 5th International Conference on Formal Structures for Computation and Deduction, 36:1-36:19. Dagstuhl : Schloss Dagstuhl--Leibniz-Zentrum für Informatik
STARTPAGE=36:1;ENDPAGE=36:19;ISSN=1868-8969;TITLE=Ariola, Z.M. (ed.), FSCD 2020: 5th International Conference on Formal Structures for Computation and Deduction
Contains fulltext : 222097.pdf (Publisher’s version ) (Open Access) FSCD 2020
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::ba0127f815308499c6362aa4cdd3d733
https://hdl.handle.net/2066/222097
Zobrazit plný text záznamu
4
Automatic Termination Analysis Using WANDA
Autor: Kop, C.L.M.
Publikováno v: HOR 18: 9th Workshop on Higher-Order Rewriting, Oxford 7 July, 2018 Affiliated with FCSD at FLOC 2018, pp. 1-8
HOR 18: 9th Workshop on Higher-Order Rewriting, Oxford 7 July, 2018 Affiliated with FCSD at FLOC 2018, 1-8. [S.l.] : [S.n.]
STARTPAGE=1;ENDPAGE=8;TITLE=HOR 18: 9th Workshop on Higher-Order Rewriting, Oxford 7 July, 2018 Affiliated with FCSD at FLOC 2018
Contains fulltext : 199857.pdf (Publisher’s version ) (Open Access) HOR 18: 9th Workshop on Higher-Order Rewriting, Oxford 7 July, 2018 Affiliated with FCSD at FLOC 2018
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::3d919209cff41594f9c917664a39f293
https://hdl.handle.net/2066/199857
Zobrazit plný text záznamu
5
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
Zobrazit plný text záznamu
6
Polymorphic Higher-Order Termination
Autor: Czajka, L., Kop, C.L.M., Geuvers, H.
Publikováno v: Geuvers, H. (ed.), FSCD 2019: 4th International Conference on Formal Structures for Computation and Deduction, June 24-30, 2019, Dortmund, Germany, 12:1-12:18. Dagstuhl : Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
STARTPAGE=12:1;ENDPAGE=12:18;ISSN=1868-8969;TITLE=Geuvers, H. (ed.), FSCD 2019: 4th International Conference on Formal Structures for Computation and Deduction, June 24-30, 2019, Dortmund, Germany
Geuvers, H. (ed.), FSCD 2019: 4th International Conference on Formal Structures for Computation and Deduction, June 24-30, 2019, Dortmund, Germany, pp. 12:1-12:18
We generalise the termination method of higher-order polynomial interpretations to a setting with impredicative polymorphism. Instead of using weakly monotonic functionals, we interpret terms in a suitable extension of System F-omega. This enables a
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::264266ae0b440b36ffd2b1660922fcd7
https://doi.org/10.4230/lipics.fscd.2019.12
Zobrazit plný text záznamu
7
Higher Order Termination:Automatable Techniques for Proving Termination of Higher-Order Term Rewriting Systems
Autor: Kop, C.L.M.
Publikováno v: Kop, C L M 2012, ' Higher Order Termination : Automatable Techniques for Proving Termination of Higher-Order Term Rewriting Systems ', PhD, Vrije Universiteit Amsterdam .
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=od______4612::e2026e5dfc2a24f448acc98ea007a76e
https://research.vu.nl/ws/files/42215936/cover.pdf
Zobrazit plný text záznamu
8
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
Zobrazit plný text záznamu
9
Higher Order Dependency Pairs for Algebraic Functional Systems
Autor: Kop, C.L.M., van Raamsdonk, F., Schmidt-Schauß, M.
Publikováno v: Kop, C L M & van Raamsdonk, F 2011, Higher Order Dependency Pairs for Algebraic Functional Systems . in M Schmidt-Schauß (ed.), Proc. 22th Conference on Rewriting Techniques and Applications . Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl, pp. 203-218, Rewriting Techniques and Applications, 1/01/11 . https://doi.org/10.4230/LIPIcs.RTA.2011.203
Proc. 22th Conference on Rewriting Techniques and Applications, 203-218
STARTPAGE=203;ENDPAGE=218;TITLE=Proc. 22th Conference on Rewriting Techniques and Applications
We extend the termination method using dynamic dependency pairs to higher order rewriting systems with beta as a rewrite step, also called Algebraic Functional Systems (AFSs). We introduce a variation of usable rules, and use monotone algebras to sol
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0b23e456fa1e81a34542e2dfcc3cdf62
Zobrazit plný text záznamu
10
Simplifying Algebraic Functional Systems
Autor: Kop, C.L.M.
Publikováno v: Kop, C L M 2011, ' Simplifying Algebraic Functional Systems ', Lecture Notes in Computer Science, vol. 6742, pp. 201-215 . https://doi.org/10.1007/978-3-642-21493-6_13
Lecture Notes in Computer Science, 6742, 201-215. Springer Verlag
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::1630f5c185b4aa77db223c2392b2eaa1
https://research.vu.nl/en/publications/69dd515a-909c-4537-992d-fbb185d829a3
Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání

Omezení vyhledávání
Plný text Recenzováno Digitální knihovna AV ČR
Zdroje