Johann Blieberger, Bernd Burgstaller, Bernhard Scholz  Home/Search
Context Related
Links: ACM DBLP | auto.tuwien.ac.at/~blieb/...tasks.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: auto.tuwien.ac.at/~blieb...papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . It is well accepted that designing and analyzing concurrent software-components are tedious tasks. Assuring the quality of such software requires formal methods, which can statically detect deadlocks. This paper presents a symbolic data flow analysis framework for detecting deadlocks in Ada programs with tasks. The symbolic data flow framework is based on symbolic evaluation -- an advanced technique to statically determine properties of programs. The framework can guarantee the... (Update)
Context of citations to this paper: More
.... developed a variety of analyses for detecting potential deadlocks in Ada programs which use rendezvous synchronization [95, 99, 69, 29, 66, 34, 24, 16, 12]. A rendezvous takes place between a call statement in one thread and an accept statement in another. The analyses match...
Cited by: More
A Generic Approach to the Static Analysis of Concurrent .. - Bouajjani, Esparza.. (2003) (Correct)
Analysis of Multithreaded Programs - Rinard (2001) (Correct)
Similar documents (at the sentence level):
72.5%: Symbolic Data Flow Analysis for Detecting - Deadlocks In Ada (Correct)
Active bibliography (related documents): More All
0.6: Data-Flow Frameworks for Worst-Case Execution Time Analysis - Blieberger (2000) (Correct)
0.4: Symbolic Pointer Analysis for Detecting Memory Leaks - Scholz, Blieberger, Fahringer (2000) (Correct)
0.4: Symbolic Cache Analysis for Real-Time Systems - Blieberger, Fahringer, Scholz (1999) (Correct)
Similar documents based on text: More All
1.1: Interprocedural Symbolic Evaluation of Ada Programs with .. - Blieberger.. (1999) (Correct)
1.1: Symbolic Reaching Definitions Analysis of Ada Programs - Blieberger, Burgstaller (1998) (Correct)
0.7: On the Tree Width of Ada Programs - Burgstaller, Blieberger, Scholz (Correct)
Related documents from co-citation: More All
5: Concurrency analysis in the presence of procedures using a data flow framework (context) - Duesterwald, Soffa - 1991
5: A General-Purpose Algorithm for Analyzing Concurrent Programs (context) - Taylor - 1983
4: A unified approach to global program optimization (context) - Kildall - 1973
BibTeX entry: (Update)
Blieberger, J., B. Burgstaller, and B. Scholz: 2000a, `Symbolic Data Flow Analysis for Detecting Deadlocks in Ada Tasking Programs'. In: Ada-Europe'2000 International Conference on Reliable Software Technologies. Potsdam, Germany. (to appear). http://citeseer.ist.psu.edu/article/blieberger00symbolic.html More
@inproceedings{ blieberger00symbolic,
author = "J.~Blieberger and B.~Burgstaller and B.~Scholz",
title = "{Symbolic Data Flow Analysis for Detecting Deadlocks in Ada Tasking Programs}",
booktitle = "Proc. of the Ada-Europe International Conference on Reliable Software Technologies",
address = "Potsdam, Germany",
year = "2000",
url = "citeseer.ist.psu.edu/article/blieberger00symbolic.html" }
Citations (may not include all citations):86 Evaluating deadlock detection methods for concurrent softwar.. - Corbett - 1996 ACM DBLP
86 A general-purpose algorithm for analyzing concurrent program.. (context) - Taylor - 1983 ACM DBLP
50 Elimination algorithms for data flow analysis (context) - Ryder, Paull - 1986
30 Combining static concurrency analysis with symbolic executio.. (context) - Young, Taylor - 1988 ACM DBLP
30 Concurrency analysis in the presence of procedures using a d.. (context) - Duesterwald, Soffa
24 Static detection of deadlocks in polynomial time - Masticola - 1993
20 Static infinite wait anomaly detection in polynomial time - Masticola, Ryder - 1990 DBLP
20 Symbolic Evaluation for Parallelizing Compilers - Fahringer, Scholz ACM DBLP
19 Data flow analysis of concurrent systems that use the rendez.. (context) - Long, Clarke ACM DBLP
18 Application and experimental evaluation of state space reduc.. - Duri, Buy et al. - 1994 ACM DBLP
16 Symbolic evaluation and the analysis of programs (context) - Cheatham, Holloway et al. - 1979 DBLP
12 Using symbolic execution for verification of Ada tasking pro.. (context) - Dillon - 1990 ACM DBLP
8 Symbolic reaching definitions analysis of Ada programs - Blieberger, Burgstaller
8 Static concurrency analysis in the presence of procedures (context) - Duesterwald - 1991
6 Symbolic cache analysis for real-time systems - Blieberger, Fahringer et al. - 2000 ACM DBLP
5 Automatic verification of concurrent Ada programs - Bruneton, Pradat-Peyre ACM DBLP
5 Data-flow frameworks for worst-case execution time analysis - Blieberger - 2000 ACM DBLP
4 Interprocedural Symbolic Evaluation of Ada Programs with Ali.. - Blieberger, Burgstaller et al.
3 Static single assignment form for explicitly parallel progra.. - Stoltz, Srinivasan et al. - 1994
2 Partial Evaluation and SemanticsBased Program Manipulation (context) - Scholz, Blieberger et al.
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.auto.tuwien.ac.at/~blieb/papers.html): More
Multi-Staged Discrete Loops for Real-Time Systems - Lieger, Blieberger (Correct)
Symbolic Cache Analysis for Real-Time Systems - Blieberger, Fahringer, Scholz (1999) (Correct)
Worst-Case Space and Time Complexity of Recursive Procedures - Blieberger, LIEGER (1996) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC