I7 Logo
Chair for Foundations of Software Reliability and Theoretical Computer Science
Informatik Logo TUM Logo
Publications in 2009

Javier Esparza, Andreas Gaiser, and Stefan Kiefer. Computing least fixed points of probabilistic systems of polynomials. Technical report, Technische Universität München, Institut für Informatik, December 2009.
PDF (349 kB)
Info
Javier Esparza, Andreas Gaiser, and Stefan Kiefer. Computing least fixed points of probabilistic systems of polynomials. Technical report, Technische Universität München, Institut für Informatik, December 2009.
PDF (349 kB)
Info
Andreas Gaiser and Stefan Schwoon. Comparison of algorithms for checking emptiness on Büchi automata. In Tomáš Vojnar, Petr Hliněný, Vashek Matyáš, and David Antoš, editors, Proceedings of the 5th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS), pages 69–77, Znojmo, Czechia, November 2009.
PDF (150 kB)
Info
Tech report version
Tomáš Brázdil, Javier Esparza, and Stefan Kiefer. On the memory consumption of probabilistic pushdown automata. Technical Report FIMU-RS-2009-07, Faculty of Informatics, Masaryk University, October 2009.
PDF (447 kB)
Info
Conference version
Andreas Holzer, Visar Januzaj, Stefan Kugele, Christian Schallhart, Michael Tautschnig, Helmut Veith, and Boris Langer. Slope testing for activity diagrams and safety critical software. Technical Report TUD-CS-2009-0184, Technische Universität Darmstadt, October 2009.
PDF (403 kB)
Info
Visar Januzaj and Stefan Kugele. Model analysis via a translation schema to coloured petri nets. In Daniel Moldt, editor, PNSE'09: Proceedings of the International Workshop on Petri Nets and Software Engineering, pages 273–292, June 2009.
PDF (563 kB)
Info
Wolfgang Haberl, Stefan Kugele, and Uwe Baumgarten. Reliable operating modes for distributed embedded systems. In Proceedings of the ICSE Workshop on Model-based Methodologies for Pervasive and Embedded Software, volume 0, pages 11–21, Los Alamitos, CA, USA, May 2009. IEEE Computer Society.
PDF (2 MB)
Info
Morten Kühnrich, Stefan Schwoon, Jiří Srba, and Stefan Kiefer. Interprocedural dataflow analysis over weight domains with infinite descending chains. In Luca de Alfaro, editor, Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures (FOSSACS), volume 5504 of Lecture Notes in Computer Science, pages 440–455, York, UK, March 2009. Springer.
PDF (211 kB)
Info
Tech report version
Tomáš Brázdil, Javier Esparza, and Stefan Kiefer. On the memory consumption of probabilistic pushdown automata. In Ravi Kannan and K. Narayan Kumar, editors, Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), Leibniz International Proceedings in Informatics, pages 49–60, Kanpur, India, 2009.
PDF (162 kB)
Info
See drops.dagstuhl.de ...
Slides 
Tech report version
Stefan Kiefer. Solving systems of positive polynomial equations. PhD thesis, Technische Universität München, 2009.
PDF (931 kB)
Info
Slides 
Jan Kretinsky. Fundamental properties of probabilistic branching-time logics. Master's thesis, Masaryk University, Brno, Dept. of Computer Science, 2009.
Info
Nikola Benes, Jan Kretinsky, Kim Guldstrand Larsen, and Jiri Srba. Checking thorough refinement on modal transition systems is exptime-complete. In ICTAC, pages 112–126, 2009.
Info
Nikola Benes, Jan Kretinsky, Kim Guldstrand Larsen, and Jiri Srba. Checking thorough refinement on modal transition systems is exptime-complete. Technical report FIMU-RS-2009-03, Faculty of Informatics, Masaryk University, Brno, 2009.
Info
Nikola Benes, Jan Kretinsky, Kim Guldstrand Larsen, and Jiri Srba. On determinism in modal transition systems. Theor. Comput. Sci., 410(41):4026–4043, 2009.
Info
Tomas Brazdil, Vojtech Forejt, Jan Krcal, Jan Kretinsky, and Antonin Kucera. Continuous-time stochastic games with time-bounded reachability. In FSTTCS, pages 61–72, 2009.
Info
Tomas Brazdil, Vojtech Forejt, Jan Krcal, Jan Kretinsky, and Antonin Kucera. Continuous-time stochastic games with time-bounded reachability. Technical report FIMU-RS-2009-09, Faculty of Informatics, Masaryk University, Brno, 2009.
Info
Wolfgang Haberl, Markus Herrmannsdoerfer, Stefan Kugele, Michael Tautschnig, and Martin Wechs. One click from model to reality, 2009. Accepted for presentation at SAASE '09: Symposium on Automotive/Avionics Systems Engineering.
Info
Andreas Holzer, Visar Januzaj, and Stefan Kugele. Towards resource consumption-aware programming. In Kenneth Boness, João M. Fernandes, Jon G. Hall, Ricardo Jorge Machado, and Roy Oberhauser, editors, The Fourth International Conference on Software Engineering Advances, ICSEA 2009, 20-25 September 2009, Porto, Portugal, pages 490–493. IEEE Computer Society, 2009.
PDF (184 kB)
Info
Morten Kühnrich, Stefan Schwoon, Jiří Srba, and Stefan Kiefer. Interprocedural dataflow analysis over weight domains with infinite descending chains. Technical Report 0901.0501, Computing Research Repository, 2009.
PDF (242 kB)
Info
Conference version
Andreas Gaiser and Stefan Schwoon. Comparison of algorithms for checking emptiness on Büchi automata. Technical Report 0910.3766, Computing Research Repository, 2009.
PDF (160 kB)
Info
Conference version
Dejvuth Suwimonteerabuth. Reachability in pushdown systems: Algorithms and applications. PhD thesis, Technische Universität München, 2009.
PDF (1002 kB)
Info