2024W

• Bachelor Thesis / 183.609 / PR
• Computer Engineering Practical / 191.005 / PR
• Computer Engineering Project / 191.006 / PR
• Parallel and Real-Time Programming / 183.626 / VU
• Project in Computer Science 1 / 191.008 / PR
• Project in Computer Science 2 / 191.009 / PR
• Pv.aus Automatisierungssystemen / 183.183 / PV
• Scientific Project Computer Engineering / 191.007 / PR
• Seminar Computer Engineering / 183.674 / SE
• Seminar for Master Students in Computer Engineering / 180.778 / SE

2025S

• Bachelor Thesis / 183.609 / PR

 

• Simulation tool to increase sustainability and efficiency of public transport verhicles
  2021 – 2023 / Austrian Research Promotion Agency (FFG)
• Coordination of Autonomous Vehicles for Transporting Goods in Environments with Pedestrians
  2017 – 2019 / Austrian Research Promotion Agency (FFG)
• Autonomous Vehicle to Support Active Mobility
  2016 – 2019 / Austrian Research Promotion Agency (FFG)
• Static Analysis and Just-in-Time Compilation Support for Heterogeneous Multicore Architectures
  2013 – 2016 / Austrian Science Fund (FWF)
  Publications: 140221 / 152059 / 55086 / 56929 / 56934 / 86867
• Energiebedarfsoptimierung durch Verknüpfung der Betriebsführung des Bahnverkehrs mit der Steuerung des Bahnstromnetzes
  2012 – 2014 / Austrian Research Promotion Agency (FFG)
  Publications: 54229 / 54604 / 54668 / 54736

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
  Download: Open Access Version (345 KB)
  Project: FORA (2017–2021)

2021

• AdaMM: A Precompiler for Memory Model Aware Programming on Higher Language Level / Blieberger, J. (2021). AdaMM: A Precompiler for Memory Model Aware Programming on Higher Language Level. Ada-Europe International Conference on Reliable Software Technologies 2021, Unknown. http://hdl.handle.net/20.500.12708/87197
• Deadlock and WCET Analysis of Barrier-Synchronized Concurrent Programs / Mittermayr, R., & Blieberger, J. (2021). Deadlock and WCET Analysis of Barrier-Synchronized Concurrent Programs. Computing, 103(5), 749–770. https://doi.org/10.1007/s00607-017-0555-8

2020

• Design-space evaluation for non-blocking synchronization in Ada: lock elision of protected objects, concurrent objects, and low-level atomics / Yang, S., Jeong, S., Min, B., Kim, Y., Burgstaller, B., & Blieberger, J. (2020). Design-space evaluation for non-blocking synchronization in Ada: lock elision of protected objects, concurrent objects, and low-level atomics. The Journal of Systems Architecture: Embedded Software Design, 110(101764), 101764. https://doi.org/10.1016/j.sysarc.2020.101764
  Project: SAJiTcore++ (2013–2016)

2019

• Benchmark of delays simulated by OpenTrack and calculated by Kronecker Algebra / Schöbel, A., Schöbel, C., Blieberger, J., & Stefan, M. (2019). Benchmark of delays simulated by OpenTrack and calculated by Kronecker Algebra. In Proceedings of the International Scientific Conference “The Science and Development of Transport” (pp. 371–375). Faculty of Transport and Traffic SciencesUniversity of Zagreb. http://hdl.handle.net/20.500.12708/58003
• Parallel Construction of Simultaneous Deterministic Finite Automata on Shared-memory Multicores / Jung, M., Park, J., Blieberger, J., & Burgstaller, B. (2019). Parallel Construction of Simultaneous Deterministic Finite Automata on Shared-memory Multicores. The 12th Annual Meeting of the Asian Association for Algorithms and Computation, Seoul, Korea (the Republic of). http://hdl.handle.net/20.500.12708/86867
  Project: SAJiTcore++ (2013–2016)
• Blocking versus Non-Blocking Shared-Memory Multicore Synchronization: Programmability, Scalability and Performance / Yang, S., Jeong, S., Min, B., Kim, Y., Burgstaller, B., & Blieberger, J. (2019). Blocking versus Non-Blocking Shared-Memory Multicore Synchronization: Programmability, Scalability and Performance. Reliable Software Technologies - Ada-Europe, Montreux, Switzerland, Austria. http://hdl.handle.net/20.500.12708/86876

2018

• 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
• 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 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
• 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

2017

• Optimization of rail traffic flow using Kronecker algebra during maintenance on infrastructure / Schöbel, A., Aksentijevic, J., Stefan, M., & Blieberger, J. (2017). Optimization of rail traffic flow using Kronecker algebra during maintenance on infrastructure. Transportation Research Procedia, 27, 545–552. https://doi.org/10.1016/j.trpro.2017.12.040
• Application of Kronecker Algebra in Railway Operation / Stefan, M., Blieberger, J., & Schöbel, A. (2017). Application of Kronecker Algebra in Railway Operation. Tehnicki Vjesnik - Technical Gazette, 24(1). https://doi.org/10.17559/tv-20131107130926
• Lazy Parallel Kronecker Algebra-Operations on Heterogeneous Multicores / Sodsong, W., Mittermayr, R., Park, Y., Burgstaller, B., & Blieberger, J. (2017). Lazy Parallel Kronecker Algebra-Operations on Heterogeneous Multicores. In F. F. Rivera, T. F. Pena, & J. C. Cabaleiro (Eds.), Euro-Par 2017: Parallel Processing Workshops (pp. 538–552). LNCS / Springer Verlag. https://doi.org/10.1007/978-3-319-64203-1_39
  Project: SAJiTcore++ (2013–2016)
• Reliable Software Technologies – Ada-Europe 2017 / Blieberger, J., & Bader, M. (Eds.). (2017). Reliable Software Technologies – Ada-Europe 2017. Springer Cham. https://doi.org/10.1007/978-3-319-60588-3
• Parallel Construction of Simultaneous Deterministic Finite Automata on Shared-Memory Multicores / Jung, M., Park, J., Blieberger, J., & Burgstaller, B. (2017). Parallel Construction of Simultaneous Deterministic Finite Automata on Shared-Memory Multicores. In 2017 46th International Conference on Parallel Processing (ICPP). International Conference on Parallel Processing, Bristol, EU. IEEE. https://doi.org/10.1109/icpp.2017.36
  Project: SAJiTcore++ (2013–2016)

2016

• A Generic Graph Model for WCET Analysis of Multi-core Concurrent Applications / Mittermayr, R., & Blieberger, J. (2016). A Generic Graph Model for WCET Analysis of Multi-core Concurrent Applications. Journal of Software Engineering and Applications, 09(05), 182–198. https://doi.org/10.4236/jsea.2016.95015
• Kronecker Algebra Based Analysis of Concurrent Computer Programs / Blieberger, J. (2016). Kronecker Algebra Based Analysis of Concurrent Computer Programs. Festkolloquium aus Anlass des 60. Geburtstages von o.Univ.Prof.Dr. Peter Kirschenhofer, Leoben, Austria. http://hdl.handle.net/20.500.12708/86321
• Kronecker Algebra for Static Analysis of Barriers in Ada / Mittermayr, R., & Blieberger, J. (2016). Kronecker Algebra for Static Analysis of Barriers in Ada. In Ada-Europe’2016 International Conference on Reliable Software Technologies (pp. 145–159). Springer-Verlag. http://hdl.handle.net/20.500.12708/56463

2015

• Kronecker Algebra zur Optimierung des Eisenbahnbetriebes / Stefan, M., Blieberger, J., & Schöbel, A. (2015, September). Kronecker Algebra zur Optimierung des Eisenbahnbetriebes. Eisenbahntechnische Rundschau (ETR), 9, 78–84. http://hdl.handle.net/20.500.12708/151053
• Efficient Construction of Simultaneous Deterministic Finite Automata on Multicores Using Rabin Fingerprints / Jung, M., Burgstaller, B., & Blieberger, J. (2015). Efficient Construction of Simultaneous Deterministic Finite Automata on Multicores Using Rabin Fingerprints. arXiv. https://doi.org/10.48550/arXiv.1512.09228
  Project: SAJiTcore++ (2013–2016)

2014

• Optimisation of Railway Operation by Application of Kronecker Algebra / Volcic, M., Blieberger, J., & Schöbel, A. (2014). Optimisation of Railway Operation by Application of Kronecker Algebra. In Proceedings CETRA 2014 (pp. 37–42). http://hdl.handle.net/20.500.12708/55113
• Analysis and optimisation of railway systems / Schöbel, A., Volcic, M., & Blieberger, J. (2014). Analysis and optimisation of railway systems. In EURO_ZEL 2014, 22nd International Symposium (p. 6). University of Zilina. http://hdl.handle.net/20.500.12708/55121
• Kronecker-Algebra und ihre breit gefächerten Anwendungen im Eisenbahnbereich / Blieberger, J., Schöbel, A., & Volcic, M. (2014). Kronecker-Algebra und ihre breit gefächerten Anwendungen im Eisenbahnbereich. Signal + Draht, 106(7+8), 15–18. http://hdl.handle.net/20.500.12708/156397
• Generalized Catalan Sequences Originating from the Analysis of Special Data Structures / Blieberger, J., & Kirschenhofer, P. (2014). Generalized Catalan Sequences Originating from the Analysis of Special Data Structures. Bulletin of the Institute of Combinatorics and Its Applications, 71, 103–116. http://hdl.handle.net/20.500.12708/156592
• Kronecker Algebra for Static Analysis of Ada Programs with Protected Objects / Blieberger, J., & Burgstaller, B. (2014). Kronecker Algebra for Static Analysis of Ada Programs with Protected Objects. In Proceedings of Ada-Europe 2014 (pp. 27–42). http://hdl.handle.net/20.500.12708/55086
  Project: SAJiTcore++ (2013–2016)

2013

• Kronecker Algebra and its Broad Applications in Railway Systems / Volcic, M., Blieberger, J., & Schöbel, A. (2013). Kronecker Algebra and its Broad Applications in Railway Systems. In EURO-ZEL 2013: Recent Challenges for European Railways (pp. 275–282). University of Zilina. http://hdl.handle.net/20.500.12708/54604
  Project: EcoRailNet (2012–2014)
• Kronecker Algebra based Modelling of Railway Operation / Volcic, M., Schöbel, A., & Blieberger, J. (2013). Kronecker Algebra based Modelling of Railway Operation. In Proceedings of the MT-ITS 2013 (pp. 345–356). TUDpress. http://hdl.handle.net/20.500.12708/54736
  Project: EcoRailNet (2012–2014)
• Kronecker Algebra as a Frame for Optimisation of Railway Operation / Volcic, M., Blieberger, J., & Schöbel, A. (2013). Kronecker Algebra as a Frame for Optimisation of Railway Operation. In Mechanics Transport Communications (pp. 57–63). Mechanics Transport Communications/VTU Print. http://hdl.handle.net/20.500.12708/54668
  Project: EcoRailNet (2012–2014)

2012

• StreamPI: A stream-parallel programming extension for object-oriented programming languages / Hong, J., Hong, K., Burgstaller, B., & Blieberger, J. (2012). StreamPI: A stream-parallel programming extension for object-oriented programming languages. Journal of Supercomputing, 61(1), 118–140. https://doi.org/10.1007/s11227-011-0656-7
• Kronecker Algebra based Deadlock Analysis for Railway Systems / Mittermayr, R., Blieberger, J., & Schöbel, A. (2012). Kronecker Algebra based Deadlock Analysis for Railway Systems. PROMET - Traffic&Transportation, 24(5), 359–369. https://doi.org/10.7307/ptt.v24i5.1171
• Timing Analysis of Concurrent Programs / Mittermayr, R., & Blieberger, J. (2012). Timing Analysis of Concurrent Programs. In T. Vardanega (Ed.), Proc. 12th International Workshop on Worst-Case Execution Time Analysis (pp. 59–68). Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/OASIcs.WCET.2012.59
• Kronecker Algebra based Travel Time Analysis for Railway Systems / Volcic, M., Blieberger, J., & Schöbel, A. (2012). Kronecker Algebra based Travel Time Analysis for Railway Systems. In Forms/Format 2012 - 9th Symposium on Formal Methods for Automation and Safety in Railway and Automotive Systems (pp. 273–281). Inst. f. Verkehrssicherheit und Automatisierungstechnik. http://hdl.handle.net/20.500.12708/54229
  Project: EcoRailNet (2012–2014)
• A symbolic analysis framework for static analysis of imperative programming languages / Burgstaller, B., Scholz, B., & Blieberger, J. (2012). A symbolic analysis framework for static analysis of imperative programming languages. Journal of Systems and Software, 85(6), 1418–1439. https://doi.org/10.1016/j.jss.2011.11.1039
• Projektbericht Verfügbarkeitsberechnung / Ostermann, N., Blieberger, J., & Tauschitz, P. (2012). Projektbericht Verfügbarkeitsberechnung. http://hdl.handle.net/20.500.12708/37618

2010

• Availability Analysis for Railway Infrastructure based on Graph Theory / Schöbel, A., & Blieberger, J. (2010). Availability Analysis for Railway Infrastructure based on Graph Theory. In Revitalisation of Economy - New Challenge for European Railways (pp. 141–148). EDIS Zilina. http://hdl.handle.net/20.500.12708/60186
• AdaStreams: A Type-based Programming Extension for Stream-Parallelism with Ada 2005 / Hong, J., Hong, K., Burgstaller, B., & Blieberger, J. (2010). AdaStreams: A Type-based Programming Extension for Stream-Parallelism with Ada 2005. In Reliable Software Technologies - Ada Europe 2010 (pp. 208–221). Springer-Verlag. http://hdl.handle.net/20.500.12708/53659

2009

• Graphentheoretische Verfügbarkeitsanalyse für die Eisenbahninfrastruktur / Blieberger, J., Ostermann, N., & Schöbel, A. (2009). Graphentheoretische Verfügbarkeitsanalyse für die Eisenbahninfrastruktur. Signal&Draht, 101(9), 33–36. http://hdl.handle.net/20.500.12708/165268

2008

• 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. Third International Symposium, ISoLA 2008 (pp. 619–633). Springer Berlin Heidelberg. http://hdl.handle.net/20.500.12708/52534
• 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

2007

• 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 Compiler Construction (pp. 202–217). LNCS, Springer-Verlag. https://doi.org/10.1007/978-3-540-71229-9_14
• 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

2006

• Symbolic Analysis of Imperative Programming Languages / Burgstaller, B., Scholz, B., & Blieberger, J. (2006). Symbolic Analysis of Imperative Programming Languages. In Modular Programming Languages (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
• 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

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

• Tour de Spec - A Collection of Spec95 Program Paths and Associated Costs for Symbolic Evaluation / Burgstaller, B., Scholz, B., & Blieberger, J. (2004). Tour de Spec - A Collection of Spec95 Program Paths and Associated Costs for Symbolic Evaluation. http://hdl.handle.net/20.500.12708/32938

2003

• The WCETₘₐᵣₖₑᵣ-Problem is NP-complete / Ben-Amram, A., Blieberger, J., & Scholz, B. (2003). The WCETₘₐᵣₖₑᵣ-Problem is NP-complete. WCET-Meeting, Vienna, Austria, Austria. http://hdl.handle.net/20.500.12708/84206

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, 181–215. https://doi.org/10.1023/a:1008193114940
• 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
• 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

1999

• Ada Binding to a Shared Object Layer / Blieberger, J., Klasek, J., & Kühn, E. (1999). Ada Binding to a Shared Object Layer. In M. González Harbour & J. A. de la Puente (Eds.), Reliable Software Technologies - Ada-Europe ’99 (pp. 263–274). Springer-Verlag. https://doi.org/10.1007/3-540-48753-0_23
• Interprocedural Symbolic Evaluation of Ada Programs with Aliases / Blieberger, J., Burgstaller, B., & Scholz, B. (1999). Interprocedural Symbolic Evaluation of Ada Programs with Aliases. In M. González Harbour & J. A. de la Puente (Eds.), Reliable Software Technologies - Ada-Europe ’99 (pp. 136–145). Springer-Verlag. https://doi.org/10.1007/3-540-48753-0_12
• Expertengutachten: Beurteilung einer Software-Entwicklungsabteilung eines Unternehmens / Blieberger, J. (1999). Expertengutachten: Beurteilung einer Software-Entwicklungsabteilung eines Unternehmens. http://hdl.handle.net/20.500.12708/32887

1998

• Symbolic reaching definitions analysis of Ada programs / Blieberger, J., & Burgstaller, B. (1998). Symbolic reaching definitions analysis of Ada programs. In Reliable Software Technologies — Ada-Europe (pp. 238–250). Springer-Verlag. https://doi.org/10.1007/bfb0055009
• Busy Period Duration for Static Priority Scheduling of Database Transactions (TR 183/1-104) / Blieberger, J. (1998). Busy Period Duration for Static Priority Scheduling of Database Transactions (TR 183/1-104). http://hdl.handle.net/20.500.12708/32869

1997

• Automatic Symbolic Verification of Real-Time Programs (TR 183/1-75) / Blieberger, J., & Scholz, B. (1997). Automatic Symbolic Verification of Real-Time Programs (TR 183/1-75). http://hdl.handle.net/20.500.12708/32872
• WPP - Programmer's and User's Guide (TR 183/1-74) / Blieberger, J., & Burgstaller, B. (1997). WPP - Programmer’s and User’s Guide (TR 183/1-74). http://hdl.handle.net/20.500.12708/32875
• Scheduling in a Real-Time Environment under Rush-Hour Conditions (TR 183/1-102) / Blieberger, J., & Reinwein, H. (1997). Scheduling in a Real-Time Environment under Rush-Hour Conditions (TR 183/1-102). http://hdl.handle.net/20.500.12708/32870

1996

• Worst-Case Space and Time Complexity of Recursive Procedures / Blieberger, J., & Lieger, R. (1996). Worst-Case Space and Time Complexity of Recursive Procedures. Real-Time Systems, 11(2), 115–144. https://doi.org/10.1007/bf00365315
• Multi-staged discrete loops for real-time systems / Lieger, R., & Blieberger, J. (1996). Multi-staged discrete loops for real-time systems. In Proceedings of the Eighth Euromicro Workshop on Real-Time Systems. EUROMICRO Workshop on Real-Time Systems, l’Aquila, Italy, Austria. https://doi.org/10.1109/emwrts.1996.557943
• Augmenting Ada95 with additional real-time features / Blieberger, J., Lieger, R., & Burgstaller, B. (1996). Augmenting Ada95 with additional real-time features. In A. Strohmeier (Ed.), Reliable Software Technologies — Ada-Europe ’96 (pp. 330–341). Springer-Verlag. https://doi.org/10.1007/bfb0013500
• Zusatzantrag zum FWF-Projekt WOOP (TR 183/1-72) / Blieberger, J. (1996). Zusatzantrag zum FWF-Projekt WOOP (TR 183/1-72). http://hdl.handle.net/20.500.12708/32868
• An Annotated Bibliography on Real-Time Databases (TR 183/1-73) / Blieberger, J. (1996). An Annotated Bibliography on Real-Time Databases (TR 183/1-73). http://hdl.handle.net/20.500.12708/32866

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

• Discrete Loops and Worst Case Performance / Blieberger, J. (1994). Discrete Loops and Worst Case Performance. Computer Languages, 20(3), 193–212. https://doi.org/10.1016/0096-0551(94)90004-3
• The Ackermann-Function Effort in Space and Time (TR 183/1-48) / Lieger, R., & Blieberger, J. (1994). The Ackermann-Function Effort in Space and Time (TR 183/1-48). http://hdl.handle.net/20.500.12708/32863
• Entwurf zur Automatisierung der Lagerbewirtschaftung von Wertpapierdruckereien unter spezieller Berücksichtigung von Hochsicherheitsaspekten (TR 183/1-49) / Pircher, A., Blieberger, J., Janner, U., Schildt, G.-H., & Zadic, M. (1994). Entwurf zur Automatisierung der Lagerbewirtschaftung von Wertpapierdruckereien unter spezieller Berücksichtigung von Hochsicherheitsaspekten (TR 183/1-49). http://hdl.handle.net/20.500.12708/32861

1993

• Ein LaTeX-Style zur Gestaltung von Diplomarbeiten an Instituten der Technisch-Naturwissenschaftlichen Fakultät der Technischen Universität Wien (TR 183/1-34) / Blieberger, J. (1993). Ein LaTeX-Style zur Gestaltung von Diplomarbeiten an Instituten der Technisch-Naturwissenschaftlichen Fakultät der Technischen Universität Wien (TR 183/1-34). http://hdl.handle.net/20.500.12708/32877
• FWF-Projektantrag "Worst Case Performance Objekt-Orientierter Echtzeit-Programme (WOOP)" (TR 183/1-42) / Blieberger, J. (1993). FWF-Projektantrag “Worst Case Performance Objekt-Orientierter Echtzeit-Programme (WOOP)” (TR 183/1-42). http://hdl.handle.net/20.500.12708/32867
• Safe Programmable Logic Controller "SAFE_PLC" (TR-183/1-38) / Blieberger, J., & Schildt, G.-H. (1993). Safe Programmable Logic Controller “SAFE_PLC” (TR-183/1-38). http://hdl.handle.net/20.500.12708/32862

1992

• Preemptive LCFS Scheduling in Hard Real-Time Applications / Blieberger, J., & Schmid, U. (1992). Preemptive LCFS Scheduling in Hard Real-Time Applications. Performance Evaluation, 15(3), 203–215. https://doi.org/10.1016/0166-5316(92)90035-f
• Some Investigations on FCFS Scheduling in Hard Real-Time Applications / Schmid, U., & Blieberger, J. (1992). Some Investigations on FCFS Scheduling in Hard Real-Time Applications. Journal of Computer and System Sciences, 45(3), 493–512. https://doi.org/10.1016/0022-0000(92)90036-i
• FCFS Scheduling in a Hard Real-Time Environment under Rush-Hour Conditions / Blieberger, J., & Schmid, U. (1992). FCFS Scheduling in a Hard Real-Time Environment under Rush-Hour Conditions. BIT Numerical Mathematics, 32(3), 370–383. https://doi.org/10.1007/bf02074875

1991

• Anleitung zur Gestaltung von Projektberichten (TR 183/1-1) / Blieberger, J., & Stöckler, S. (1991). Anleitung zur Gestaltung von Projektberichten (TR 183/1-1). http://hdl.handle.net/20.500.12708/32878
• Skripten zur Übung "Einführung in die Informatik I" (TR 183/1-28) / Bezirgan, A., Blieberger, J., & Kremser, J. (1991). Skripten zur Übung “Einführung in die Informatik I” (TR 183/1-28). http://hdl.handle.net/20.500.12708/32874
• Qualifying Dynamic Task Scheduling in Hard Real-Time Systems: A Novel Approach / Blieberger, J., & Schmid, U. (1991). Qualifying Dynamic Task Scheduling in Hard Real-Time Systems: A Novel Approach. http://hdl.handle.net/20.500.12708/32871
• Skriptum "Entwurf von Automatisierungssystemen mit Ada" (TR 183/1-24) / Blieberger, J. (1991). Skriptum “Entwurf von Automatisierungssystemen mit Ada” (TR 183/1-24). http://hdl.handle.net/20.500.12708/32864

1989

• Untersuchungen bezüglich des Echtzeitverhaltens von Schedulingstrategien / Blieberger, J. (1989). Untersuchungen bezüglich des Echtzeitverhaltens von Schedulingstrategien. Kongress der Österreichischen Mathematischen Gesellschaft, Vienna, Austria, Austria. http://hdl.handle.net/20.500.12708/84165

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

 

• Approaching emergent patterns with Kronecker algebra in industrial agents / Denzler, P. (2023). Approaching emergent patterns with Kronecker algebra in industrial agents [Dissertation, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2023.115403
  Download: PDF (2.54 MB)
• Fusionierung von Dense Visual Odometry für RGB-D Kameras mit dem Ackermann Motion Model / Haubenstock, M. (2018). Fusionierung von Dense Visual Odometry für RGB-D Kameras mit dem Ackermann Motion Model [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2018.61782
  Download: PDF (11.9 MB)
• People tracking using particle filters and an advanced human motion model on mobile robots / Beck, F. (2018). People tracking using particle filters and an advanced human motion model on mobile robots [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2018.40168
  Download: PDF (8.36 MB)
• Spatio-temporal prioritized planning / Binder, B. (2017). Spatio-temporal prioritized planning [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2017.40172
  Download: PDF (2.04 MB)
• Kronecker algebra based analysis of shared memory concurrent systems / Mittermayr, R. (2016). Kronecker algebra based analysis of shared memory concurrent systems [Dissertation, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2016.39780
  Download: PDF (2.32 MB)
• Energy-efficient optimization of railway operation : an algorithm based on Kronecker algebra / Volcic, M. (2014). Energy-efficient optimization of railway operation : an algorithm based on Kronecker algebra [Dissertation, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2014.28129
  Download: PDF (2.78 MB)
• Sicherheitskritische Modelleisenbahnsteuerung in Ada / Volcic, M. (2011). Sicherheitskritische Modelleisenbahnsteuerung in Ada [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-38003
  Download: PDF (1.77 MB)
• Detecting busy waiting by means of static control flow analysis / Kienesberger, G. (2009). Detecting busy waiting by means of static control flow analysis [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-32554
  Download: PDF (738 KB)
• Resource management in an integrated time-triggered architecture / Huber, B. (2008). Resource management in an integrated time-triggered architecture [Dissertation, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-15983
  Download: PDF (4.33 MB)
• Interface design for hardware-in-the-loop simulation of real-time systems / Schlager, M. (2007). Interface design for hardware-in-the-loop simulation of real-time systems [Dissertation, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-17824
  Download: PDF (7.36 MB)
• Symbolic evaluation of imperative programming languages / Burgstaller, B. (2005). Symbolic evaluation of imperative programming languages [Dissertation, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-11235
  Download: PDF (7.17 MB)
• Statische Analyse von Multi-Threading Java-Programmen / Mittermayr, R. (2005). Statische Analyse von Multi-Threading Java-Programmen [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/184520
• Experiment management, performance optimisation, and tool integration in grid computing / Prodan, R. (2004). Experiment management, performance optimisation, and tool integration in grid computing [Dissertation, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-13116
  Download: PDF (10.3 MB)
• Bounding the worst-case execution time of general loops and recursion / Lieger, R. (2002). Bounding the worst-case execution time of general loops and recursion [Dissertation, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/179190