| 2008 |
| 27 | EE | Raul Fechete,
Georg Kienesberger,
Johann Blieberger:
A Framework for CFG-Based Static Program Analysis of Ada Programs.
Ada-Europe 2008: 130-143 |
| 26 | EE | Robert Mittermayr,
Johann Blieberger:
Static Partial-Order Reduction of Concurrent Systems in Polynomial Time.
ISoLA 2008: 619-633 |
| 2007 |
| 25 | EE | Johann Blieberger,
Bernd Burgstaller,
Robert Mittermayr:
Static Detection of Livelocks in Ada Multitasking Programs.
Ada-Europe 2007: 69-83 |
| 24 | EE | Bernhard Scholz,
Johann Blieberger:
A New Elimination-Based Data Flow Analysis Framework Using Annotated Decomposition Trees.
CC 2007: 202-217 |
| 2006 |
| 23 | EE | Bernd Burgstaller,
Johann Blieberger,
Robert Mittermayr:
Static Detection of Access Anomalies in Ada95.
Ada-Europe 2006: 40-55 |
| 22 | EE | Bernd Burgstaller,
Bernhard Scholz,
Johann Blieberger:
Symbolic Analysis of Imperative Programming Languages.
JMLC 2006: 172-194 |
| 21 | EE | Johann Blieberger:
Average case analysis of DJ graphs.
J. Discrete Algorithms 4(4): 649-675 (2006) |
| 2004 |
| 20 | EE | Bernd Burgstaller,
Johann Blieberger,
Bernhard Scholz:
On the Tree Width of Ada Programs.
Ada-Europe 2004: 78-90 |
| 2003 |
| 19 | EE | Johann Blieberger,
Bernd Burgstaller,
Bernhard Scholz:
Busy Wait Analysis.
Ada-Europe 2003: 142-152 |
| 18 | EE | Johann Blieberger,
Bernd Burgstaller:
Eliminating Redundant Range Checks in GNAT Using Symbolic Evaluation.
Ada-Europe 2003: 153-167 |
| 2002 |
| 17 | | Johann Blieberger,
Alfred Strohmeier:
Reliable Software Technologies - Ada-Europe 2002, 7th Ada-Europe International Conference on Reliable Software Technologies, Vienna, Austria, June 17-21, 2002, Proceedings
Springer 2002 |
| 16 | | Johann Blieberger:
Data-Flow Frameworks for Worst-Case Execution Time Analysis.
Real-Time Systems 22(3): 183-227 (2002) |
| 2001 |
| 15 | EE | Johann Blieberger:
Real-Time Properties of Indirect Recursive Procedures.
Inf. Comput. 171(2): 156-182 (2001) |
| 2000 |
| 14 | | Johann Blieberger,
Bernd Burgstaller,
Bernhard Scholz:
Symbolic Data Flow Analysis for Detecting Deadlocks in Ada Tasking Programs.
Ada-Europe 2000: 225-237 |
| 13 | EE | Bernhard Scholz,
Johann Blieberger,
Thomas Fahringer:
Symbolic Pointer Analysis for Detecting Memory Leaks.
PEPM 2000: 104-113 |
| 12 | | Johann Blieberger,
Thomas Fahringer,
Bernhard Scholz:
Symbolic Cache Analysis for Real-Time Systems.
Real-Time Systems 18(2/3): 181-215 (2000) |
| 1999 |
| 11 | EE | Johann Blieberger,
Bernd Burgstaller,
Bernhard Scholz:
Interprocedural Symbolic Evaluation of Ada Programs with Aliases.
Ada-Europe 1999: 136-145 |
| 10 | EE | Johann Blieberger,
Johann Klasek,
eva Kühn:
Ada Binding to a Shared Object Layer.
Ada-Europe 1999: 263-274 |
| 1998 |
| 9 | EE | Johann Blieberger,
Bernd Burgstaller:
Symbolic Reaching Definitions Analysis of Ada Programs.
Ada-Europe 1998: 238-250 |
| 1996 |
| 8 | | Johann Blieberger,
Roland Lieger,
Bernd Burgstaller:
Augmenting Ada 95 with Additional Real-Time Features.
Ada-Europe 1996: 330-341 |
| 7 | | Johann Blieberger,
Roland Lieger:
Worst-Case Space and Time Complexity of Recursive Procedures.
Real-Time Systems 11(2): 115-144 (1996) |
| 1995 |
| 6 | | Ulrich Schmid,
Johann Blieberger:
On Nonpreemptive LCFS Scheduling with Deadlines.
J. Algorithms 18(1): 124-158 (1995) |
| 1994 |
| 5 | | Johann Blieberger:
Discrete Loops and Worst Case Performance.
Comput. Lang. 20(3): 193-212 (1994) |
| 1992 |
| 4 | | Johann Blieberger,
Ulrich Schmid:
FCFS-Scheduling in a Hard Real-Time Environment Under Rush-Hour Conditions.
BIT 32(3): 370-383 (1992) |
| 3 | | Ulrich Schmid,
Johann Blieberger:
Some Investigations on FCFS Scheduling in Hard Real Time Applications.
J. Comput. Syst. Sci. 45(3): 493-512 (1992) |
| 2 | | Johann Blieberger,
Ulrich Schmid:
Preemptive LCFS Scheduling in Hard Real-Time Applications.
Perform. Eval. 15(3): 203-215 (1992) |
| 1991 |
| 1 | | Johann Blieberger,
Gerhard H. Schildt:
Versuche der Compiler-Validierung.
PEARL 1991: 1-19 |