Olaf Müller

A Verification Environment for I / O Automata – Part I : Temporal Logic and Abstraction –

Olaf Müller, 1999 .

Treating Partiality in a Logic of Total Functions

Konrad Slind, Olaf Müller, Konrad Slind, 1997, Comput. J..

HOLCF = HOL + LCF

Tobias Nipkow, Oscar Slotosch, David von Oheimb, 1999, Journal of Functional Programming.

Combining Model Checking and Deduction for I/O-Automata

Tobias Nipkow, Olaf Müller, T. Nipkow, 1995, TACAS.

Factoring a binary polynomial of degree over one million

Olaf Bonorden, Joachim von zur Gathen, Olaf Müller, 2001, SIGS.

I/O Automata and Beyond: Temporal Logic and Abstraction in Isabelle

Olaf Müller, Olaf Müller, 1998, TPHOLs.

A verification environment for I-O-automata based on formalized meta-theory

Olaf Müller, Olaf Müller, 1998 .