My academic publications

Articles and abstracts

1. On Process-Algebraic Proof Methods for Fault Tolerant Distributed Systems.Morten Kühnrich, Uwe Nestmann. Formal Techniques for Distributed Systems, Joint 11th IFIP WG 6.1 International Conference FMOODS 2009 and 29th IFIP WG 6.1 International Conference FORTE 2009, Lisboa, Portugal, June 9-12, 2009.
   Springer Link
2. Interprocedural Dataflow Analysis over Weight Domains with Infinite Descending Chains. Morten Kühnrich, Stefan Schwoon, Jiri Srba and Stefan Kiefer. Foundations of Software Science and Computational Structures, 12th International Conference, FOSSACS 2009, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009, York, UK, March 22-29, 2009. Springer Link
3. Formal Model--Driven Design of Distributed Algorithms (Extended version). Morten Kühnrich. Annual Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS08). Znojmo, Czechia, November 14-16. 2008
   long version pdf
   UPPAAL code in zip format
4. Verification of Correspondence Assertions in a Calculus for Mobile Ad Hoc Networks. Morten Kühnrich, Hans Hüttel and Jens Chr. Godskesen. FOCLASA'08. Reykjavík, Iceland, July 13th, 2008. pdf
   
5. A Distributed-Pi Calculus with anonymous moves. Hans Hüttel, Jens Chr. Godskesen and Morten Kühnrich. The 18th Nordic Workshop on Programming Theory (NWPT'06) Reykjavík, Iceland, 18-20 October. 2006 pdf
6. Authentication and Sandboxing in a Distributed Pi-Calculus. Hans Hüttel and Morten Kühnrich. Procedings of the 6th International Workshop on Issues in the Theory of Security, WITS '06, Vienna, March. ENTCS. 2006 pdf
7. Types for Access Control in a Calculus of Mobile Resources . Hans Hüttel and Morten Kühnrich. Procedings of the 3rd International Workshop on Security Issues in Concurrency, SecCo'05, San Francisco, August. ENTCS 2005. pdf

Theses

1. PhD thesis. Approaches to Formal Verification: Type Theory, Model Checking, and Process Algebra". Aalborg University 2011. pdf
2. Master thesis. Process calculi for access control with authentication. Aalborg University 2005. pdf
3. Bachelor thesis. Ufuldstændighed af generelle slutningssystemer. Copenhagen University, DIKU 2003 pdf

Technical reports

1. Tecnical report. A type system for the calculus of mobile resources. Aalborg university 2004. pdf
   Moscow ML implementation of the MR-typechecker
2. Tecnical report. Completion of a proof by Mairson of a theorem of Statman. Copenhagen University, DIKU 2004 pdf
3. Tecnical report. Size Change Analysis of a Small C-like Language. Copenhagen University, DIKU 2003 pdf Moscow ML implementation of the termination analysator

Association Versus Compositional Aggregation

It seems rather hard to find a one-sheet paper that describes the relationship between association and compositional aggregation that includes both UML diagrams and code. This is why I have decided to make one. Recall that an object A is associated to an object B, if A contains an object reference to B. References to B may exist outside A.

If A compositionally aggregates B then A is associated to B and furthermore if A is destroyed, so is B. We see that compositional aggregation puts an additional requirement on the references in question.