default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOlaf Müller
Person information
Other persons with a similar name
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[c12]Thomas Rohde, Kolja Strauss, Gregor Alexander Benedikt, René Levens, Lina Haji, Olaf Müller:
Online kooperieren im Informatikunterricht. INFOS 2017: 363-372
2000 – 2009
- 2006
- [c11]Bastian Best, Olaf Müller, Herbert Negele:
Ein funktionales Domänenmodell Fahrerassistenz. GI Jahrestagung (1) 2006: 766-770 - 2002
- [c10]Olaf Müller, Michael Nüsken:
Never Trust Victor: An Alternative Resettable Zero-Knowledge Proof System. INDOCRYPT 2002: 79-92 - 2001
- [j3]Olaf Bonorden, Joachim von zur Gathen, Jürgen Gerhard, Olaf Müller:
Factoring a binary polynomial of degree over one million. SIGSAM Bull. 35(1): 16-18 (2001)
1990 – 1999
- 1999
- [j2]Olaf Müller, Tobias Nipkow
, David von Oheimb, Oscar Slotosch:
HOLCF=HOL+LCF. J. Funct. Program. 9(2): 191-223 (1999) - [c9]Bernd Grobauer, Olaf Müller:
From I/O Automata to Timed I/O Automata. TPHOLs 1999: 273-290 - 1998
- [b1]Olaf Müller:
A verification environment for I-O-automata based on formalized meta-theory. Technical University Munich, Germany, 1998, pp. 1-271 - [c8]Olaf Müller:
I/O Automata and Beyond: Temporal Logic and Abstraction in Isabelle. TPHOLs 1998: 331-348 - 1997
- [j1]Olaf Müller, Konrad Slind:
Treating Partiality in a Logic of Total Functions. Comput. J. 40(10): 640-652 (1997) - [c7]Thomas Stauner, Olaf Müller, Max Fuchs:
Using HYTECH to Verify an Automative Control System. HART 1997: 139-153 - [c6]Olaf Müller, Peter Scholz:
Functional Specification of Real-Time and Hybrid Systems. HART 1997: 273-285 - [c5]Robert Sandner, Olaf Müller:
Theorem Prover Support for the Refinement of Stream Processing Functions. TACAS 1997: 351-365 - [c4]Olaf Müller, Tobias Nipkow:
Traces of I/O-Automata in Isabelle/HOLCF. TAPSOFT 1997: 580-594 - [c3]Marco Devillers, W. O. David Griffioen, Olaf Müller:
Possibly Infinite Sequences in Theorem Provers: A Comparative Study. TPHOLs 1997: 89-104 - 1995
- [c2]Olaf Müller, Tobias Nipkow:
Combining Model Checking and Deduction for I/O-Automata. TACAS 1995: 1-16 - 1994
- [c1]Olaf Müller, Franz Weber:
Theory and Practice of Minimal Modular Higher-Order E-Unification. CADE 1994: 650-664
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:57 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
