Efficiently verifiable conditions for deadlock-freedom of large concurrent programs

Lecture Notes in Computer Science

Volumn 3385, Issue , 2005, Pages 465-481

  Attie, Paul C ^a,b   Chockler, Hana ^b,c  

^a Northeastern University   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c WORCESTER POLYTECHNIC INSTITUTE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SYSTEM RECOVERY; DATA STORAGE EQUIPMENT; FINITE AUTOMATA; POLYNOMIAL APPROXIMATION; QUEUEING THEORY;

FINITE STATE PROGRAMS; POLYNOMIAL TIME ALGORITHMS; SHARED MEMORIES; VERIFICATION;

COMPUTER PROGRAMMING;

EID: 24144495514     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-30579-8_30     Document Type: Conference Paper

References (28)

1. A. Aldini and M. Bernardo. A general approach to deadlock freedom verification for software architectures. In FM 2003, pp. 658-677, LNCS 2805.
2. Tamarah Arons, Amir Pnueli, Sitvanit Ruah, Jessie Xu, and Lenore D. Zuck. Parameterized verification with automatically computed inductive assertions. In CAV, pp. 221-234, 2001.
3. P. C. Attie. Synthesis of large concurrent programs via pairwise composition. In CONCUR, LNCS 1664, 1999.
4. P. C. Attie and E. A. Emerson. Synthesis of concurrent systems with many similar processes. ACM Trans. Program. Lang. Syst., 20(1):51-115, 1998.
5. P.C. Attie. Synthesis of large dynamic concurrent programs from dynamic specifications. Technical report, NEU, Boston, MA, 2003.
6. P.C. Attie. Finite-state concurrent programs can be expressed pairwise. Technical report, NEU, Boston, MA, 2004.
7. Armin Biere, Alessandro Cimatti, Edmund M. Clarke, and Yunshan Zhu. Symbolic model checking without bdds. In TACAS, pp. 193-207, 1999.
8. E. M. Clarke, O.Grumberg, and D. Peled. Model Checking. MIT Press, Cambridge, MA, 2000.
9. E.M. Clarke, R. Enders, T. Filkorn, and S. Jha. Exploiting symmetry in temporal logic model checking. FMSD, 9(2), 1996.
10. E.G. Coffman, M.J. Elphick, and A. Shoshani. System deadlocks. ACM Comput. Surv., 3:67-78, 1971.
11. T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein. Introduction to Algorithms; Second Edition. MIT Press and McGraw-Hill, 2001.
12. E. W. Dijkstra. A Discipline of Programming. Prentice-Hall Inc., 1976.
13. E. A. Emerson and V. Kahlon. Reducing model checking of the many to the few. In CAD, pp. 236-254, 2000.
14. E. Allen Emerson and A. Prasad Sistla. Symmetry and model checking. FMSD, 9(1/2):105-131, 1996.
15. E. A. Emerson and E. M. Clarke. Using branching time temporal logic to synthesize synchronization skeletons. Sci. Comput. Program., 2:241-266, 1982.
16. P. Godefroid. Partial Order Methods for the Verification of Concurrent Systems. PhD thesis, University of Liege, 1994.
17. P. Godefroid, D. Peled, and M. Staskauskas. Using partial-order methods in the formal validation of industrial concurrent programs. Trans. on Soft. Eng., 22(7): 496-507, 1996.
18. P. Godefroid and P. Wolper. A partial approach to model checking. Information and Computation, 110(2):305-326, 1991.
19. Gregor Goessler and Joseph Sifakis. Component-based construction of deadlockfree systems. In FSTTCS, pp. 420-433, LNCS 2914, 2003.
20. R. C. Holt. Some deadlock properties of computer systems. ACM Comput. Surv., 4(3): 179-196, 1972.
21. 20 States and Beyond. In LICS, pp. 1-33, 1990.
22. E. Knapp. Deadlock detection in distributed databases. ACM Comput. Surv., 19(4):303-328, 1987.
23. P. Ladkin and B. Simons. Compile-time analysis of communicating processes. In Proc. Int. Conf., on Supercomputing, pp. 248-259, 1992.
24. N. A. Lynch. Distributed Algorithms. Morgan-Kaufmann, 1996.
25. Kenneth L. McMillan. Symbolic Model Checking. Kluwer Academic Publishers, 1993.
26. D. Peled. Partial order reduction: Model-checking using representatives. In MFCS, 1996.
27. B. Rex. Inference of k-process behavior from two-process programs. Master's thesis, School of Computer Science, Florida International University, Miami, FL, April 1999.
28. A. S. Tanenbaum. Modern Operating Systems, second edition. Prentice-Hall, 2001.