Publications

Peer-Reviewed Journals

  1. [pdf |doi] Adam Betts, Nathan Chong, Pantazis Deligiannis, Alastair F. Donaldson, and Jeroen Ketema. Implementing and Evaluating Candidate-Based Invariant Generation. To appear in IEEE Transactions on Software Engineering. IEEE, 2017.
  2. [pdf |doi] Jeroen Ketema and Alastair F. Donaldson. Termination Analysis for GPU Kernels To appear in Science of Computer Programming. Elsevier, 2017.
  3. [pdf |doi] Adam Betts, Nathan Chong, Alastair F. Donaldson, Jeroen Ketema, Shaz Qadeer, Paul Thomson, and John Wickerson. The Design and Implementation of a Verification Technique for GPU Kernels. Volume 37(3) of ACM Transaction on Programming Languages and Systems, pp. 10:1-10:49. ACM, 2015.
  4. [pdf |doi] Jeroen Ketema and Jakob Grue Simonsen. Least Upper Bounds on the Size of Confluence and Church-Rosser Diagrams in Term Rewriting and λ-Calculus. Volume 14(4) of ACM Transactions on Computational Logic, pp. 31:1-31:28. ACM, 2013.
  5. [pdf |doi] Jeroen Ketema. Counterexamples in Infinitary Rewriting with Non-Fully-Extended Rules. Volume 111(13) of Information Processing Letters, pp. 642-646. Elsevier, 2011.
  6. [pdf |doi] Jeroen Ketema and Jakob Grue Simonsen. Infintary Combinatory Reduction Systems. Volume 209(6) of Information and Computation, pp. 893-926. Elsevier, 2011.
  7. [pdf |doi] Helle Hvid Hansen, Jeroen Ketema, Bas Luttik, MohammadReza Mousavi, and Jaco van de Pol. Towards Model Checking Executable UML Specifications in mCRL2. Volume 6(1-2) of Innovations in Systems and Software Engineering, pp. 83-90. Springer, 2010.
  8. [pdf |doi] Jeroen Ketema and Jakob Grue Simonsen. Infinitary Combinatory Reduction Systems: Normalising Reduction Strategies. Volume 6(1:7) of Logical Methods in Computer Science, pp. 1-35. 2010.
  9. [pdf |doi] Jeroen Ketema and Jakob Grue Simonsen. Infinitary Combinatory Reduction Systems: Confluence. Volume 5(4:3) of Logical Methods in Computer Science, pp. 1-29. 2009.

Peer-Reviewed Conferences

  1. [pdf |doi] Alastair F. Donaldson, Jeroen Ketema, Tyler Sorensen, and John Wickerson. Forward Progress on GPU Concurrency In Proceedings of the 28th International Conference on Concurrency Theory (CONCUR 2017), volume 85 of Leibniz International Proceedings in Informatics (LIPIcs), pp. 1:1-1:13. Schloss Dagstuhl, 2017. (Invited publication.)
  2. [pdf |doi] 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, Róbert Dávid, and Elnar Hajiyev. Pencil: A Platform-Neutral Compute Intermediate Language for Accelerator Programming. In Proceedings of the 24th International Conference on Parallel Architectures and Compilation Techniques (PACT 2015), pp. 138-149. IEEE, 2015.
  3. [pdf |doi] Pantazis Deligiannis, Alastair F. Donaldson, Jeroen Ketema, and Akash Lal. Asynchronous Programming, Analysis and Testing with State Machines. In Proceedings of the 36th Annual ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI 2015), pp. 154-164. ACM, 2015. (The artifact can be found here.)
  4. [pdf |doi] Jade Alglave, Mark Batty, Alastair F. Donaldson, Ganesh Gopalakrishnan, Jeroen Ketema, Daniel Poetzl, Tyler Sorensen, and John Wickerson. GPU Concurrency: Weak Behaviours and Programming Assumptions. In Proceedings of the 20th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS 2015), pp. 577-591. ACM, 2015. (Technical appendix (pdf); Video of a pink pony)
  5. [pdf |doi] Ethel Bardsley, Adam Betts, Nathan Chong, Peter Collingbourne, Pantazis Deligiannis, Alastair F. Donaldson, Jeroen Ketema, Daniel Liew, and Shaz Qadeer. Engineering a Static Verification Tool for GPU Kernels. In Proceedings of the 26th International Conference on Computer Aided Verification (CAV 2014), volume 8559 of Lecture Notes in Computer Science, pp. 226-242. Springer, 2014.
  6. [pdf |doi] Nathan Chong, Alastair F. Donaldson, and Jeroen Ketema. A Sound and Complete Abstraction for Reasoning about Parallel Prefix Sums. In Proceedings of the 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL 2014), pp. 397-410. ACM, 2014.
  7. [pdf |doi] Nathan Chong, Alastair F. Donaldson, Paul H.J. Kelly, Jeroen Ketema, and Shaz Qadeer. Barrier Invariants: A Shared State Abstraction for the Analysis of Data-Dependent GPU Kernels. In Proceedings of the 28th ACM SIGPLAN International Conference on Object Oriented Programming, Systems, Languages, and Applications (OOPSLA 2013), pp. 605-622. ACM, 2013. (The artifact can be found here.)
  8. [pdf |doi] Peter Collingbourne, Alastair F. Donaldson, Jeroen Ketema, and Shaz Qadeer. Interleaving and Lock-Step Semantics for Analysis and Verification of GPU Kernels. In Proceedings of the 22nd European Symposium on Programming (ESOP 2013), volume 7792 of Lecture Notes in Computer Science, pp. 270-289. Springer, 2013.
  9. [pdf |doi] Takahito Aoto and Jeroen Ketema. Rational Term Rewriting Revisited: Decidability and Confluence. In Proceedings of the 6th International Conference on Graph Transformations (ICGT 2012), volume 7562 of Lecture Notes in Computer Science, pp. 172-186. Springer, 2012.
  10. [pdf |doi] Pouria Zand, Supriyo Chatterjea, Jeroen Ketema, and Paul Havinga. A Distributed Scheduling Algorithm for Real-time (D-SAR) Industrial Wireless Sensor and Actuator Networks. In Proceedings of the 17th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA 2012), pp. 1-4. IEEE, 2012. (Published as a work-in-progress paper.)
  11. [pdf |doi] Jeroen Ketema and Jakob Grue Simonsen. Characterizing Languages by Normalization and Termination in String Rewriting. In Proceedings of the 16th International Conference on Developments in Language Theory (DLT 2012), volume 7410 of Lecture Notes in Computer Science, pp. 459-464. Springer, 2012. (Published as a short paper.)
  12. [pdf |doi] Jeroen Ketema. Reinterpreting Compression in Infinitary Rewriting. In Proceedings of the 23rd International Conference on Rewriting Techniques and Applications (RTA 2012), volume 15 of Leibniz International Proceedings in Informatics (LIPIcs), pp. 209-224. Schloss Dagstuhl, 2012.
  13. [pdf |doi] Helle Hvid Hansen, Jeroen Ketema, Bas Luttik, MohammadReza Mousavi, Jaco van de Pol, and Osmar Marchi dos Santos. Automated Verification of Executable UML Models. In Revised Papers of the 9th International Symposium on Formal Methods for Components and Objects (FMCO 2010), volume 6957 of Lecture Notes in Computer Science, pp. 225-250. Springer, 2011.
  14. [pdf |doi] Niels Bjørn Bugge Grathwohl, Jeroen Ketema, Jens Duelund Pallesen, and Jakob Grue Simonsen. Anagopos: A Reduction Graph Visualizer for Term Rewriting and Lambda Calculus. In Proceedings of the 22nd International Conference on Rewriting Techniques and Applications (RTA 2011), volume 10 of Leibniz International Proceedings in Informatics (LIPIcs), pp. 61-70. Schloss Dagstuhl, 2011.
  15. [pdf |doi] Jeroen Ketema and Jakob Grue Simonsen. Least Upper Bounds on the Size of Church-Rosser Diagrams in Term Rewriting and λ-Calculus. In Proceedings of the 10th International Symposium on Functional and Logic Programming (FLOPS 2010), volume 6009 of Lecture Notes in Computer Science, pp. 272-287. Springer, 2010.
  16. [pdf |doi] Jeroen Ketema. Comparing Böhm-Like Trees. In Proceedings of the 20th International Conference on Rewriting Techniques and Applications (RTA 2009), volume 5595 of Lecture Notes in Computer Science, pp. 239-254. Springer, 2009.
  17. [pdf |doi] Jeroen Ketema. On Normalisation of Infinitary Combinatory Reduction Systems. In Proceedings of the 19th International Conference on Rewriting Techniques and Applications (RTA 2008), volume 5117 of Lecture Notes in Computer Science, pp. 172-186. Springer, 2008.
  18. [pdf |doi] Jeroen Ketema and Jakob Grue Simonsen. On Confluence of Infinitary Combinatory Reduction Systems. In Proceedings of the 12th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR 2005), volume 3835 of Lecture Notes in Artificial Intelligence, pp. 199-214. Springer, 2005.
  19. [pdf |doi] Jeroen Ketema and Jakob Grue Simonsen. Infinitary Combinatory Reduction Systems. In Proceedings of the 16th International Conference on Rewriting Techniques and Applications (RTA 2005), volume 3467 of Lecture Notes in Computer Science, pp. 438-452. Springer, 2005.
  20. [pdf |doi] Jeroen Ketema. Böhm-Like Trees for Term Rewriting Systems. In Proceedings of the 15th International Conference on Rewriting Techniques and Applications (RTA 2004), volume 3091 of Lecture Notes in Computer Science, pp. 233-248. Springer, 2004.

Rigorously Peer-Reviewed Workshops

  1. [pdf |doi] Jeroen Ketema, Jan Willem Klop, and Vincent van Oostrom. Vicious Circles in Orthogonal Term Rewriting Systems. In Proceedings of the 4th International Workshop on Reduction Strategies in Rewriting and Programming (WRS'04), volume 124(2) of Electronic Notes in Theoretical Computer Science, pp. 65-77. Elsevier, 2005. (Invited publication.)
  2. [pdf |doi] Jeroen Ketema. Some Undecidable Approximations of TRSs. In Proceedings of the 4th International Workshop on Reduction Strategies in Rewriting and Programming (WRS'04), volume 124(2) of Electronic Notes in Theoretical Computer Science, pp. 51-63. Elsevier, 2005.

Book Chapters

  1. [pdf |doi] Alastair F. Donaldson, Ganesh Gopalakrishnan, Nathan Chong, Jeroen Ketema, Guodong Li, Peng Li, Anton Lokhmotov, and Shaz Qadeer. Formal Analysis Techniques for Reliable GPU Programming: Current Solutions and Call to Action. In Advances in GPU Research and Practice, pp. 3-21. Morgan Kaufmann, 2017.

Workshops

  1. [pdf] Jeroen Ketema and Alastair F. Donaldson. Automatic Termination Analysis for GPU Kernels. In Proceedings of the 14th International Workshop on Termination (WST 2014), 2014.
  2. [pdf] Jeroen Ketema. Infinitary Standardisation - Computed. In Proceedings of the first on Workshop on Infinitary Rewriting (WIR 2013), 2013.
  3. [pdf] Pouria Zand, Supriyo Chatterjea, Jeroen Ketema, and Paul Havinga. D-SAR: A Distributed Scheduling Algorithm for Real-time, Closed-Loop Control in Industrial Wireless Sensor and Actuator Networks. In Proceedings of the Workshop on Real-Time Wireless for Industrial Applications (RealWin'11), 2011.
  4. [pdf] Jörg Endrullis and Jeroen Ketema. Root Stabilisation Using Dependency Pairs. In Proceedings of the 9th International Workshop on Termination (WST 2007), 2007. (Erratum (pdf))
  5. [pdf] Jeroen Ketema, Jan Willem Klop, and Vincent van Oostrom. Vicious Circles in Rewriting Systems. In Proceedings of the 5th International Workshop on Reduction Strategies in Rewriting and Programming (WRS'05), 2005.
  6. [pdf] Jeroen Ketema and Femke van Raamsdonk. Erasure and Termination in Higher-Order Rewriting. In Proceedings of the 7th International Workshop on Termination (WST'04), volume AIB-2004-07 of Aachener Informatik-Berichte, pp. 30-33. RWTH Aachen, 2004.
  7. [pdf] Jeroen Ketema. Some Undecidable Approximations of TRSs. In Preliminary Proceedings of the 4th International Workshop on Reduction Strategies in Rewriting and Programming (WRS'04), volume AIB-2004-06 of Aachener Informatik-Berichte, pp. 25-34. RWTH Aachen, 2004.

Technical Reports

  1. [pdf] Jeroen Ketema and Jakob Grue Simonsen. Infinitary Combinatory Reduction Systems. Technical Report D-558, DIKU, University of Copenhagen, 2006. (Extended and revised version of DIKU technical report D-522 and the LPAR 2005 publication "On Confluence of Infinitary Combinatory Reduction Systems".)
  2. [pdf] Jeroen Ketema and Jakob Grue Simonsen. Infinitary Combinatory Reduction Systems. Technical Report D-522, DIKU, University of Copenhagen, 2005. (Extended version of the RTA 2005 publication with the same title.)
  3. [pdf] Jeroen Ketema, Jan Willem Klop, and Vincent van Oostrom. Vicious Circles in Rewriting Systems. Artificial Intelligence Preprint 52, Department of Philosophy, Utrecht University, 2004. Technical Report SEN-E0427, Centre for Mathematics and Computer Science (CWI), Amsterdam, 2004.
  4. [pdf] Jeroen Ketema, Jan Willem Klop, and Vincent van Oostrom. Vicious Circles in Orthogonal Term Rewriting Systems. Technical Report SEN-R0418, Centre for Mathematics and Computer Science (CWI), Amsterdam, 2004. (Identical to the ENTCS WRS'04 publication with the same title.)

Theses

  1. [pdf] Jeroen Ketema. Böhm-Like Trees for Rewriting. PhD thesis, Vrije Universiteit Amsterdam, March 2006.
  2. [pdf] Jeroen Ketema. Fault Tolerant Master-Slave Replication and Recovery in Globe. MSc thesis, Vrije Universiteit Amsterdam, March 2001.

Miscellaneous

  1. [pdf] Jeroen Ketema, Stefan Blom, Takahito Aoto, and Jakob Grue Simonsen. Rewriting Transfinite Terms. Liber Amicorum for Roel de Vrijer, pp. 129-144. 2009. (Not peer-reviewed; likely to be flawed.)