Travelled to:1 × Brazil
1 × Italy
1 × Serbia
1 × Taiwan
1 × Turkey
2 × Austria
2 × Germany
3 × Japan
3 × USA
Collaborated with:∅ J.G.Simonsen A.F.Donaldson N.Chong S.Qadeer T.Aoto P.Collingbourne P.Deligiannis N.B.B.Grathwohl J.D.Pallesen A.Lal P.Thomson P.H.J.Kelly J.Alglave M.Batty G.Gopalakrishnan D.Pötzl T.Sorensen J.Wickerson E.Bardsley A.Betts D.Liew
Talks about:rewrit (6) term (4) gpu (4) infinitari (3) analysi (3) system (3) reduct (3) kernel (3) combinatori (2) calculus (2)
Person: Jeroen Ketema
DBLP: Ketema:Jeroen
Contributed to:
2015
2015
2014
2014
2013
2013
2012
2012
20122011
20102009200820052004Wrote 15 papers:
- ASPLOS-2015-AlglaveBDGKPSW #behaviour #concurrent #gpu #programming
- GPU Concurrency: Weak Behaviours and Programming Assumptions (JA, MB, AFD, GG, JK, DP, TS, JW), pp. 577–591.
- PLDI-2015-DeligiannisDKLT #analysis #programming #state machine #testing
- Asynchronous programming, analysis and testing with state machines (PD, AFD, JK, AL, PT), pp. 154–164.
- CAV-2014-BardsleyBCCDDKLQ #gpu #kernel #verification
- Engineering a Static Verification Tool for GPU Kernels (EB, AB, NC, PC, PD, AFD, JK, DL, SQ), pp. 226–242.
- POPL-2014-ChongDK #abstraction #parallel #reasoning
- A sound and complete abstraction for reasoning about parallel prefix sums (NC, AFD, JK), pp. 397–410.
- ESOP-2013-CollingbourneDKQ #analysis #gpu #kernel #semantics #verification
- Interleaving and Lock-Step Semantics for Analysis and Verification of GPU Kernels (PC, AFD, JK, SQ), pp. 270–289.
- OOPSLA-2013-ChongDKKQ #abstraction #analysis #gpu #invariant #kernel
- Barrier invariants: a shared state abstraction for the analysis of data-dependent GPU kernels (NC, AFD, PHJK, JK, SQ), pp. 605–622.
- DLT-2012-KetemaS #normalisation #string #termination
- Characterizing Languages by Normalization and Termination in String Rewriting — (JK, JGS), pp. 459–464.
- ICGT-2012-AotoK #confluence #decidability #term rewriting
- Rational Term Rewriting Revisited: Decidability and Confluence (TA, JK), pp. 172–186.
- RTA-2012-Ketema
- Reinterpreting Compression in Infinitary Rewriting (JK), pp. 209–224.
- RTA-2011-GrathwohlKPS #graph #named #reduction #term rewriting #visualisation #λ-calculus
- Anagopos: A Reduction Graph Visualizer for Term Rewriting and λ Calculus (NBBG, JK, JDP, JGS), pp. 61–70.
- FLOPS-2010-KetemaS #bound #diagrams #term rewriting #λ-calculus
- Least Upper Bounds on the Size of Church-Rosser Diagrams in Term Rewriting and λ-Calculus (JK, JGS), pp. 272–287.
- RTA-2009-Ketema
- Comparing Böhm-Like Trees (JK), pp. 239–254.
- RTA-2008-Ketema #combinator #normalisation #on the #reduction
- On Normalisation of Infinitary Combinatory Reduction Systems (JK), pp. 172–186.
- RTA-2005-KetemaS #combinator #reduction
- Infinitary Combinatory Reduction Systems (JK, JGS), pp. 438–452.
- RTA-2004-Ketema #term rewriting
- Böhm-Like Trees for Term Rewriting Systems (JK), pp. 233–248.