Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Markus Müller-Olm
2010 – today
- 2013
[c33]Peter Lammich, Markus Müller-Olm, Helmut Seidl, Alexander Wenner: Contextual Locking for Dynamic Pushdown Networks. SAS 2013: 477-498
[i4]Benedikt Nordhoff, Markus Müller-Olm, Peter Lammich: Iterable Forward Reachability Analysis of Monitor-DPNs. CoRR abs/1309.5150 (2013)- 2011
[j8]Neil D. Jones, Markus Müller-Olm: Preface to a special section on verification, model checking, and abstract interpretation. STTT 13(6): 491-493 (2011)
[j7]Andrea Flexeder, Markus Müller-Olm, Michael Petter, Helmut Seidl: Fast interprocedural linear two-variable equalities. ACM Trans. Program. Lang. Syst. 33(6): 21 (2011)
[c32]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
[c31]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
[c30]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 (Eds.): 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- 2008
[c29]Markus Müller-Olm, Helmut Seidl: Upper Adjoints for Fast Inter-procedural Variable Equalities. ESOP 2008: 178-192
[c28]Peter Lammich, Markus Müller-Olm: Conflict Analysis of Programs with Procedures, Dynamic Thread Creation, and Monitors. SAS 2008: 205-220- 2007
[j6]Peter Lammich, Markus Müller-Olm: Formalization of Conflict Analysis of Programs with Procedures, Thread Creation, and Monitors. Archive of Formal Proofs 2007 (2007)
[j5]Markus Müller-Olm, Helmut Seidl: Analysis of modular arithmetic. ACM Trans. Program. Lang. Syst. 29(5) (2007)
[c27]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
[c26]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
[c25]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
[c24]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 (Eds.): 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- 2005
[c23]Ahmed Bouajjani, Markus Müller-Olm, Tayssir Touili: Regular Symbolic Analysis of Dynamic Networks of Pushdown Systems. CONCUR 2005: 473-487
[c22]Markus Müller-Olm, Helmut Seidl, Bernhard Steffen: Interprocedural Herbrand Equalities. ESOP 2005: 31-45
[c21]
[c20]Markus Müller-Olm, Helmut Seidl: A Generic Framework for Interprocedural Analysis of Numerical Properties. SAS 2005: 235-250
[c19]Markus Müller-Olm, Oliver Rüthing, Helmut Seidl: Checking Herbrand Equalities and Beyond. VMCAI 2005: 79-96- 2004
[j4]Markus Müller-Olm, Helmut Seidl: Computing polynomial program invariants. Inf. Process. Lett. 91(5): 233-244 (2004)
[j3]Markus Müller-Olm: Precise interprocedural dependence analysis of parallel programs. Theor. Comput. Sci. 311(1-3): 325-388 (2004)
[c18]
[c17]Markus Müller-Olm, Helmut Seidl: A Generic Framework for Interprocedural Analyses of Numerical Properties. LPAR 2004: 432-432
[c16]Markus Müller-Olm, Helmut Seidl: Precise interprocedural analysis through linear algebra. POPL 2004: 330-341
[c15]Markus Müller-Olm, Haiseung Yoo: MetaGame: An Animation Tool for Model-Checking Games. TACAS 2004: 163-167- 2003
[j2]Markus Müller-Olm, Helmut Seidl: (Linear) Algebra for Program Analysis Dynamische Programmanalyse. Softwaretechnik-Trends 23(2) (2003)
[c14]Rudolf Berghammer, Markus Müller-Olm: Formal Development and Verification of Approximation Algorithms Using Auxiliary Variables. LOPSTR 2003: 59-74- 2002
[c13]
[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
[c12]
[c11]Markus Müller-Olm: The Complexity of Copy Constant Detection in Parallel Programs. STACS 2001: 490-501
[c10]- 2000
[c9]Markus Müller-Olm, Andreas Wolf: On the Translation of Procedures to Finite Machines. ESOP 2000: 290-304
1990 – 1999
- 1999
[c8]Martin Fränzle, Markus Müller-Olm: Compilation and Synthesis for Real-Time Embedded Controllers. Correct System Design 1999: 256-287
[c7]Markus Müller-Olm, Bernhard Steffen, Rance Cleaveland: On the Evolution of Reactive Components: A Process-Algebraic Approach. FASE 1999: 161-175
[c6]Markus Müller-Olm, Andreas Wolf: On Excusable and Inexcusable Failures. World Congress on Formal Methods 1999: 1107-1127
[c5]Markus Müller-Olm, David A. Schmidt, Bernhard Steffen: Model-Checking: A Tutorial Introduction. SAS 1999: 330-354
[c4]- 1998
[j1]Markus Müller-Olm: Derivation of Characteristic Formulae. Electr. Notes Theor. Comput. Sci. 18: 159-170 (1998)- 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
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-17 21:26 CEST by the dblp team



