Zobrazeno 1 - 10
of 28
pro vyhledávání: '"Jeroen Ketema"'
Autor:
Jeroen Ketema, Jakob Grue Simonsen
Publikováno v:
Logical Methods in Computer Science, Vol Volume 6, Issue 1 (2010)
We study normalising reduction strategies for infinitary Combinatory Reduction Systems (iCRSs). We prove that all fair, outermost-fair, and needed-fair strategies are normalising for orthogonal, fully-extended iCRSs. These facts properly generalise a
Externí odkaz:
https://doaj.org/article/a9da3cda982a4ad18204762ddca38577
Autor:
Jeroen Ketema, Jakob Grue Simonsen
Publikováno v:
Logical Methods in Computer Science, Vol Volume 5, Issue 4 (2009)
We study confluence in the setting of higher-order infinitary rewriting, in particular for infinitary Combinatory Reduction Systems (iCRSs). We prove that fully-extended, orthogonal iCRSs are confluent modulo identification of hypercollapsing subterm
Externí odkaz:
https://doaj.org/article/76d3d7add4984cb6b2264c2916c9eca4
Autor:
Jakob Grue Simonsen, Jeroen Ketema
Publikováno v:
Fundamenta Informaticae. 170:339-365
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::486d08312baa26a5f10513b00c38c39d
https://doi.org/10.3233/fi-2019-1866
https://doi.org/10.3233/fi-2019-1866
Publikováno v:
SANER
Over time, software tends to grow more complex, hampering understandability and further development. To reduce accidental complexity, model-based rejuvenation techniques have been proposed. These techniques combine reverse engineering (extracting mod
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1b1a3fbc87e64f990ed17166370bfa68
http://resolver.tudelft.nl/uuid:c24cbc7e-75d7-4b61-b39b-cd9672653dc8
http://resolver.tudelft.nl/uuid:c24cbc7e-75d7-4b61-b39b-cd9672653dc8
Publikováno v:
IEEE Transactions on Software Engineering. 44:631-650
The discovery of inductive invariants lies at the heart of static program verification. Presently, many automatic solutions to inductive invariant generation are inflexible, only applicable to certain classes of programs, or unpredictable. An automat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f365d24def60d2796ef1ab22e3dd2cd9
https://doi.org/10.1109/tse.2017.2718516
https://doi.org/10.1109/tse.2017.2718516
Publikováno v:
ICSME
34th IEEE International Conference on Software Maintenance and Evolution, ICSME 2018, 23 September 2018 through 29 September 2018, Proceedings-2018 IEEE International Conference on Software Maintenance and Evolution, ICSME 2018, 569-578
34th IEEE International Conference on Software Maintenance and Evolution, ICSME 2018, 23 September 2018 through 29 September 2018, Proceedings-2018 IEEE International Conference on Software Maintenance and Evolution, ICSME 2018, 569-578
When software components are developed iteratively, code frequently evolves in an inductive manner: a unit (class, method, etc.) is created and is then copied and modified many times. Such development often happens when variation points and, hence, p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a834bd191d602ddfd64ba028cac940e4
https://doi.org/10.1109/icsme.2018.00020
https://doi.org/10.1109/icsme.2018.00020
Autor:
John Wickerson, Paul Thomson, Nathan Chong, Shaz Qadeer, Jeroen Ketema, Alastair F. Donaldson, Adam Betts
Publikováno v:
ACM Transactions on Programming Languages and Systems. 37:1-49
We present a technique for the formal verification of GPU kernels, addressing two classes of correctness properties: data races and barrier divergence. Our approach is founded on a novel formal operational semantics for GPU kernels termed synchronous
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b4d6818940f11616d69cd746a6ca2552
https://doi.org/10.1145/2743017
https://doi.org/10.1145/2743017
Autor:
Alastair F. Donaldson, Jeroen Ketema
We describe a thread-modular technique for proving termination of massively parallel GPU kernels. The technique reduces the termination problem for these kernels to a sequential termination problem by abstracting the shared state, and as such allows
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7c04f82860a6b9ef44be80d77b7eee67
http://hdl.handle.net/10044/1/51984
http://hdl.handle.net/10044/1/51984
Autor:
Ganesh Gopalakrishnan, Shaz Qadeer, Guodong Li, Peng Li, Nathan Chong, Jeroen Ketema, Anton Lokhmotov, Alastair F. Donaldson
Graphics processing units (GPU)-accelerated computing is being adopted increasingly in a number of areas, ranging from high-end scientific computing to mobile and embedded computing. While GPU programs routinely provide high computational throughput
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e58036a9b2e292a02502236624718c0f
https://doi.org/10.1016/b978-0-12-803738-6.00001-x
https://doi.org/10.1016/b978-0-12-803738-6.00001-x
Autor:
Jakob Grue Simonsen, Jeroen Ketema
Publikováno v:
ACM Transactions on Computational Logic. 14:1-28
We study confluence and the Church-Rosser property in term rewriting and λ-calculus with explicit bounds on term sizes and reduction lengths. Given a system R , we are interested in the lengths of the reductions in the smallest valleys t → * s ′
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2a734447c2fc76058fb6fb37518694f0
https://doi.org/10.1145/2528934
https://doi.org/10.1145/2528934