DSpace at RU >

Search Results

Results 1-30 of 30.

Item hits:

Full Text	Issue Date	Title	Author(s)
	2012	A Proof Framework for Concurrent Programs	Lensink, L.; Smetsers, S.; Eekelen, M. van
	2012	A Proof Framework for Concurrent Programs	Lensink, L.; Smetsers, S.; Eekelen, M. van
	2012	Generating Verifiable Java Code from Verified PVS Specifications	Lensink, L.; Smetsers, S.; Eekelen, M. van
	2011	Formal Component-Based Semantics	Madlener, K.; Smetsers, S.; Eekelen, M. van
	2011	Deadlock and starvation free reentrant readers-writers: A case study combining model checking with theorem proving	Gastel, B.E. van; Lensink, L.; Smetsers, S.; Eekelen, M. van
	2010	The Syntactic Continuity Property: A computer verified proof	Smetsers, S.
	2010	A Formal Verification Study on the Rotterdam Storm Surge Barrier	Madlener, K.; Smetsers, S.; Eekelen, M. van
	2009	Preemption Abstraction: A Lightweight Approach to Modelling Concurrency	Schierboom, Erik; Tamalet, Alejandro; Tews, H.; Eekelen, Marko van; Smetsers, Sjaak; Alpuente, M.; Cook, B.
	2009	Reentrant Readers-Writers: A Case Study Combining Model Checking and Theorem Proving.	Gastel, Bernard van; Lensink, Leonard; Smetsers, Sjaak; Eekelen, Marko van; Cofer, D.; Fantechi, A.
	2008	Reentrant Readers--Writers: A Case Study Combining Model Checking and Theorem Proving	Gastel, Bernard van; Lensink, Leonard; Smetsers, Sjaak; Eekelen, Marko van
	2008	LaQuSo : Using Formal Methods for Analysis, Verification and Improvement of Safety Critical Software	Smetsers, J.E.W.; Eekelen, M.C.J.D. van
	2008	AHA: Amortized Heap Space Usage Analysis	Eekelen, M.C.J.D. van; Shkaravska, O.; Kesteren, R.H.C. van; Jacobs, B.; Poll, E.; Smetsers, S.; Morazan, Marco
	2008	Machine Checked Formal Proof of a Scheduling Protocol for Smartcard Personalization	Lensink, Leonard; Smetsers, Sjaak; Eekelen, Marko van; Merino, P.; Leue, S.
	2007	Code-carrying theories	Jacobs, B.P.F.; Smetsers, S.; Schreur, R. Wichers
	2007	Strictness Analysis via Resource Typing	Barendsen, E.; Smetsers, S.; Barendsen, Erik; Geuvers, Herman; Capretta, Venanzio; Niqui, Milad
	2007	AHA : Amortized Heap Space Usage Analysis	Eekelen, Marko van; Shkaravska, Olha; Kesteren, Ron van; Jacobs, Bart; Poll, Erik; Smetsers, Sjaak; Morazan, Marco T.; Nilsson, Henrik
	2006	Bracket Abstraction Preserves Typability - A formal proof of Diller-algorithm-C in PVS	Smetsers, Sjaak; Weelden, Arjen van; Levy, J.
	2006	Code-Carrying Theories	Jacobs, B.P.F.; Smetsers, Sjaak; Wichers Schreur, R.J.M.
	2005	A Generic Approach to Syntax Tree Operations	Weelden, A. van; Smetsers, J.E.W.; Plasmeijer, M.J.; Butterfield, A.; Grelck, C.; Huch, F.
	2005	There and Back Again : Arrows for Invertible Programming	Alimarine, A.; Smetsers, J.E.W.; Weelden, A. van; Eekelen, M.C.J.D. van; Plasmeijer, M.J.; Leijen, Daan
	2005	Improved Fusion for Optimizing Generics	Alimarine, A.; Smetsers, J.E.W.; Hermenegildo, Manuel; Cabeza, Daniel
	2005	Efficient Generic Functional Programming	Alimarine, A.; Smetsers, J.E.W.
	2004	Optimizing Generic Functions	Alimarine, A.; Smetsers, J.E.W.
	2004	Fusing Generic Functions	Alimarine, A.; Smetsers, J.E.W.
	1997	Graph rewriting semantics for functional programming languages	Eekelen, M. van; Smetsers, S.; Plasmeijer, R.
	1995	Uniqueness type inference	Barendsen, E.; Smetsers, S.
	1994	Guaranteeing safe destructive updates through a type system with uniqueness information for graphs	Smetsers, S.; Barendsen, E.; Eekelen, M.C.J.D. van; Plasmeijer, R.
	1991	Concurrent clean	Nöcker, E.G.J.M.H.; Smetsers, J.E.W.; Eekelen, M.C.J.D. van; Plasmeijer, M.J.
	1991	The Concurrent CLEAN System, functional programming on the Macintosh	Plasmeijer, M.J.; Eekelen, M.C.J.D. van; Nöcker, E.; Smetsers, S.
	1991	Parallel graph rewriting on loosely coupled machine architectures	Eekelen, M.C.J.D. van; Plasmeijer, M.J.; Smetsers, J.E.W.

1