Jeroen Ketema - Citegraph

Author Info

Name	Affiliation	Papers
JEROEN KETEMA	Faculty EEMCS, University of Twente, Enschede, The Netherlands 7500 AE	26
Collaborators	Citations	PageRank
28	160	13.52
Referers	Referees	References
228	489	384

Search Limit

100489

Publications (26 rows)

Collaborators (28 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
Computing with Infinite Terms and Infinite Reductions.	0	0.34	2019
The Design and Implementation of a Verification Technique for GPU Kernels	20	0.70	2015
Asynchronous programming, analysis and testing with state machines	13	0.62	2015
A sound and complete abstraction for reasoning about parallel prefix sums	11	0.54	2014
Engineering a Static Verification Tool for GPU Kernels.	16	0.66	2014
Interleaving and lock-step semantics for analysis and verification of GPU kernels	14	0.62	2013
Least upper bounds on the size of confluence and church-rosser diagrams in term rewriting and λ-calculus	1	0.43	2013
Barrier invariants: a shared state abstraction for the analysis of data-dependent GPU kernels	11	0.53	2013
Rational term rewriting revisited: decidability and confluence	0	0.34	2012
Reinterpreting Compression in Infinitary Rewriting.	5	0.58	2012
A Distributed Scheduling Algorithm For Real-Time (D-Sar) Industrial Wireless Sensor And Actuator Networks	2	0.54	2012
Characterizing Languages by Normalization and Termination in String Rewriting - (Extended Abstract).	0	0.34	2012
Anagopos: A Reduction Graph Visualizer for Term Rewriting and Lambda Calculus	1	0.38	2011
Infinitary Combinatory Reduction Systems	14	0.73	2011
Counterexamples in infinitary rewriting with non-fully-extended rules	0	0.34	2011
Least Upper Bounds on the Size of Church-Rosser Diagrams in Term Rewriting and lambda-Calculus	0	0.34	2010
Automated verification of executable UML models	0	0.34	2010
Towards model checking executable UML specifications in mCRL2	19	1.29	2010
Infinitary Combinatory Reduction Systems: Normalising Reduction Strategies	5	0.59	2010
Comparing Böhm-Like Trees	4	0.46	2009
Infinitary Combinatory Reduction Systems: Confluence	7	0.55	2009
On Normalisation of Infinitary Combinatory Reduction Systems	6	0.53	2008
On confluence of infinitary combinatory reduction systems	6	0.51	2005
Some Undecidable Approximations of TRSs	0	0.34	2005
Vicious Circles in Orthogonal Term Rewriting Systems	2	0.48	2005
Böhm-Like Trees for Term Rewriting Systems	3	0.42	2004