I am a Lecturer in Computer Science at Åbo Akademi University. Before taking up this post, I was a Postdoctoral Research Fellow in the Department of Philosophy at Uppsala University, Sweden, where I worked on my international postdoc project "Rush Rhees and Wittgenstein's Philosophy of Mathematics" as a Visiting Academic at The von Wright and Wittgenstein Archives at The University of Helsinki, Finland. My project was funded by the Swedish Research Council (Vetenskapsrådet).
Previously, I was a Senior Lecturer in Computer Science at Gotland University College (today Uppsala University's Campus Gotland), where I took part in the creation of a unique Great Books course for a new Liberal Arts degree. I was also a Research Fellow in Theoretical Computer Science at The University of Queensland at several occasions. I have been a Visiting Academic at Universität Augsburg, Universität Göttingen, and at Macquarie University in Sydney.
I have a PhD in Philosophy from Uppsala University, Sweden, and a PhD in Theoretical Computer Science from Åbo Akademi, Finland.
Doctor of Philosophy, Uppsala University
Doctor of Philosophy, Åbo Akademi University
Solin, Kim and Wright, Joakim von, Enabledness and Termination in Refinement Algebra. In: Science of Computer Programming. 2007 2 |
Meinicke, Larissa and Solin, Kim, Refinement Algebra for Probabilistic Programs. In: Electronic Notes in Theoretical Computer Science, Proceedings of the BCS-FACS Refinement Workshop (REFINE 2007) . Elsevier, 2008 |
Meinicke, Larissa and Solin, Kim, Reactive Probabilistic Programs and Refinement Algebra. In: Relations and Kleene Algebra in Computer Science. R. Berghammer, B. Möller, and G. Struth (Eds.). LNCS Springer-Verlag, 2008 |
Solin, Kim, A Sketch of a Dynamic Epistemic Semiring. In: Logic, Language, Information and Computation, 14th International Workshop. Daniel Leivant, Ruy J. G. B. de Queiroz (Eds.). LNCS Springer, 2007 |
Solin, Kim and Wright, Joakim von, Refinement Algebra with Operators for Enabledness and Termination. In: Mathematics of Program Construction, 8th International Conference, MPC 2006. Lecture Notes in Computer Science Springer, 2006 1 |
Solin, Kim, On Two Dually Nondeterministic Refinement Algebras. In: Relations and Kleene Algebra in Computer Science. Lecture Notes in Computer Science Springer, 2006 1 |
Höfner, Peter and Möller, Bernhard and Solin, Kim, Omega Algebra, Demonic Refinement Algebra and Commands. In: Relations and Kleene Algebra in Computer Science. Lecture Notes in Computer Science Springer, 2006 1 |
Solin, Kim, An Outline of a Dually Nondeterministic Refinement Algebra with Negation. In: CALCO Young Researchers Workshop 2005. Selected Papers. Peter Mosses, John Power, and Monika Seisenberger (Eds.). Univ. of Wales, Swansea Report Series CSR 18-2005. Univ. of Wales, Swansea, 2005 |
Solin, Kim and Wright, Joakim von, Demonic Refinement Algebra with Domain. In: Proceedings of the 15th Nordic Workshop on Programming Theory . K. Sere and M. Waldén (Eds.). Reports on Computer Science and Mathematics, Ser. B 34. 2003 |
Solin, Kim, Abstract Algebra of Program Refinement. TUCS Dissertations 95. Turku Centre for Computer Science, 2007 |
Meinicke, Larissa and Solin, Kim, Probabilistic Demonic Refinement Algebra. 2006 |
Solin, Kim, On Two Dually Nondeterministic Refinement Algebras. 2006 |
Solin, Kim, Dynamic Epistemic Semirings. 2006 |
Höfner, Peter and Möller, Bernhard and Solin, Kim, Omega Algebra, Demonic Refinement Algebra and Commands. 2006 |
Solin, Kim and Wright, Joakim von, Refinement Algebra Extended with Operators for Enabledness and Termination. TUCS Technical Report 658. Turku Centre for Computer Science, 2005 |