default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarkus Müller-Olm
Person information
- affiliation: University of Münster, Institute of Computer Science
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j10]Jens Oliver Gutsfeld
, Markus Müller-Olm, Christoph Ohrem:
Deciding Asynchronous Hyperproperties for Recursive Programs. Proc. ACM Program. Lang. 8(POPL): 33-60 (2024)- [c38]Roman Lakenbrink, Markus Müller-Olm, Christoph Ohrem, Jens Oliver Gutsfeld:
A Navigation Logic for Recursive Programs with Dynamic Thread Creation. VMCAI (2) 2024: 48-70 - 2023
- [j9]Jens Oliver Gutsfeld, Markus Müller-Olm, Christian Dielitz:
Temporal logics with language parameters. Inf. Comput. 295(Part A): 105087 (2023) - [i10]Roman Lakenbrink, Markus Müller-Olm, Christoph Ohrem, Jens Oliver Gutsfeld:
A Navigation Logic for Recursive Programs with Dynamic Thread Creation. CoRR abs/2310.19579 (2023) - 2022
- [i9]Jens Oliver Gutsfeld, Markus Müller-Olm, Christoph Ohrem:
Deciding Asynchronous Hyperproperties for Recursive Programs. CoRR abs/2201.12859 (2022) - 2021
- [j8]Jens Oliver Gutsfeld, Markus Müller-Olm, Christoph Ohrem:
Automata and fixpoints for asynchronous hyperproperties. Proc. ACM Program. Lang. 5(POPL): 1-29 (2021) - [c37]Jens Oliver Gutsfeld, Markus Müller-Olm, Christian Dielitz:
Temporal Logics with Language Parameters. LATA 2021: 187-199 - 2020
- [c36]Jens Oliver Gutsfeld, Markus Müller-Olm, Christoph Ohrem:
Propositional Dynamic Logic for Hyperproperties. CONCUR 2020: 50:1-50:22 - [i8]Jens Oliver Gutsfeld, Markus Müller-Olm, Christoph Ohrem:
Automata and Fixpoints for Asynchronous Hyperproperties. CoRR abs/2010.11605 (2020)
2010 – 2019
- 2019
- [i7]Jens Oliver Gutsfeld, Markus Müller-Olm, Christoph Ohrem:
Propositional Dynamic Logic for Hyperproperties. CoRR abs/1910.10546 (2019) - [i6]Jens Oliver Gutsfeld, Markus Müller-Olm, Christian Dielitz:
Temporal Logics with Language Parameters. CoRR abs/1910.11594 (2019) - 2018
- [c35]Jens Oliver Gutsfeld, Markus Müller-Olm, Benedikt Nordhoff:
A Branching Time Variant of CaRet. SPIN 2018: 153-170 - [e4]Xinyu Feng, Markus Müller-Olm, Zijiang Yang:
Dependable Software Engineering. Theories, Tools, and Applications - 4th International Symposium, SETTA 2018, Beijing, China, September 4-6, 2018, Proceedings. Lecture Notes in Computer Science 10998, Springer 2018, ISBN 978-3-319-99932-6 [contents] - 2015
- [c34]Heiko Mantel, Markus Müller-Olm, Matthias Perner, Alexander Wenner:
Using Dynamic Pushdown Networks to Automate a Modular Information-Flow Analysis. LOPSTR 2015: 201-217 - 2014
- [e3]Markus Müller-Olm, Helmut Seidl:
Static Analysis - 21st International Symposium, SAS 2014, Munich, Germany, September 11-13, 2014. Proceedings. Lecture Notes in Computer Science 8723, Springer 2014, ISBN 978-3-319-10935-0 [contents] - 2013
- [c33]Peter Lammich, Markus Müller-Olm, Helmut Seidl, Alexander Wenner:
Contextual Locking for Dynamic Pushdown Networks. SAS 2013: 477-498 - [c32]Benedikt Nordhoff, Markus Müller-Olm, Peter Lammich:
Iterable Forward Reachability Analysis of Monitor-DPNs. Festschrift for Dave Schmidt 2013: 384-403 - 2011
- [j7]Neil D. Jones, Markus Müller-Olm:
Preface to a special section on verification, model checking, and abstract interpretation. Int. J. Softw. Tools Technol. Transf. 13(6): 491-493 (2011) - [j6]Andrea Flexeder, Markus Müller-Olm, Michael Petter, Helmut Seidl:
Fast interprocedural linear two-variable equalities. ACM Trans. Program. Lang. Syst. 33(6): 21:1-21:33 (2011) - [c31]Martin D. Schwarz, Helmut Seidl, Vesal Vojdani, Peter Lammich, Markus Müller-Olm:
Static analysis of interrupt-driven programs synchronized via the priority ceiling protocol. POPL 2011: 93-104 - [c30]Thomas Martin Gawlitza, Peter Lammich, Markus Müller-Olm, Helmut Seidl, Alexander Wenner:
Join-Lock-Sensitive Forward Reachability Analysis for Concurrent Programs with Dynamic Process Creation. VMCAI 2011: 199-213
2000 – 2009
- 2009
- [c29]Peter Lammich, Markus Müller-Olm, Alexander Wenner:
Predecessor Sets of Dynamic Pushdown Networks with Tree-Regular Constraints. CAV 2009: 525-539 - [e2]Neil D. Jones, Markus Müller-Olm:
Verification, Model Checking, and Abstract Interpretation, 10th International Conference, VMCAI 2009, Savannah, GA, USA, January 18-20, 2009. Proceedings. Lecture Notes in Computer Science 5403, Springer 2009, ISBN 978-3-540-93899-6 [contents] - 2008
- [c28]Markus Müller-Olm, Helmut Seidl:
Upper Adjoints for Fast Inter-procedural Variable Equalities. ESOP 2008: 178-192 - [c27]Peter Lammich, Markus Müller-Olm:
Conflict Analysis of Programs with Procedures, Dynamic Thread Creation, and Monitors. SAS 2008: 205-220 - 2007
- [j5]Peter Lammich, Markus Müller-Olm:
Formalization of Conflict Analysis of Programs with Procedures, Thread Creation, and Monitors. Arch. Formal Proofs 2007 (2007) - [j4]Markus Müller-Olm, Helmut Seidl:
Analysis of modular arithmetic. ACM Trans. Program. Lang. Syst. 29(5): 29 (2007) - [c26]Peter Lammich, Markus Müller-Olm:
Precise Fixpoint-Based Analysis of Programs with Thread-Creation and Procedures. CONCUR 2007: 287-302 - 2006
- [b2]Markus Müller-Olm:
Variations on Constants - Flow Analysis of Sequential and Parallel Programs. Lecture Notes in Computer Science 3800, Springer 2006, ISBN 978-3-540-45385-7 - [c25]Markus Müller-Olm, Michael Petter, Helmut Seidl:
Interprocedurally Analyzing Polynomial Identities. STACS 2006: 50-67 - [e1]Parosh Aziz Abdulla, Ahmed Bouajjani, Markus Müller-Olm:
Software Verification: Infinite-State Model Checking and Static Program Analysis, 19.02. - 24.02.2006. Dagstuhl Seminar Proceedings 06081, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2006 [contents] - [i5]Parosh Aziz Abdulla, Ahmed Bouajjani, Markus Müller-Olm:
06081 Executive Summary -- Software Verification: Infinite-State Model Checking and Static Program Analysis. Software Verification: Infinite-State Model Checking and Static Program Analysis 2006 - [i4]Parosh Aziz Abdulla, Ahmed Bouajjani, Markus Müller-Olm:
06081 Abstracts Collection -- Software Verification: Infinite-State Model Checking and Static Program Analysis. Software Verification: Infinite-State Model Checking and Static Program Analysis 2006 - 2005
- [c24]Ahmed Bouajjani, Markus Müller-Olm, Tayssir Touili:
Regular Symbolic Analysis of Dynamic Networks of Pushdown Systems. CONCUR 2005: 473-487 - [c23]Markus Müller-Olm, Helmut Seidl, Bernhard Steffen:
Interprocedural Herbrand Equalities. ESOP 2005: 31-45 - [c22]Markus Müller-Olm, Helmut Seidl:
Analysis of Modular Arithmetic. ESOP 2005: 46-60 - [c21]Markus Müller-Olm, Helmut Seidl:
A Generic Framework for Interprocedural Analysis of Numerical Properties. SAS 2005: 235-250 - [c20]Markus Müller-Olm, Oliver Rüthing, Helmut Seidl:
Checking Herbrand Equalities and Beyond. VMCAI 2005: 79-96 - 2004
- [j3]Markus Müller-Olm, Helmut Seidl:
Computing polynomial program invariants. Inf. Process. Lett. 91(5): 233-244 (2004) - [j2]Markus Müller-Olm:
Precise interprocedural dependence analysis of parallel programs. Theor. Comput. Sci. 311(1-3): 325-388 (2004) - [c19]Markus Müller-Olm, Helmut Seidl:
A Note on Karr's Algorithm. ICALP 2004: 1016-1028 - [c18]Markus Müller-Olm, Helmut Seidl:
A Generic Framework for Interprocedural Analyses of Numerical Properties. LPAR 2004: 432-432 - [c17]Markus Müller-Olm, Helmut Seidl:
Precise interprocedural analysis through linear algebra. POPL 2004: 330-341 - [c16]Markus Müller-Olm, Haiseung Yoo:
MetaGame: An Animation Tool for Model-Checking Games. TACAS 2004: 163-167 - 2003
- [j1]Markus Müller-Olm, Helmut Seidl:
(Linear) Algebra for Program Analysis Dynamische Programmanalyse. Softwaretechnik-Trends 23(2) (2003) - [c15]Rudolf Berghammer, Markus Müller-Olm:
Formal Development and Verification of Approximation Algorithms Using Auxiliary Variables. LOPSTR 2003: 59-74 - 2002
- [c14]Markus Müller-Olm, Helmut Seidl:
Polynomial Constants Are Decidable. SAS 2002: 4-19 - [i3]Markus Müller-Olm:
Precise Interprocedural Dependence Analysis of Parallel Programs. Universität Trier, Mathematik/Informatik, Forschungsbericht 02-08 (2002) - [i2]Markus Müller-Olm, Helmut Seidl:
Polynomial Constants are Decidable. Universität Trier, Mathematik/Informatik, Forschungsbericht 02-09 (2002) - [i1]Helmut Seidl, Varmo Vene, Markus Müller-Olm:
Interprocedural Invariants. Universität Trier, Mathematik/Informatik, Forschungsbericht 02-10 (2002) - 2001
- [c13]Markus Müller-Olm, Oliver Rüthing:
On the Complexity of Constant Propagation. ESOP 2001: 190-205 - [c12]Markus Müller-Olm:
The Complexity of Copy Constant Detection in Parallel Programs. STACS 2001: 490-501 - [c11]Markus Müller-Olm, Helmut Seidl:
On optimal slicing of parallel programs. STOC 2001: 647-656 - 2000
- [c10]Markus Müller-Olm, Andreas Wolf:
On the Translation of Procedures to Finite Machines. ESOP 2000: 290-304
1990 – 1999
- 1999
- [c9]Martin Fränzle, Markus Müller-Olm:
Compilation and Synthesis for Real-Time Embedded Controllers. Correct System Design 1999: 256-287 - [c8]Markus Müller-Olm, Bernhard Steffen, Rance Cleaveland:
On the Evolution of Reactive Components: A Process-Algebraic Approach. FASE 1999: 161-175 - [c7]Markus Müller-Olm, Andreas Wolf:
On Excusable and Inexcusable Failures. World Congress on Formal Methods 1999: 1107-1127 - [c6]Markus Müller-Olm, David A. Schmidt, Bernhard Steffen:
Model-Checking: A Tutorial Introduction. SAS 1999: 330-354 - [c5]Markus Müller-Olm:
A Modal Fixpoint Logic with Chop. STACS 1999: 510-520 - 1998
- [c4]Markus Müller-Olm:
Derivation of Characteristic Formulae. MFCS Workshop on Concurrency 1998: 159-170 - 1997
- [b1]Markus Müller-Olm:
Modular Compiler Verification - A Refinement-Algebraic Approach Advocating Stepwise Abstraction. Lecture Notes in Computer Science 1283, Springer 1997, ISBN 3-540-63406-1 - 1994
- [c3]Martin Fränzle, Markus Müller-Olm:
Towards Provably Correct Code Gneration for a Hard Real-Time Programming Language. CC 1994: 294-308 - [c2]Jifeng He, C. A. R. Hoare, Martin Fränzle, Markus Müller-Olm, Ernst-Rüdiger Olderog, Michael Schenke, Michael R. Hansen, Anders P. Ravn, Hans Rischel:
Provably Correct Systems. FTRTFT 1994: 288-335 - 1992
- [c1]Bettina Buth, Karl-Heinz Buth, Martin Fränzle, Burghard von Karger, Yassine Lakhnech, Hans Langmaack, Markus Müller-Olm:
Provably Correct Compiler Development and Implementation. CC 1992: 141-155
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 2025-04-04 23:29 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:
