Publications

Refereed

• HOA'95: A complete proofsystem for nested term graphs. (extended abstract, full version)
• TACS'97: Cyclic Lambda Calculi. ( full version)
• S.C.C. Blom, W.J. Fokkink, J.F. Groote, I.A. van Langevelde, B. Lisser and J.C. van de Pol, µCRL: a toolset for analysing algebraic specifications, in Proc. 13th Conference on Computer Aided Verification - CAV'2001, Paris, Lecture Notes in Computer Science, Springer-Verlag (July 2001), to appear.  (PDF text, PS text)
• Stefan Blom and Jaco van de Pol, State space reduction by proving confluence. In E. Brinksma and K.G. Larsen, editors, Computer Aided Verification: 14th International Conference, CAV 2002 Copenhagen, Denmark, July 2002 Proceedings, volume 2404 of LNCS,Springer Verlag, 2002.
• Stefan Blom and Simona Orzan, A Distributed Algorithm for Strong Bisimulation Reduction of State Spaces, Electronic Notes in Theoretical Computer Science, Vol. 68 (4) (2002)
• Zena M. Ariola and Stefan Blom. Skew confluence and the lambda calculus with letrec. Annals of Pure and Applied Logic, 117(1-3):95-168, october 2002.
• S.C.C. Blom, W.J. Fokkink, and S. Nain. On the axiomatizability of ready traces, ready simulation and failure traces. In Jos C. M. Baeten, Jan Karel Lenstra, Joachim Parrow, and Gerhard J. Woeginger, editors, Proc. 30th Colloquium on Automata, Languages and Programming - ICALP'03, Eindhoven, volume 2719 of Lecture Notes in Computer Science, pages 109-118. Springer, 2003.
• Stefan Blom and Simona Orzan. Distributed state space minimization. In Thomas Arts and Wan Fokkink, editors, Eighth International Workshop onFormal Methods for Industrial Critical Systems (FMICS'03), volume 80 of Electronic Notes in Theoretical Computer Science. Elsevier, 2003.
• Stefan Blom, Natalia Ioustinova, and Natalia Sidorova. Timed verification with µCRL. In M. Broy and A.V. Zamulin, editors, Perspectives of System Informatics, volume 2890 of Lecture Notes in Computer Science, pages 178-192. Springer-Verlag Heidelberg, 2003.
• Stefan Blom and Simona Orzan. Distributed branching bisimulation reduction of state spaces. In Lubos Brim and Orna Grumberg, editors, PDMC 2003: Parallel and Distributed Model Checking, volume 89 of Electronic Notes in Theoretical Computer Science. Elsevier, 2003.
• Stefan Blom, Izak van Langevelde, and Bert Lisser. Compressed and distributed file formats for labeled transition systems. In Lubos Brim and Orna Grumberg, editors, PDMC 2003: Parallel and Distributed Model Checking , volume 89 of Electronic Notes in Theoretical Computer Science. Elsevier, 2003.

Other

• 1994: Masters thesis:  Proof Systems for Nested Term Graphs. (full version)
• 1997: Z. M. Ariola and S. Blom,  Lambda Calculi plus Letrec, technical report IR-434 Department of Mathematics and Computer Science Vrije Universiteit Amsterdam. (Also appearad as technical report CIS-TR-97-05, Department of Computer and Information Science, University of Oregon.)
• 2001: PhD thesis: Term Graph Rewriting - syntax and semantics. (PDF text, PS text, PDF cover, EPS cover)
• S.Blom, Partial tau-confluence for efficient state space generation, report SEN-R0123, CWI, Amsterdam (2001). (PDF text , PS text)
• Lifting Infinite Normal Form Definitions from Term Rewriting to Term Graph Rewriting, Stefan Blom, CWI report SEN-R0225.
• Stefan Blom, Jan Friso Groote, Izak van Langevelde, Bert Lisser, and Jaco van de Pol. New developments around the µCRL tool set. In Thomas Arts and Wan Fokkink, editors, Electronic Notes in Theoretical Computer Science , volume 80. Elsevier, 2003.
• Stefan Blom and Simona Orzan. Distributed reduction of large state spaces. Fourth PROGRESS seminar on Embedded Systems, poster session, 2003.