Pei-yu Li, Bruce McMillin  Home/Search
Context
Related
| umr.edu/techrpt/postscript/9406.ps 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: umr.edu/techrpt/abstracts (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: A large number of published distributed deadlock detection/resolution algorithms are found to be incorrect because they have used informal approaches to prove the correctness of their algorithms. In this paper, we present a formal approach for the correctness proof and give an example of the proof. In this proposed approach, a formal model of distributed deadlock is presented with a local-time deadlock specification for correctness verification. With the formal model, we have an insight into... (Update)
Similar documents (at the sentence level):
9.9%: Formal Model and Specification of Deadlock - Pei-Yu Li (1993) (Correct)
Active bibliography (related documents): More All
0.7: Survey of Deadlock Detection in Distributed Concurrent.. - Shih, Stankovic (1990) (Correct)
0.6: Deadlock detection in distributed database systems: A.. - Krivokapic, Kemper.. (Correct)
0.4: Deadlock Detection in Distributed Real-Time Systems and Its.. - Shih, Stankovic (1991) (Correct)
Similar documents based on text: More All
0.3: Distributed Deadlock Detection Algorithm - Obermarck (1982) (Correct)
0.2: A Deadlock Absence Proof Technique - Applied To Multiple (Correct)
0.1: Distributed Deadlock Detection in Mobile Agent Systems - Ashfield, Deugo, Oppacher.. (2000) (Correct)
BibTeX entry: (Update)
@misc{ li-formal,
author = "Pei-yu Li and Bruce McMillin",
title = "Formal Verification of Distributed Deadlock Detection Algorithm Using a
Time-dependent Proof Technique",
url = "citeseer.ist.psu.edu/156046.html" }
Citations (may not include all citations):104 Proving liveness properties of concurrent programs (context) - Owicki, Lamport - 1982 ACM DBLP
36 Deadlock detection in distributed databases (context) - Knapp - 1987 ACM DBLP
31 Deadlock detection in distributed systems (context) - Singhal - 1989 ACM DBLP
28 A proof technique for communicating sequential processes (context) - Levin, Gries - 1981 DBLP
15 Locking and deadlock detection in distributed data bases (context) - Menasce, Muntz - 1979 DBLP
13 Using message passing for distributed programming: proof rul.. - Schlichting, Schineider - 1984
12 A modified priority based probe algorithm for distributed de.. (context) - Choudhary, Kohler et al. - 1989 ACM DBLP
10 A priority based distributed deadlock detection algorithm (context) - Sinha, Natarajan - 1985 DBLP
9 Distributed deadlock detection algorithm - Obermarck - 1982 ACM DBLP
7 Fault-tolerant distributed deadlock detection/resolution (context) - Li, McMillin - 1993
4 Efficient deadlock resolution for lockbased concurrency cont.. (context) - Roesler, Burkhard et al. - 1988
2 A distributed algorithm for deadlock detection and resolutio.. (context) - Sugihara, Kikuno et al. - 1984 ACM DBLP
1 A theory for deadlocks over resources (context) - Tay, Loke - 1993
1 Formal model and specification of deadlock - Li, McMillin - 1993
Documents on the same site (http://www.cs.umr.edu/techrpt/abstracts.html): More
Formal Model and Specification of Deadlock - Pei-Yu Li (1993) (Correct)
Teaching the Practice of Formal Methods in Distributed.. - Arrowsmith, McMillin (1994) (Correct)
Generating Indexing Functions of Regularly Sparse Arrays for.. - Scott Thibault (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