Automated, compositional and iterative deadlock detection

Proceedings - 2nd ACM and IEEE International Conference on Formal Methods and Models for Co-Design, MEMOCODE'04

Volumn , Issue , 2004, Pages 201-210

  Chaki, Sagar ^a   Clarke, Edmund ^a   Ouaknine, Joël ^a   Sharygina, Natasha ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; AUTOMATION; COMPUTER OPERATING SYSTEMS; FEEDBACK; ITERATIVE METHODS; REAL TIME SYSTEMS;

COMPOSITIONAL REASONING; DIAGNOSTIC FEEDBACK; ITERATIVE DEADLOCK DETECTION; MESSAGE PASSING;

COMPUTER SYSTEM RECOVERY;

EID: 23844542839     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (34)

1. ABB website. http://www.abb.com.
2. T. S. Anantharaman, E. M. Clarke, M. J. Foster, and B. Mishra. Compiling path expressions into VLSI circuits. In Proc. of POPL, 1985.
3. T. Ball and S. K. Rajamani. Automatically validating temporal safety properties of interfaces. In Proc. of SPIN, volume 2057. Springer LNCS, 2001.
4. S. D. Brookes and A. W. Roscoe. Deadlock analysis of networks of communicating processes. Distributed Computing, 4, 1991.
5. S. Chaki, E. Clarke, J. Ouaknine, N. Sharygina, and N. Sinha. State/event-based software model checking. In Proc. of IFM, volume 1999. Springer LNCS, 2004.
6. S. Chaki, E. M. Clarke, A. Groce, S. Jha, and H. Veith. Modular verifi cation of software components in C. In Proc. of ICSE. IEEE Computer Society, 2003.
7. S. Chaki, J. Ouaknine, K. Yorav, and E. Clarice. Automated compositional abstraction refi nement for concurrent C programs: A two-level approach. In Proc. of SoftMC. ENTCS 89(3), 2003.
8. P. Chauhan, E. M. Clarke, J. H. Kukula, S. Sapra, H. Veith, and D. Wang. Automated abstraction refi nement for model checking large state spaces using SAT based conflict analysis. In Proc. of FMCAD, 2002.
9. |9] E. Clarke, O. Grumberg, and D. Peled. Model Checking. MIT Press, 1999.
10. E. M. Clarke, O. Grumberg, S. Jha, Y. Lu, and H. Veith. Counterexample-guided abstraction refi nement. In Proc. of CAV, volume 1855. Springer LNCS, 2000.
11. E. M. Clarke, O. Grumberg, and D. E. Long. Model checking and abstraction. Proc. of TOPLAS, 1994.
12. E. M. Clarke, A. Gupta, J. H. Kukula, and O. Strichman. SAT based abstraction-reft nement using ILP and machine learning techniques. In Proc. of CAV, 2002.
13. J. C. Corbett. Evaluating deadlock detection methods for concurrent software. Software Engineering, 22(3), 1996.
14. P. Cousot and R. Cousot. Abstract interpretation: A unifi ed lattice model for static analysis of programs by construction or approximation of fi xpoints. In Proc. of the SIGPLAN Conference on Programming Languages, 1977.
15. C. Demartini, R. Iosif, and R. Sisto. A deadlock detection tool for concurrent Java programs. Software: Practice & Experience, 29(7), 1999.
16. Formal Systems (Europe) Ltd. website. http://www.fsel.com.
17. O. Grumberg and D. Long. Model checking and modular verifi cation. ACM Trans. on Programming Languages and Systems, 16(3), 1994.
18. T. A. Henzinger, R. Jhala, R. Majumdar, and G. Sutre. Lazy abstraction. In Proc. of POPL, 2002.
19. T. A. Henzinger, S. Qadeer, and S. K. Rajamani. Decomposing refi nement proofs using assume-guarantee reasoning. In Proc. of ICCAD, 2000.
20. C. A. R. Hoare. Communicating Sequential Processes. Prentice Hall, 1985.
21. R. P. Kurshan. Analysis of discrete event coordination. In Proc. REX Workshop 89, volume 430. Springer LNCS, 1989.
22. R. P. Kurshan. Computer-aided verification of coordinating processes: the automata-theoretic approach. Princeton University Press, 1994.
23. Y. Lakhnech, S. Bensalem, S. Berezin, and S. Owre. Incremental verifi cation by abstraction. In Proc. of TAC AS, volume 2031. Springer LNCS, 2001.
24. MAGIC, www.cs.cmu.edu/~chaki/magic.
25. J. M. R. Martin and Y. Huddart. Parallel algorithms for dead-lock and livelock analysis of concurrent systems. In Proc. of Comm. Process Architectures, 2000.
26. J. M. R. Martin and S. Jassim. A tool for proving deadlock freedom. In Proc. of the 20th World Occam and Transputer User Group Technical Meeting, 1997.
27. K- L. McMillan. A compositional rule for hardware design refi nement. In Proc. of CAV, volume 1254. Springer LNCS, 1997.
28. R. Milner. Communication and Concurrency. Prentice-Hall, 1989.
29. G. Naumovich, L. A. Clarke, L. J. Osterweil, and M. B. Dwyer. Verifi cation of concurrent software with FLAYERS. In Proc. of ICSE. ACM Press, 1997.
30. R. Paige and R. E. Tarjan. Three partition refi nement algorithms. SIAM Journal of Computing, 16(6), 1987.
31. C. S. Pǎsǎreanu, M. B. Dwyer, and W. Visser. Finding feasible counter-examples when model checking abstracted Java programs. In Proc. of TACAS, 2001.
32. A. W. Roscoe. The Theory and Practice of Concurrency. Prentice-Hall, 1997.
33. A. W. Roscoe and N. Dathi. The pursuit of deadlock freedom. Information and Computation, 75(3), 1987.
34. S. Graf and H. Saïdi. Construction of abstract state graphs with PVS. In Proc. of CAV, volume 1254. Springer LNCS, 1997.