default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJeroen Ketema
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[c25]Dennis Dams, Jeroen Ketema, Pepijn Kramer, Arjan J. Mooij, Andrei Radulescu:
Developing and Applying Custom Static Analysis Tools for Industrial Multi-Language Code Bases. BENEVOL 2021- 2020
- [c24]Arjan J. Mooij, Jeroen Ketema, Steven Klusener, Mathijs Schuts:
Reducing Code Complexity through Code Refactoring and Model-Based Rejuvenation. SANER 2020: 617-621
2010 – 2019
- 2019
- [j10]Jeroen Ketema, Jakob Grue Simonsen:
Computing with Infinite Terms and Infinite Reductions. Fundam. Informaticae 170(4): 339-365 (2019) - 2018
- [j9]Adam Betts, Nathan Chong, Pantazis Deligiannis
, Alastair F. Donaldson, Jeroen Ketema:
Implementing and Evaluating Candidate-Based Invariant Generation. IEEE Trans. Software Eng. 44(7): 631-650 (2018) - [c23]Steven Klusener, Arjan J. Mooij, Jeroen Ketema, Hans van Wezep:
Reducing Code Duplication by Identifying Fresh Domain Abstractions. ICSME 2018: 569-578 - 2017
- [j8]Jeroen Ketema, Alastair F. Donaldson:
Termination analysis for GPU kernels. Sci. Comput. Program. 148: 107-122 (2017) - [c22]Alastair F. Donaldson, Jeroen Ketema, Tyler Sorensen, John Wickerson:
Forward Progress on GPU Concurrency (Invited Talk). CONCUR 2017: 1:1-1:13 - [i2]Raimondas Sasnauskas, Yang Chen, Peter Collingbourne, Jeroen Ketema, Jubi Taneja, John Regehr:
Souper: A Synthesizing Superoptimizer. CoRR abs/1711.04422 (2017) - 2016
- [i1]Adam Betts, Nathan Chong, Pantazis Deligiannis, Alastair F. Donaldson, Jeroen Ketema:
Implementing and Evaluating Candidate-Based Invariant Generation. CoRR abs/1612.01198 (2016) - 2015
- [j7]Adam Betts, Nathan Chong, Alastair F. Donaldson, Jeroen Ketema, Shaz Qadeer, Paul Thomson, John Wickerson:
The Design and Implementation of a Verification Technique for GPU Kernels. ACM Trans. Program. Lang. Syst. 37(3): 10:1-10:49 (2015) - [c21]Riyadh Baghdadi, Ulysse Beaugnon, Albert Cohen, Tobias Grosser, Michael Kruse, Chandan Reddy, Sven Verdoolaege, Adam Betts, Alastair F. Donaldson, Jeroen Ketema, Javed Absar, Sven van Haastregt, Alexey Kravets, Anton Lokhmotov, Robert David, Elnar Hajiyev:
PENCIL: A Platform-Neutral Compute Intermediate Language for Accelerator Programming. PACT 2015: 138-149 - [c20]Jade Alglave, Mark Batty, Alastair F. Donaldson, Ganesh Gopalakrishnan, Jeroen Ketema, Daniel Poetzl, Tyler Sorensen, John Wickerson:
GPU Concurrency: Weak Behaviours and Programming Assumptions. ASPLOS 2015: 577-591 - [c19]Pantazis Deligiannis, Alastair F. Donaldson, Jeroen Ketema, Akash Lal, Paul Thomson:
Asynchronous programming, analysis and testing with state machines. PLDI 2015: 154-164 - 2014
- [c18]Ethel Bardsley, Adam Betts, Nathan Chong, Peter Collingbourne, Pantazis Deligiannis, Alastair F. Donaldson, Jeroen Ketema, Daniel Liew, Shaz Qadeer:
Engineering a Static Verification Tool for GPU Kernels. CAV 2014: 226-242 - [c17]Nathan Chong, Alastair F. Donaldson, Jeroen Ketema:
A sound and complete abstraction for reasoning about parallel prefix sums. POPL 2014: 397-410 - 2013
- [j6]Jeroen Ketema, Jakob Grue Simonsen:
Least upper bounds on the size of confluence and church-rosser diagrams in term rewriting and λ-calculus. ACM Trans. Comput. Log. 14(4): 31:1-31:28 (2013) - [c16]Peter Collingbourne, Alastair F. Donaldson, Jeroen Ketema, Shaz Qadeer:
Interleaving and Lock-Step Semantics for Analysis and Verification of GPU Kernels. ESOP 2013: 270-289 - [c15]Nathan Chong, Alastair F. Donaldson, Paul H. J. Kelly, Jeroen Ketema, Shaz Qadeer:
Barrier invariants: a shared state abstraction for the analysis of data-dependent GPU kernels. OOPSLA 2013: 605-622 - 2012
- [c14]Jeroen Ketema, Jakob Grue Simonsen:
Characterizing Languages by Normalization and Termination in String Rewriting - (Extended Abstract). Developments in Language Theory 2012: 459-464 - [c13]Pouria Zand, Supriyo Chatterjea, Jeroen Ketema, Paul J. M. Havinga:
A distributed scheduling algorithm for real-time (D-SAR) industrial wireless sensor and actuator networks. ETFA 2012: 1-4 - [c12]Takahito Aoto, Jeroen Ketema:
Rational Term Rewriting Revisited: Decidability and Confluence. ICGT 2012: 172-186 - [c11]Jeroen Ketema:
Reinterpreting Compression in Infinitary Rewriting. RTA 2012: 209-224 - 2011
- [j5]Jeroen Ketema, Jakob Grue Simonsen:
Infinitary Combinatory Reduction Systems. Inf. Comput. 209(6): 893-926 (2011) - [j4]Jeroen Ketema:
Counterexamples in infinitary rewriting with non-fully-extended rules. Inf. Process. Lett. 111(13): 642-646 (2011) - [c10]Niels Bjørn Bugge Grathwohl, Jeroen Ketema, Jens Duelund Pallesen, Jakob Grue Simonsen:
Anagopos: A Reduction Graph Visualizer for Term Rewriting and Lambda Calculus. RTA 2011: 61-70 - 2010
- [j3]Jeroen Ketema, Jakob Grue Simonsen:
Infinitary Combinatory Reduction Systems: Normalising Reduction Strategies. Log. Methods Comput. Sci. 6(1) (2010) - [j2]Helle Hvid Hansen, Jeroen Ketema, Bas Luttik, Mohammad Reza Mousavi, Jaco van de Pol:
Towards model checking executable UML specifications in mCRL2. Innov. Syst. Softw. Eng. 6(1-2): 83-90 (2010) - [c9]Jeroen Ketema, Jakob Grue Simonsen:
Least Upper Bounds on the Size of Church-Rosser Diagrams in Term Rewriting and lambda-Calculus. FLOPS 2010: 272-287 - [c8]Helle Hvid Hansen, Jeroen Ketema, Bas Luttik, Mohammad Reza Mousavi, Jaco van de Pol, Osmar Marchi dos Santos:
Automated Verification of Executable UML Models. FMCO 2010: 225-250
2000 – 2009
- 2009
- [j1]Jeroen Ketema, Jakob Grue Simonsen:
Infinitary Combinatory Reduction Systems: Confluence. Log. Methods Comput. Sci. 5(4) (2009) - [c7]Jeroen Ketema:
Comparing Böhm-Like Trees. RTA 2009: 239-254 - 2008
- [c6]Jeroen Ketema:
On Normalisation of Infinitary Combinatory Reduction Systems. RTA 2008: 172-186 - 2005
- [c5]Jeroen Ketema, Jakob Grue Simonsen:
On Confluence of Infinitary Combinatory Reduction Systems. LPAR 2005: 199-214 - [c4]Jeroen Ketema, Jakob Grue Simonsen:
Infinitary Combinatory Reduction Systems. RTA 2005: 438-452 - 2004
- [c3]Jeroen Ketema:
Böhm-Like Trees for Term Rewriting Systems. RTA 2004: 233-248 - [c2]Jeroen Ketema:
Some Undecidable Approximations of TRSs. WRS 2004: 51-63 - [c1]Jeroen Ketema, Jan Willem Klop, Vincent van Oostrom:
Vicious Circles in Orthogonal Term Rewriting Systems. WRS 2004: 65-77
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
