2002 |
14 | | Thomas Arts,
Markus Mohnen:
Implementation of Functional Languages, 13th International Workshop, IFL 2002 Stockholm, Sweden, September 24-26, 2001, Selected Papers
Springer 2002 |
13 | EE | Markus Mohnen:
A Graph-Free Approach to Data-Flow Analysis.
CC 2002: 46-61 |
12 | EE | Markus Mohnen:
An open framework for data-flow analysis in Java: extended abstract.
PPPJ/IRE 2002: 157-161 |
11 | EE | Markus Mohnen:
Interfaces with default implementations in Java.
PPPJ/IRE 2002: 35-40 |
2001 |
10 | | Markus Mohnen,
Pieter W. M. Koopman:
Implementation of Functional Languages, 12th International Workshop, IFL 2000, Aachen, Germany, September 4-7, 2000, Selected Papers
Springer 2001 |
2000 |
9 | EE | Jörg Köller,
Markus Mohnen:
Efficient abstract interpretation using component-wise homomorphisms.
PPDP 2000: 226-234 |
1999 |
8 | | Markus Mohnen:
Fixed Points in Metrified Quasi Ordered Sets: Modelling Escaping in Functional Programs.
GI Jahrestagung 1999: 360-369 |
7 | EE | Jörg Köller,
Markus Mohnen:
A New Class of Functions for Abstract Interpretation.
SAS 1999: 248-263 |
1997 |
6 | | Markus Mohnen:
Using Quasi Ordered Sets to Model Program Properties Denotationally.
GI Jahrestagung 1997: 532-541 |
5 | EE | Markus Mohnen:
Context Patterns, Part II.
Implementation of Functional Languages 1997: 338-357 |
4 | | Markus Mohnen:
A Compiler Correctness Proof for the Static Link Technique by Means of Evolving Algebras.
Fundam. Inform. 29(3): 257-303 (1997) |
1996 |
3 | | Markus Mohnen:
Context Patterns in Haskell.
Implementation of Functional Languages 1996: 41-57 |
1995 |
2 | | Markus Mohnen:
Efficient Compile-Time Garbage Collection for Arbitrary Data Structures
PLILP 1995: 241-258 |
1 | | Markus Mohnen:
Efficient Closure Utilisation by Higher-Order Inheritance Analysis
SAS 1995: 261-278 |