Jeroen Ketema

According to our database1, Jeroen Ketema authored at least 35 papers between 2004 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Developing and Applying Custom Static Analysis Tools for Industrial Multi-Language Code Bases.
Proceedings of the 20th Belgium-Netherlands Software Evolution Workshop, 2021

2020
Reducing Code Complexity through Code Refactoring and Model-Based Rejuvenation.
Proceedings of the 27th IEEE International Conference on Software Analysis, 2020

2019
Computing with Infinite Terms and Infinite Reductions.
Fundam. Informaticae, 2019

2018
Implementing and Evaluating Candidate-Based Invariant Generation.
IEEE Trans. Software Eng., 2018

Reducing Code Duplication by Identifying Fresh Domain Abstractions.
Proceedings of the 2018 IEEE International Conference on Software Maintenance and Evolution, 2018

2017
Termination analysis for GPU kernels.
Sci. Comput. Program., 2017

Souper: A Synthesizing Superoptimizer.
CoRR, 2017

Forward Progress on GPU Concurrency (Invited Talk).
Proceedings of the 28th International Conference on Concurrency Theory, 2017

2015
The Design and Implementation of a Verification Technique for GPU Kernels.
ACM Trans. Program. Lang. Syst., 2015

Asynchronous programming, analysis and testing with state machines.
Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2015

GPU Concurrency: Weak Behaviours and Programming Assumptions.
Proceedings of the Twentieth International Conference on Architectural Support for Programming Languages and Operating Systems, 2015

PENCIL: A Platform-Neutral Compute Intermediate Language for Accelerator Programming.
Proceedings of the 2015 International Conference on Parallel Architectures and Compilation, 2015

2014
A sound and complete abstraction for reasoning about parallel prefix sums.
Proceedings of the 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2014

Engineering a Static Verification Tool for GPU Kernels.
Proceedings of the Computer Aided Verification - 26th International Conference, 2014

2013
Least upper bounds on the size of confluence and church-rosser diagrams in term rewriting and λ-calculus.
ACM Trans. Comput. Log., 2013

Barrier invariants: a shared state abstraction for the analysis of data-dependent GPU kernels.
Proceedings of the 2013 ACM SIGPLAN International Conference on Object Oriented Programming Systems Languages & Applications, 2013

Interleaving and Lock-Step Semantics for Analysis and Verification of GPU Kernels.
Proceedings of the Programming Languages and Systems, 2013

2012
Reinterpreting Compression in Infinitary Rewriting.
Proceedings of the 23rd International Conference on Rewriting Techniques and Applications (RTA'12) , 2012

Rational Term Rewriting Revisited: Decidability and Confluence.
Proceedings of the Graph Transformations - 6th International Conference, 2012

A distributed scheduling algorithm for real-time (D-SAR) industrial wireless sensor and actuator networks.
Proceedings of 2012 IEEE 17th International Conference on Emerging Technologies & Factory Automation, 2012

Characterizing Languages by Normalization and Termination in String Rewriting - (Extended Abstract).
Proceedings of the Developments in Language Theory - 16th International Conference, 2012

2011
Counterexamples in infinitary rewriting with non-fully-extended rules.
Inf. Process. Lett., 2011

Infinitary Combinatory Reduction Systems.
Inf. Comput., 2011

Anagopos: A Reduction Graph Visualizer for Term Rewriting and Lambda Calculus.
Proceedings of the 22nd International Conference on Rewriting Techniques and Applications, 2011

2010
Towards model checking executable UML specifications in mCRL2.
Innov. Syst. Softw. Eng., 2010

Infinitary Combinatory Reduction Systems: Normalising Reduction Strategies
Log. Methods Comput. Sci., 2010

Automated Verification of Executable UML Models.
Proceedings of the Formal Methods for Components and Objects - 9th International Symposium, 2010

Least Upper Bounds on the Size of Church-Rosser Diagrams in Term Rewriting and <i>lambda</i>-Calculus.
Proceedings of the Functional and Logic Programming, 10th International Symposium, 2010

2009
Infinitary Combinatory Reduction Systems: Confluence
Log. Methods Comput. Sci., 2009

Comparing Böhm-Like Trees.
Proceedings of the Rewriting Techniques and Applications, 20th International Conference, 2009

2008
On Normalisation of Infinitary Combinatory Reduction Systems.
Proceedings of the Rewriting Techniques and Applications, 19th International Conference, 2008

2005
On Confluence of Infinitary Combinatory Reduction Systems.
Proceedings of the Logic for Programming, 2005

2004
Vicious Circles in Orthogonal Term Rewriting Systems.
Proceedings of the 4th International Workshop on Reduction Strategies in Rewriting and Programming, 2004

Some Undecidable Approximations of TRSs.
Proceedings of the 4th International Workshop on Reduction Strategies in Rewriting and Programming, 2004

Böhm-Like Trees for Term Rewriting Systems.
Proceedings of the Rewriting Techniques and Applications, 15th International Conference, 2004


  Loading...