Stephen P. Masticola, Barbara G. Ryder  Home/Search
Context Related
| rutgers.edu/pub/tech...lcsrtr141.ps.Z 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: rutgers.edu/pub/technicalrepo... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . Infinite wait anomalies associated with a barrier rendezvous model (e.g., Ada) can be divided into two classes: stalls and deadlocks. Although precise static deadlock detection is NP-hard, we present two polynomial time algorithms which operate on a statically derivable program representation, the sync graph, to certify a useful class of programs free of deadlocks. We identify three conditions local to any deadlocked tasks, and a fourth global condition on all tasks, which must occur in the ... (Update)
Context of citations to this paper: More
...to perform post mortem analysis. Note that statically detecting race condition (resp. deadlock) is NP complete [15] resp. NP hard [14]) and heuristic algorithms are not very accurate. However, it is useful and helpful to students if these potential problems can be...
...of the procedures and tasks, i.e. it is based on the source code of the tasks and procedures and not on their runtime equivalent. In [13 15] static detection of infinite wait anomalies is studied. Clas sic data flow analysis is employed to solve this problem. This allows...
Cited by: More
Analysis of Multithreaded Programs - Rinard (2001) (Correct)
A Conservative Data Flow Algorithm for Detecting All Pairs.. - Naumovich, Avrunin (2001) (Correct)
Symbolic Data Flow Analysis for Detecting - Deadlocks In Ada (Correct)
Active bibliography (related documents): More All
0.6: Static Detection Of Deadlocks In Polynomial Time - Masticola (1993) (Correct)
0.5: Detecting Deadlocks in the Ada accept...do - Stephen P. Masticola (Correct)
0.3: Automated Analysis of Concurrent Systems with the.. - Avrunin, Buy.. (1991) (Correct)
Similar documents based on text: More All
0.1: Sync Signal Processing for Asynchronously Sampled Video Signals - Lares, Rothermel (2000) (Correct)
0.1: Lattice Frameworks for Multisource and Bidirectional Data Flow.. - Masticola (1995) (Correct)
0.1: Parallel List Ranking and other Operations on Lists - Träff (1997) (Correct)
Related documents from co-citation: More All
9: Concurrency analysis in the presence of procedures using a data flow framework (context) - Duesterwald, Soffa - 1991
8: A General-Purpose Algorithm for Analyzing Concurrent Programs (context) - Taylor - 1983
8: Flow Analysis of Computer Programs (context) - Hecht - 1977
BibTeX entry: (Update)
S. P. Masticola and B. G. Ryder, Static Infinite Wait Anomaly Detection in Polynomial Time, LCSR-TR-114,Laboratory for Computer Science Research, Rutgers University, 1990. http://citeseer.ist.psu.edu/masticola90static.html More
@inproceedings{ masticola90static,
author = "Stephen P. Masticola and Barbara G. Ryder",
title = "Static Infinite Wait Anomaly Detection in Polynomial Time",
booktitle = "Proceedings of 1990 International Conference on Parallel Processing",
address = "University Park PA",
pages = "II.78--II.87",
year = "1990",
url = "citeseer.ist.psu.edu/masticola90static.html" }
Citations (may not include all citations):225 Flow analysis of computer programs (context) - Hecht - 1977
86 A general-purpose algorithm for analyzing concurrent program.. (context) - Taylor - 1983
65 Complexity of analyzing the synchronization structure of con.. (context) - Taylor - 1983
48 Static analysis of low-level synchronization (context) - Callahan, Subhlok - 1988
35 An empirical study of FORTRAN programs (context) - Knuth - 1971
27 Task interaction graphs for concurrency analysis (context) - Long, Clarke - 1989
26 Automatic detection of nondeterminacy in parallel programs (context) - Emrath, Padua - 1988
26 A practical algorithm for static analysis of parallel progra.. (context) - McDowell - 1989
22 Detection of Ada static deadlocks using Petri net invariants (context) - Murata, Shenker et al. - 1989
20 Static infinite wait anomaly detection in polynomial time - Masticola, Ryder - 1990
15 A static analysis of CSP programs (context) - Apt - 1983
14 Constrained expressions: adding analysis capabilities to des.. (context) - Avrunin, Dillon et al. - 1986
6 Verifying general safety properties of Ada tasking programs (context) - Dillon - 1990
2 Static detection of deadlocks (context) - Saxena - 1977
1 Static Infinite Wait Anomaly Detection in Polynomial Time 18.. (context) - Coffman, Denning - 1973
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.rutgers.edu/pub/technical-reports/): More
Constrained REDO: An Alternative to REPLAY - Liew, Steinberg (1993) (Correct)
Jambalaya: Using Multicast for Blind Distributed Web Searching .. - Navas, Hirsh (1998) (Correct)
Law-Governed Regularities in Software Systems - Minsky (1994) (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