Jeroen Ketema

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C

Ask others: ACM DL/Guide -

- CSB - MetaPress - Google - Bing - Yahoo

	2013
c13		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
	2012
c12		Jeroen Ketema, Jakob Grue Simonsen: Characterizing Languages by Normalization and Termination in String Rewriting - (Extended Abstract). Developments in Language Theory 2012: 459-464
c11		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
c10		Takahito Aoto, Jeroen Ketema: Rational Term Rewriting Revisited: Decidability and Confluence. ICGT 2012: 172-186
c9		Jeroen Ketema: Reinterpreting Compression in Infinitary Rewriting. RTA 2012: 209-224
	2011
j7		Jeroen Ketema, Jakob Grue Simonsen: Infinitary Combinatory Reduction Systems. Inf. Comput. 209(6): 893-926 (2011)
j6		Jeroen Ketema: Counterexamples in infinitary rewriting with non-fully-extended rules. Inf. Process. Lett. 111(13): 642-646 (2011)
c8		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
j5		Jeroen Ketema, Jakob Grue Simonsen: Infinitary Combinatory Reduction Systems: Normalising Reduction Strategies. Logical Methods in Computer Science 6(1) (2010)
j4		Helle Hvid Hansen, Jeroen Ketema, Bas Luttik, Mohammad Reza Mousavi, Jaco van de Pol: Towards model checking executable UML specifications in mCRL2. ISSE 6(1-2): 83-90 (2010)
c7		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
c6		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
	2009
j3		Jeroen Ketema, Jakob Grue Simonsen: Infinitary Combinatory Reduction Systems: Confluence. Logical Methods in Computer Science 5(4) (2009)
c5		Jeroen Ketema: Comparing Böhm-Like Trees. RTA 2009: 239-254
	2008
c4		Jeroen Ketema: On Normalisation of Infinitary Combinatory Reduction Systems. RTA 2008: 172-186
	2005
j2		Jeroen Ketema: Some Undecidable Approximations of TRSs. Electr. Notes Theor. Comput. Sci. 124(2): 51-63 (2005)
j1		Jeroen Ketema, Jan Willem Klop, Vincent van Oostrom: Vicious Circles in Orthogonal Term Rewriting Systems. Electr. Notes Theor. Comput. Sci. 124(2): 65-77 (2005)
c3		Jeroen Ketema, Jakob Grue Simonsen: On Confluence of Infinitary Combinatory Reduction Systems. LPAR 2005: 199-214
c2		Jeroen Ketema, Jakob Grue Simonsen: Infinitary Combinatory Reduction Systems. RTA 2005: 438-452
	2004
c1		Jeroen Ketema: Böhm-Like Trees for Term Rewriting Systems. RTA 2004: 233-248

Coauthor Index

1	Takahito Aoto	[c10]
2	Supriyo Chatterjea	[c11]
3	Peter Collingbourne	[c13]
4	Alastair F. Donaldson	[c13]
5	Niels Bjørn Bugge Grathwohl	[c8]
6	Helle Hvid Hansen	[j4] [c6]
7	Paul J. M. Havinga	[c11]
8	Jan Willem Klop	[j1]
9	Bas Luttik (S. P. Luttik)	[j4] [c6]
10	Mohammad Reza Mousavi	[j4] [c6]
11	Vincent van Oostrom	[j1]
12	Jens Duelund Pallesen	[c8]
13	Jaco van de Pol	[j4] [c6]
14	Shaz Qadeer	[c13]
15	Osmar Marchi dos Santos	[c6]
16	Jakob Grue Simonsen	[c12] [j7] [c8] [j5] [c7] [j3] [c3] [c2]
17	Pouria Zand	[c11]

Colors in the list of coauthors

Last update Thu May 23 02:00:11 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page