Steffen Märcker

About

I am a research fellow in the office of the chair for Algebraic and Logical Foundations of Computer Science headed by Prof. Dr. Christel Baier and part of the Faculty of Computer Science at the TU Dresden. In 2010, I graduated in computer science from the University of Leipzig. Until I joined the chair’s office in January 2012, I worked as a professional programmer at the University of Leipzig’s Institute for Applied Informatics (InfAI) e.V. My primary research interests are probabilistic model checking, formal verification, logics, automata and formal languages.

Publications

2020

• Quantitative Characterization of Reconfigurable Transistor Logic Gates
  M. Raitza, S. Märcker, J. Trommer, A. Heinzig, S. Klüppelholz, C. Baier, A. Kumar
  In: IEEE Access, volume 8, 2020

2018

• Decision making improves sperm chemotaxis in the presence of noise
  J. A. Kromer, S. Märcker, S. Lange, C. Baier, B. M. Friedrich
  In: PLOS Computational Biology, 2018
• Advances in probabilistic model checking with PRISM: variable reordering, quantiles and weak deterministic Büchi automata
  J. Klein, C. Baier, P. Chrszon, M. Daum, C. Dubslaff, S. Klüppelholz, S. Märcker, and D. Müller
  In: International Journal on Software Tools for Technology Transfer (Special issue "TACAS'16"), volume 20, 2018
  (implementation and additional material)
• A Hardware/Software Stack for Heterogeneous Systems
  J. Castrillon, M. Lieber, S. Klüppelholz, M. Völp, N. Asmussen, U. Aßmann, F. Baader, C. Baier, G. Fettweis, J. Fröhlich, A. Goens, S. Haas, D. Habich, H. Härtig, M. Hasler, I. Huismann, T. Karnagel, S. Karol, A. Kumar, W. Lehner, L. Leuschner, S. Ling, S. Märcker, C. Menard, J. Mey, W. Nagel, B. Nöthen, R. Penaloza, M. Raitza, J. Stiller, A. Ungethüm, and A. Voigt, S. Wunderlich
  In: IEEE Transactions on Multi-Scale Computing Systems, volume 4, 2018

2017

• Computing Conditional Probabilities: Implementation and Evaluation
  S. Märcker, C. Baier, J. Klein, S. Klüppelholz
  In: SEFM 2017, 2017
  (extended version, implementation and additional material)

2016

• The Orchestration Stack: The Impossible Task of Designing Software for Unknown Future Post-CMOS Hardware
  M. Völp, S. Klüppelholz, J. Castrillon, H. Härtig, N. Asmussen, U. Aßmann, F. Baader, C. Baier, G. Fettweis, J. Fröhlich, A. Goens, S. Haas, D. Habich, M. Hasler, I. Huismann, T. Karnagel, S. Karol, W. Lehner, L. Leuschner, M. Lieber, S. Ling, S. Märcker, J. Mey, W. Nagel, B. Nöthen, R. Penaloza, M. Raitza, J. Stiller, A. Ungethüm, and A. Voigt
  In: PMES2016, 2016
• Advances in symbolic probabilistic model checking with PRISM
  J. Klein, C. Baier, P. Chrszon, M. Daum, C. Dubslaff, S. Klüppelholz, S. Märcker, and D. Müller
  In: TACAS 2016, volume 9636 of LNCS, 2016
  (implementation and additional material)

2015

• Locks: Picking key methods for a scalable quantitative analysis
  C. Baier, M. Daum, B. Engel, H. Härtig, J. Klein, S. Klüppelholz, S. Märcker, H. Tews, and M. Völp
  In: Journal of Computer and System Sciences, volume 81(1), 2015

2014

• Probabilistic model checking and non-standard multi-objective reasoning C. Baier, C. Dubslaff, S. Klüppelholz, M. Daum, J. Klein, S. Märcker, and S. Wunderlich
  In: FASE 2014, volume 8411 of LNCS, 2014.
• Computing conditional probabilities in Markovian models efficiently
  C. Baier, J. Klein, S. Klüppelholz, and S. Märcker
  In: TACAS 2014, volume 8413 of LNCS, 2014

2013

• A Probabilistic Quantitative Analysis of Probabilistic-Write/Copy-Select
  C. Baier, B. Engel, S. Klüppelholz, S. Märcker, H. Tews, and M. Völp
  In: NFM 2013, volume 7871 of LNCS, 2013

2012

• Chiefly symmetric: Results on the scalability of probabilistic model checking for operating-system code
  C. Baier, M. Daum, B. Engel, H. Härtig, J. Klein, S. Klüppelholz, S. Märcker, H. Tews, and M. Völp
  In: SSV 2012, volume 102 of EPTCS, 2012
• Waiting for locks: How long does it usually take?
  C. Baier, M. Daum, B. Engel, H. Härtig, J. Klein, S. Klüppelholz, S. Märcker, H. Tews, and M. Völp
  In: FMICS 2012, volume 7437 of LNCS, 2012

2011

• Weighted Tree Automata over Valuation Monoids and Their Characterization by Weighted Logics
  M. Droste, D. Götze, S. Märcker, and I. Meinecke
  In: Algebraic Foundations in Computer Science (eds. W. Kuich, G. Rahonis), volume 7020 of LNCS, 2011

Diploma Thesis

• Charakterisierung erkennbarer Baumreihen über starken Bimonoiden durch gewichtete MSO-Logik
  Diploma Thesis, Leipzig University, 2010