TU Wien Informatics

Overview Professors Scientific Staff Administrative Staff Student Staff External Lecturers By Responsibilities By Committee By Name
Related
Guest Professors Honoraries Alumni (LinkedIn) #5qw

Johann Blieberger

Ao.Univ.Prof. Dipl.-Ing. Dr.techn.

Research Focus

  • Computer Engineering: 100%
Johann Blieberger

About

Johann Blieberger's research interests include

  1. Real-time systems
  2. Analysis of multi-threaded systems
  3. Design and analysis of weak memory models
  4. Modeling and automating railway operation
  5. Static program analysis
  6. Symbolic evaluation and its applications
  7. Analysis of algorithms and data structures
  8. Ada (programming language)

He is a member of ISO JTC1/SC22/WG9 (development of the Ada programming language).

Roles

Contact

2022W

2023S

 

Note: Due to the rollout of TU Wien’s new publication database, the list below may be slightly outdated. Once the migration is complete, everything will be up to date again.

2022

  • Utilising Kronecker Algebra to Detect Unexpected Behaviour in Distributed Systems / Denzler, P. H., Blieberger, J., & Kastner, W. (2022). Utilising Kronecker Algebra to Detect Unexpected Behaviour in Distributed Systems. In Institute of Electrical and Electronics Engineers (Ed.), Proceedings. 2022 IEEE 25th International Symposium On Real-Time Distributed Computing (ISORC). Institute of Electrical and Electronic Engineers, Inc. https://doi.org/10.34726/2581 / Project: FORA

2021

2020

2019

2018

  • Application of Kronecker Algebra for Railway Line Zagreb-Rijeka / Schöbel, A., Blieberger, J., & Schöbel, C. (2018). Application of Kronecker Algebra for Railway Line Zagreb-Rijeka. In Road and Rail Infrastructure V (pp. 1261–1264). Department of Transportation, Faculty of Ciivil Engineering, University of Zagreb. https://doi.org/10.5592/co/cetra.2018.698
  • Kronecker Algebra for Optimization of Rail Traffic Flow on Zagreb--Rijeka Line / Schöbel, A., Schöbel, C., Stefan, M., & Blieberger, J. (2018). Kronecker Algebra for Optimization of Rail Traffic Flow on Zagreb--Rijeka Line. In Proceedings Railcon 2018 (pp. 41–44). http://hdl.handle.net/20.500.12708/57457
  • Enhancing Performance in Railway Operation by Application of Kronecker Algebra / Schöbel, A., Schöbel, C., Stefan, M., & Blieberger, J. (2018). Enhancing Performance in Railway Operation by Application of Kronecker Algebra. In Proceedings ICTTE 2018 (pp. 113–117). ? http://hdl.handle.net/20.500.12708/57435
  • Safe Non-blocking Synchronization in Ada2x / Blieberger, J., & Burgstaller, B. (2018). Safe Non-blocking Synchronization in Ada2x. In A. Casimiro & P. M. Ferreira (Eds.), Reliable Software Technologies – Ada-Europe 2018 (pp. 53–69). Springer-Verlag. https://doi.org/10.1007/978-3-319-92432-8_4
  • Kronecker Algebra for Managing Rail Capacity / Schöbel, A., Schöbel, C., & Blieberger, J. (2018). Kronecker Algebra for Managing Rail Capacity. In ISEP2018 -- 26th International Symposium on Electronics in Transport. ISEP2018. http://hdl.handle.net/20.500.12708/57324

2017

2016

2015

2014

2013

2012

2010

2009

2008

  • A Framework for CFG-Based Static Program Analysis of Ada Programs / Fechete, R., Kienesberger, G., & Blieberger, J. (2008). A Framework for CFG-Based Static Program Analysis of Ada Programs. In F. Kordon & T. Vardanega (Eds.), Reliable Software Technologies - Ada-Europe 2008: 13th Ada-Europe International Conference on Reliable Software Technologies, Venice, Italy, June 16-20, 2008. Proceedings (pp. 130–143). Springer - LNCS. https://doi.org/10.1007/978-3-540-68624-8_10
  • Average Case Analysis of Some Elimination-Based Data-Flow Analysis Algorithms / Blieberger, J. (2008). Average Case Analysis of Some Elimination-Based Data-Flow Analysis Algorithms. In Scalable Program Analysis. Dagstuhl Seminar 08161 Scalable Program Analysis, Schloss Dagstuhl, Dagstuhl, Wadern, EU. Leibniz-Zentrum für Informatik. http://hdl.handle.net/20.500.12708/52535
  • Static Partial-Order Reduction of Concurrent Systems in Polynomial Time / Mittermayr, R., & Blieberger, J. (2008). Static Partial-Order Reduction of Concurrent Systems in Polynomial Time. In Leveraging Applications of Formal Methods, Verification and Validation (pp. 619–633). Springer Berlin Heidelberg. http://hdl.handle.net/20.500.12708/52534

2007

  • Static Detection of Livelocks in Ada Multitasking Programs / Blieberger, J., Burgstaller, B., & Mittermayr, R. (2007). Static Detection of Livelocks in Ada Multitasking Programs. In N. Abdennadher & F. Kordon (Eds.), Reliable Software Technologies - Ada-Europe 2007: 12th Ada-Europe International Conference on Reliable Software Technologies, Geneva, Switzerland, June 25-29, 2007, Proceedings (pp. 69–83). Springer-Verlag. https://doi.org/10.1007/978-3-540-73230-3_6
  • A New Elimination-Based Data Flow Analysis Framework Using Annotated Decomposition Trees / Scholz, B., & Blieberger, J. (2007). A New Elimination-Based Data Flow Analysis Framework Using Annotated Decomposition Trees. In Lecture Notes in Computer Science (pp. 202–217). LNCS, Springer-Verlag. https://doi.org/10.1007/978-3-540-71229-9_14

2006

  • Average Case Analysis of DJ Graphs / Blieberger, J. (2006). Average Case Analysis of DJ Graphs. Journal of Discrete Algorithms, 4(4), 649–675. https://doi.org/10.1016/j.jda.2005.07.002
  • Symbolic Analysis of Imperative Programming Languages / Burgstaller, B., Scholz, B., & Blieberger, J. (2006). Symbolic Analysis of Imperative Programming Languages. In Lecture Notes in Computer Science (pp. 172–194). Springer-Verlag. https://doi.org/10.1007/11860990_12
  • Static Detection of Access Anomalies in Ada95 / Burgstaller, B., Blieberger, J., & Mittermayr, R. (2006). Static Detection of Access Anomalies in Ada95. In Reliable Software Technologies – Ada-Europe 2006 (pp. 40–55). Springer-Verlag. https://doi.org/10.1007/11767077_4

2005

  • Dekomposition und Enumeration von Flussgraphen / Blieberger, J. (2005). Dekomposition und Enumeration von Flussgraphen. Department Mathematik und Informationstechnologie, Lehrstuhl für Mathematik & Statistik, Leoben, Austria, Austria. http://hdl.handle.net/20.500.12708/84436
  • Informatik-Grundlagen / Blieberger, J., Burgstaller, B., & Schildt, G.-H. (2005). Informatik-Grundlagen. Springer-Verlag. http://hdl.handle.net/20.500.12708/22282

2004

2003

2002

  • Algorithmen (Überarbeitung) / Blieberger, J. (2002). Algorithmen (Überarbeitung). In Informatik - Grundlagen (pp. 151–164). Springer. http://hdl.handle.net/20.500.12708/25335
  • Informationstheorie (Überarbeitung & Ergänzung) / Blieberger, J. (2002). Informationstheorie (Überarbeitung & Ergänzung). In Informatik - Grundlagen (pp. 15–32). Springer. http://hdl.handle.net/20.500.12708/25334
  • Quanten-Computer / Blieberger, J. (2002). Quanten-Computer. In Informatik - Grundlagen (pp. 195–217). Springer. http://hdl.handle.net/20.500.12708/25332
  • Informatik-Grundlagen / Blieberger, J., Burgstaller, B., & Schildt, G.-H. (2002). Informatik-Grundlagen. Springer. http://hdl.handle.net/20.500.12708/22269

2001

  • Real-Time Properties of Indirect Recursive Procedures / Blieberger, J. (2001). Real-Time Properties of Indirect Recursive Procedures. Information and Computation, 171(2), 156–182. https://doi.org/10.1006/inco.2001.3042
  • Unified Modelling Language / Blieberger, J. (2001). Unified Modelling Language. UML-Kurs, Länderübergreifende Veranstaltung des Pädagogischen Instituts des Bundes, Vienna, Austria, Austria. http://hdl.handle.net/20.500.12708/84197
  • WCET Anlaysis for Multi-Threaded Applications on Multi-Processor Systems / Blieberger, J. (2001). WCET Anlaysis for Multi-Threaded Applications on Multi-Processor Systems. WCET Workshop of the EUROMICRO Conference on Real-Time Systems, Delft, The Netherlands, Austria. http://hdl.handle.net/20.500.12708/84167

2000

  • Symbolic Cache Analysis for Real-Time Systems / Blieberger, J., Fahringer, T., & Scholz, B. (2000). Symbolic Cache Analysis for Real-Time Systems. Real-Time Systems, 18(2/3), 181–215. https://doi.org/10.1023/a:1008193114940
  • Data-Flow Frameworks for Worst-Case Execution Time Analysis / Blieberger, J. (2000). Data-Flow Frameworks for Worst-Case Execution Time Analysis. Deutschsprachige WCET-Tagung, Paderborn, Germany, Austria. http://hdl.handle.net/20.500.12708/84207
  • Symbolic Worst-Case Execution Time Analysis / Blieberger, J. (2000). Symbolic Worst-Case Execution Time Analysis. Habilitationskolloquium, Wien, Austria. http://hdl.handle.net/20.500.12708/84198
  • Lady Ada and Senor Java at the Dentist / Blieberger, J. (2000). Lady Ada and Senor Java at the Dentist. Globex Roadshow, Bregenz, Austria, Austria. http://hdl.handle.net/20.500.12708/84166
  • Symbolic pointer analysis for detecting memory leaks / Scholz, B., Blieberger, J., & Fahringer, T. (2000). Symbolic pointer analysis for detecting memory leaks. In Proceedings of the 2000 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation  - PEPM ’00. ACM SIGPLAN Workshop on “Partial Evaluation and Semantics-Based Program Manipulation” (PEPM), Boston, MA, USA, Austria. ACM Press. https://doi.org/10.1145/328690.328704
  • Symbolic Data Flow Analysis for Detecting Deadlocks in Ada Tasking Programs / Blieberger, J., Burgstaller, B., & Scholz, B. (2000). Symbolic Data Flow Analysis for Detecting Deadlocks in Ada Tasking Programs. In Reliable Software Technologies Ada-Europe 2000 (pp. 225–237). Springer-Verlag. https://doi.org/10.1007/10722060_21

1999

1998

1997

1996

1995

  • On non-preemptive LCFS Scheduling with Deadlines / Schmid, U., & Blieberger, J. (1995). On non-preemptive LCFS Scheduling with Deadlines. Journal of Algorithms, 18(1), 124–158. https://doi.org/10.1006/jagm.1995.1004
  • Ada / Blieberger, J. (1995). Ada. Ada-Kurs für Angehörige des Forschungszentrums Seibersdorf, Seibersdorf, Austria, Austria. http://hdl.handle.net/20.500.12708/84199
  • The Role of GNAT within Project WOOP / Blieberger, J., & Burgstaller, B. (1995). The Role of GNAT within Project WOOP. GNAT Workshop of the Ada-Europe’95 Conference, Frankfurt/Main, Germany, Austria. http://hdl.handle.net/20.500.12708/84164
  • Real-time recursive procedures / Blieberger, J., & Lieger, R. (1995). Real-time recursive procedures. In Proceedings Seventh Euromicro Workshop on Real-Time Systems. EUROMICRO Workshop on Real-Time Systems, l’Aquila, Italy, Austria. https://doi.org/10.1109/emwrts.1995.514316
  • Using Discrete Loops for Easy Comprehension of Algorithms / Lieger, R., & Blieberger, J. (1995). Using Discrete Loops for Easy Comprehension of Algorithms. In Proceedings of the Workshop on Automation and Control Engineering in Higher Education (pp. 125–134). http://hdl.handle.net/20.500.12708/50916
  • Loops for Safety-Critical Applications / Blieberger, J. (1995). Loops for Safety-Critical Applications. In Proceedings of SAFECOMP. SAFECOMP, Belgirate, Italy, Austria. http://hdl.handle.net/20.500.12708/50915
  • Skriptum "Entwurf von Automatisierungssystemen mit Ada95" (TR 183/1-71) / Blieberger, J. (1995). Skriptum “Entwurf von Automatisierungssystemen mit Ada95” (TR 183/1-71). http://hdl.handle.net/20.500.12708/32865

1994

1993

1992

1991

1989

1987

  • Monotonically Labelled Motzkin Trees / Blieberger, J. (1987). Monotonically Labelled Motzkin Trees. Discrete Applied Mathematics, 18, 9–24. http://hdl.handle.net/20.500.12708/174810

 

Note: Due to the rollout of TU Wien’s new publication database, the list below may be slightly outdated. Once the migration is complete, everything will be up to date again.