Johann Blieberger

Orcid: 0000-0001-5810-7335

Affiliations:
  • TU Wien, Vienna, Autria


According to our database1, Johann Blieberger authored at least 47 papers between 1987 and 2022.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Utilising Kronecker Algebra to Detect Unexpected Behaviour in Distributed Systems.
Proceedings of the 25th IEEE International Symposium On Real-Time Distributed Computing, 2022

2021
Deadlock and WCET analysis of barrier-synchronized concurrent programs.
Computing, 2021

2020
Design-space evaluation for non-blocking synchronization in Ada: lock elision of protected objects, concurrent objects, and low-level atomics.
J. Syst. Archit., 2020

2018
Safe Non-blocking Synchronization in Ada 202x.
CoRR, 2018

Safe Non-blocking Synchronization in Ada2x.
Proceedings of the Reliable Software Technologies - Ada-Europe 2018, 2018

2017
Parallel Construction of Simultaneous Deterministic Finite Automata on Shared-Memory Multicores.
Proceedings of the 46th International Conference on Parallel Processing, 2017

Lazy Parallel Kronecker Algebra-Operations on Heterogeneous Multicores.
Proceedings of the Euro-Par 2017: Parallel Processing - 23rd International Conference on Parallel and Distributed Computing, Santiago de Compostela, Spain, August 28, 2017

2016
Kronecker Algebra for Static Analysis of Barriers in Ada.
Proceedings of the Reliable Software Technologies - Ada-Europe 2016, 2016

2015
Efficient Construction of Simultaneous Deterministic Finite Automata on Multicores Using Rabin Fingerprints.
CoRR, 2015

2014
Kronecker Algebra for Static Analysis of Ada Programs with Protected Objects.
Proceedings of the Reliable Software Technologies, 2014

2012
StreamPI: a stream-parallel programming extension for object-oriented programming languages.
J. Supercomput., 2012

A symbolic analysis framework for static analysis of imperative programming languages.
J. Syst. Softw., 2012

Timing Analysis of Concurrent Programs.
Proceedings of the 12th International Workshop on Worst-Case Execution Time Analysis, 2012

2011
Shared Memory Concurrent System Verification using Kronecker Algebra
CoRR, 2011

2010
AdaStreams: A Type-Based Programming Extension for Stream-Parallelism with Ada 2005.
Proceedings of the Reliable Software Technologiey, 2010

2008
Static Partial-Order Reduction of Concurrent Systems in Polynomial Time.
Proceedings of the Leveraging Applications of Formal Methods, 2008

Average Case Analysis of Some Elimination-Based Data-Flow Analysis Algorithms.
Proceedings of the Scalable Program Analysis, 13.04. - 18.04.2008, 2008

A Framework for CFG-Based Static Program Analysis of Ada Programs.
Proceedings of the Reliable Software Technologies, 2008

2007
A New Elimination-Based Data Flow Analysis Framework Using Annotated Decomposition Trees.
Proceedings of the Compiler Construction, 16th International Conference, 2007

Static Detection of Livelocks in Ada Multitasking Programs.
Proceedings of the Reliable Software Technologies, 2007

2006
Average case analysis of DJ graphs.
J. Discrete Algorithms, 2006

Symbolic Analysis of Imperative Programming Languages.
Proceedings of the Modular Programming Languages, 7th Joint Modular Languages Conference, 2006

Static Detection of Access Anomalies in Ada95.
Proceedings of the Reliable Software Technologies, 2006

2004
On the Tree Width of Ada Programs.
Proceedings of the Reliable Software Technologies, 2004

2003
Busy Wait Analysis.
Proceedings of the Reliable Software Technologies, 2003

Eliminating Redundant Range Checks in GNAT Using Symbolic Evaluation.
Proceedings of the Reliable Software Technologies, 2003

2002
Data-Flow Frameworks for Worst-Case Execution Time Analysis.
Real Time Syst., 2002

2001
Real-Time Properties of Indirect Recursive Procedures.
Inf. Comput., 2001

2000
Symbolic Cache Analysis for Real-Time Systems.
Real Time Syst., 2000

Symbolic Pointer Analysis for Detecting Memory Leaks.
Proceedings of the 2000 ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation (PEPM '00), 2000

Symbolic Data Flow Analysis for Detecting Deadlocks in Ada Tasking Programs.
Proceedings of the Reliable Software Technologies, 2000

1999
Ada Binding to a Shared Object Layer.
Proceedings of the Reliable Software Technologies, 1999

Interprocedural Symbolic Evaluation of Ada Programs with Aliases.
Proceedings of the Reliable Software Technologies, 1999

1998
Symbolic Reaching Definitions Analysis of Ada Programs.
Proceedings of the Reliable Software Technologies, 1998

1996
Worst-Case Space and Time Complexity of Recursive Procedures.
Real Time Syst., 1996

Multi-Staged Discrete Loops for Real-Time Systems.
Proceedings of the Eighth Euromicro Workshop on Real-Time Systems, 1996

Augmenting Ada 95 with Additional Real-Time Features.
Proceedings of the Reliable Software Technologies, 1996

Informatik
Springers Lehrbücher der Informatik, Springer, ISBN: 978-3-211-82860-1, 1996

1995
On Nonpreemptive LCFS Scheduling with Deadlines.
J. Algorithms, 1995

Loops for Safety Critical Applications.
Proceedings of the 14th International Conference on Computer Safety, 1995

Real-time recursive procedures.
Proceedings of the 7th Euromicro Workshop on Real-Time Systems, 1995

1994
Discrete Loops and Worst Case Performance.
Comput. Lang., 1994

1992
Preemptive LCFS Scheduling in Hard Real-Time Applications.
Perform. Evaluation, 1992

Some Investigations on FCFS Scheduling in Hard Real Time Applications.
J. Comput. Syst. Sci., 1992

FCFS-Scheduling in a Hard Real-Time Environment Under Rush-Hour Conditions.
BIT, 1992

1991
Versuche der Compiler-Validierung.
Proceedings of the PEARL 91, 1991

1987
Monotonically labelled Motzkin trees.
Discret. Appl. Math., 1987


  Loading...