The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Olaf Müller: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Olaf Müller, Franz Weber
    Theory and Practice of Minimal Modular Higher-Order E-Unification. [Citation Graph (0, 0)][DBLP]
    CADE, 1994, pp:650-664 [Conf]
  2. Bastian Best, Olaf Müller, Herbert Negele
    Ein funktionales Domänenmodell Fahrerassistenz. [Citation Graph (0, 0)][DBLP]
    GI Jahrestagung (1), 2006, pp:766-0 [Conf]
  3. Olaf Müller, Peter Scholz
    Functional Specification of Real-Time and Hybrid Systems. [Citation Graph (0, 0)][DBLP]
    HART, 1997, pp:273-285 [Conf]
  4. Thomas Stauner, Olaf Müller, Max Fuchs
    Using HYTECH to Verify an Automative Control System. [Citation Graph (0, 0)][DBLP]
    HART, 1997, pp:139-153 [Conf]
  5. Olaf Müller, Michael Nüsken
    Never Trust Victor: An Alternative Resettable Zero-Knowledge Proof System. [Citation Graph (0, 0)][DBLP]
    INDOCRYPT, 2002, pp:79-92 [Conf]
  6. Olaf Müller, Tobias Nipkow
    Combining Model Checking and Deduction for I/O-Automata. [Citation Graph (0, 0)][DBLP]
    TACAS, 1995, pp:1-16 [Conf]
  7. Robert Sandner, Olaf Müller
    Theorem Prover Support for the Refinement of Stream Processing Functions. [Citation Graph (0, 0)][DBLP]
    TACAS, 1997, pp:351-365 [Conf]
  8. Olaf Müller, Tobias Nipkow
    Traces of I/O-Automata in Isabelle/HOLCF. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1997, pp:580-594 [Conf]
  9. Marco Devillers, W. O. David Griffioen, Olaf Müller
    Possibly Infinite Sequences in Theorem Provers: A Comparative Study. [Citation Graph (0, 0)][DBLP]
    TPHOLs, 1997, pp:89-104 [Conf]
  10. Bernd Grobauer, Olaf Müller
    From I/O Automata to Timed I/O Automata. [Citation Graph (0, 0)][DBLP]
    TPHOLs, 1999, pp:273-290 [Conf]
  11. Olaf Müller
    I/O Automata and Beyond: Temporal Logic and Abstraction in Isabelle. [Citation Graph (0, 0)][DBLP]
    TPHOLs, 1998, pp:331-348 [Conf]
  12. Olaf Müller, Konrad Slind
    Treating Partiality in a Logic of Total Functions. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1997, v:40, n:10, pp:640-652 [Journal]
  13. Olaf Müller, Tobias Nipkow, David von Oheimb, Oscar Slotosch
    HOLCF=HOL+LCF. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 1999, v:9, n:2, pp:191-223 [Journal]

Search in 0.003secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002