Efficient Compile-Time Garbage Collection for Arbitrary Data Structures - Markus Mohnen (PLILP, 1995)

Efficient Closure Utilisation by Higher-Order Inheritance Analysis - Markus Mohnen (SAS, 1995)

Context Patterns in Haskell. - Markus Mohnen (Implementation of Functional Languages, 1996)

Using Quasi Ordered Sets to Model Program Properties Denotationally. - Markus Mohnen (GI Jahrestagung, 1997)

Context Patterns, Part II. - Markus Mohnen (Implementation of Functional Languages, 1997)

A Compiler Correctness Proof for the Static Link Technique by Means of Evolving Algebras. - Markus Mohnen (Fundam. Informaticae, 1997)

Optimising the memory management of higher order functional programs. - Markus Mohnen (1997)

Fixed Points in Metrified Quasi Ordered Sets: Modelling Escaping in Functional Programs. - Markus Mohnen (GI Jahrestagung, 1999)

A New Class of Functions for Abstract Interpretation. - Jörg Köller; Markus Mohnen (SAS, 1999)

Efficient abstract interpretation using component-wise homomorphisms. - Jörg Köller; Markus Mohnen (PPDP, 2000)

A Graph-Free Approach to Data-Flow Analysis. - Markus Mohnen (CC, 2002)

Interfaces with default implementations in Java. - Markus Mohnen (PPPJ/IRE, 2002)

An open framework for data-flow analysis in Java: extended abstract. - Markus Mohnen (PPPJ/IRE, 2002)