Karl Palmskog Graduate Student, Theoretical Computer Science School of Computer Science and Communication palmskog@kth.se +46 7 020 47040 (cell) +46 8 790 6809 (office) Lindstedtsvägen 3, level 4, room 1443 SE-100 44 Stockholm, Sweden I am interested in proving correctness and security properties of distributed algorithms, in particular using proof assistants. My advisor is Mads Dam.

(This is a personal website)

Teaching Activities

• DD2495 Network Security (Spring 2011, Period 4)
• DD2385 Software Engineering (Spring 2011, Period 4)
• DD2440 Advanced Algorithms (Fall 2010, Period 1-2; Fall 2009, Period 1-2)
• DD2387 Program System Construction Using C++ (Fall 2010, Period 1-2; Fall 2009, Period 1-2)
• DD1350 Logic for Computer Science (Fall 2010, Period 1-2; Spring 2009, Period 4)
• DD2488 Compiler Construction (Spring 2010, Period 3-4)
• DD1352 Algorithms, Data Structures and Complexity (Spring 2010, Period 3-4)
• DN1240 Numerical Methods, Basic Course II (Spring 2010, Period 3-4)

Publications

• K. Palmskog, A. Gonzalez Prieto, C. Meirosu, R. Stadler and Mads Dam. Scalable Metadata-Directed Search in a Network of Information. In Proceedings of Future Network & Mobile Summit, June 2010.
• Y. Ismailov, K. Palmskog, M. Widell, P. Arvidsson, and Y. Wang. Session Layer Resurgence: Towards Mobile, Disconnection- and Delay-Tolerant Communication. In Proceedings of the 4th European Conference on Universal Multiservice Networks (ECUMN'07), pages 337-345, February 2007.
• K. Palmskog. Verification of the Session Management Protocol. Master's thesis, School of Computer Science and Communication, KTH, Nov. 2006. TRITA-CSC-E 2006:149, ISSN 1653-5715. (website)

Links

• My CV
• Slides from my lecture on adversary models in Network Security
• Code from exercise 6 in Software Engineering
• Exercises on structural induction with answers, in Swedish
• Some principles of induction with examples
• Stefan Arnborg's opinions on unreadable email, which I share