Using heuristic search for finding deadlocks in concurrent systems

Information and Computation

Volumn 202, Issue 2, 2005, Pages 191-226

  Gradara, Sara ^a   Santone, Antonella ^a   Villani, Maria Luisa ^a  

^a UNIVERSITY OF SANNIO   (Italy)

Author keywords

CCS; Deadlock; Heuristic search; State explosion

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; CONCURRENT ENGINEERING; MATHEMATICAL MODELS; PROBLEM SOLVING;

CCS; DEADLOCK; HEURISTIC SEARCH; STATE EXPLOSION;

HEURISTIC METHODS;

EID: 26444611478     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1016/j.ic.2005.07.004     Document Type: Article

References (63)

1. G. Anastasi, A. Bartoli, N. De Francesco, and A. Santone Efficient verification of a multicast protocol for mobile computing Comput. J. 44 1 2001 21 30
2. G. Anastasi, A. Bartoli, F. Spadoni, Group multicast in distributed mobile systems with unreliable wireless network, in: Proceedings of the 18th IEEE Symposium on Reliable Distributed Systems (SRDS'99), Lausanne (CH), October 18-21, 1999.
3. R. Alur, B.-Y. Wang. "Next" heuristic for on-the-fly model checking, in: Proceedings of the 10th International Conference on Concurrency Theory (CONCUR'99), Lecture Notes in Computer Science, vol. 1664, 1999, pp. 98-113.
4. T. Ball, R. Majumdar, T. Millstein, S.K. Rajamani, Automatic predicate abstraction of C programs, in: Proceedings of the 2001 ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI 2001), ACM, New York, 2001, pp. 203-213.
5. R. Barbuti, N. De Francesco, A. Santone, and G. Vaglini Selective mu-calculus and formula-based abstractions of transition systems J. Comput. Syst. Sci. 59 3 1999 537 556
6. G. Behrmann, A. Fehnker, T.S. Hune, K. Larsen, P. Petterson, J. Romijn, Efficient guiding towards cost-optimality in UPPAAL, in: Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'01), Lecture Notes in Computer Science, vol. 2031, 2001, pp. 174-188.
7. B. Beizer Software Testing Techniques 1990 International Thomson Computer Press
8. S. Bensalem, A. Bouajjani, C. Loiseaux, J. Sifakis, Property preserving simulations, in: Proceedings of the Fourth Workshop on Computer Aided Verification (CAV'92), Lecture Notes in Computer Science, vol. 663, 1992, pp. 260-273.
9. P. Bertoli, A. Cimatti, J. Slaney, and S. Thiebaux Solving power supply restoration problems with planning via symbolic model-checking Proceedings of the Sixth International Conference on AI Planning and Scheduling (AIPS'02) 2002 AAAI Press New York 23 29
10. R. Bloem, K. Ravi, F. Somenzi, Efficient decision procedures for model checking of linear time logic properties, in: Proceedings of the 11th International Conference on Computer-Aided Verification (CAV'99), Lecture Notes in Computer Science, vol. 1633, 1999, pp. 222-235.
11. A. Bouajjani, J.C. Fernandez, N. Halbwachs, Minimal model generation, in: Proceedings of the International Conference on Computer-Aided Verification (CAV'90), Lecture Notes in Computer Science, vol. 531, 1990, pp. 197-203.
12. A. Bouali, S. Gnesi, and S. Larosa The integration project for the JACK environment Bull. EATCS 54 1994 207 223
13. G.J. Brebman A CCS-based investigation of deadlock in a multi-process electronic mail system Formal Aspect Comput. 5 5 1993 467 478
14. R.E. Bryant Graph-based algorithms for boolean function manipulation IEEE Trans. Comput. C-35 8 1986 677 691
15. J. Chen, On verifying distributed multithreaded Java programs, in: Proceedings of the 33rd Annual Hawaii International Conference on System Sciences (HICSS-33), 2000.
16. E.M. Clarke, O. Grumberg, and D.E. Long Model checking and abstraction ACM Trans. Progr. Languages Syst. 16 5 1994 1512 1542
17. E.M. Clarke, O. Grumberg, and D. Peled Model Checking 2000 MIT Press Cambridge, MA
18. E.M. Clarke, D.E. Long, K.L. McMillan, Compositional model checking, in: Proceedings of the Fourth Annual IEEE Symposium on Logic in Computer Science, 1989, pp. 353-362.
19. R. Cleaveland, The Concurrency Workbench of North Carolina, Alternating Bit Protocol (ABP). < www.dcs.ed.ac.uk/home/cwb/Examples/ccs/abp.cwb >.
20. R. Cleaveland, S. Sims, The NCSU Concurrency Workbench, in: Proceedings of the Eighth International Conference on Computer-Aided Verification (CAV'96), Lecture Notes in Computer Science, vol. 1102, 1996, pp. 394-397.
21. J. Corbett Evaluating deadlock detection methods for concurrent software IEEE Trans. Software Eng. 22 3 1996 161 180
22. J. Corbett, M. Dwyer, J. Hatcliff, C. Pasareanu, Robby, S. Laubach, and H. Zheng Bandera: extracting finite-state models from Java source code Proceedings of the 22nd International Conference on Software Engineering 2000 2000 ACM Press New York 439 448
23. M. Dam, Compositional proof systems for model checking infinite state processes, in: Proceedings of the 6th International Conference on Concurrency Theory (CONCUR'95), Lecture Notes in Computer Science, vol. 962, 1995, pp. 12-26.
24. S. Das, D.L. Dill, S. Park, Experience with predicate abstraction, in: Proceedings of the 11th International Conference on Computer-Aided Verification (CAV'99), Lecture Notes in Computer Science, vol. 1633, 1999, pp. 160-171.
25. N. De Francesco, A. Santone, and G. Vaglini State space reduction by non-standard semantics for deadlock analysis Sci. Comput. Progr. 30 3 1998 309 338
26. N. De Francesco, and A. Santone Syntactic reductions for efficient deadlock analysis Softw. Test. Verif. Rel. 12 3 2002 173 186
27. J. Dingel, T. Filkorn, Model checking for infinite state systems using data abstraction, assumption-commitment style reasoning and theorem proving, in: Proceedings of the 7th International Conference on Computer Aided Verification (CAV'95), Lecture Notes in Computer Science, vol. 939, 1995, pp. 54-69.
28. S. Edelkamp, A. Lluch-Lafuente, S. Leue, Directed explicit model checking with HSF-SPIN, in: Proceedings of the 8th International SPIN Workshop on Model Checking Software, Lecture Notes in Computer Science, vol. 2057, 2001, pp. 57-79.
29. S. Edelkamp, A. Lluch-Lafuente, and S. Leue Trail-directed model checking Electronic Notes Theoret. Comput. Sci. 55 2001
30. S. Edelkamp, F. Reffel, OBDDs in heuristic search, in: Proceedings of the 22nd Annual German Conference on Artificial Intelligence (KI'98), Lecture Notes in Computer Science, vol. 1504, 1998, pp. 81-92.
31. P. Godefroid, Partial-order methods for the verification of concurrent systems, in: Lecture Notes in Computer Science, vol. 1032, 1996.
32. P. Godefroid, S. Khurshid, Exploring very large state spaces using genetic algorithms, in: Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'02), Lecture Notes in Computer Science, vol. 2280, 2002, pp. 266-280.
33. D. Gurov, B. Kapron, Modeling the application layer of an air traffic telecommunications network using CCS. < www.cs.uvic.ca/bmkapron/ccs.html >.
34. P. Godefroid, P. Wolper, Using partial orders for efficient verification of deadlock freedom and safety properties, in: Proceedings of the Third International Conference on Computer-Aided Verification (CAV'91), Lecture Notes in Computer Science, vol. 575, 1991, pp. 332-342.
35. J. Gosling, B. Joy, G. Steele, G. Bracha, The Java Language Specification, second ed., Addison-Wesley, Reading, MA, 2000, ISBN 0-201-31008-2.
36. S. Gradara, A. Santone, M.L.Villani, Efficient Verification of Java Programs, Technical Report, TR-RCOST 12/03, April 2003.
37. S. Graf, B. Steffen, and G. Luttgen Compositional minimization of finite state systems using interface specifications Formal Aspects Comput. 8 5 1996 607 616
38. A. Groce, W. Visser, Heuristic model checking for Java programs, in: Proceedings of the 9th International SPIN Workshop(SPIN'02), Lecture Notes in Computer Science, vol. 2318, 2002, pp. 242-245.
39. O. Grumberg, and D.E. Long Model checking and modular verification ACM Trans. Progr. Languages Syst. 16 3 1994 843 871
40. P. Hart, D.J. Nilsson, and B. Raphael A formal basis fo heuristic determination of minimum path cost IEEE Trans. Syst. Sci. Cybern. 100 4 1968
41. A. Holub Taming Java Threads 2000 APress
42. C. Jard, T. Jéron, Bounded-memory algorithms for verification on-the-fly, in: Proceedings of the Third International Conference on Computer-Aided Verification (CAV'91), Lecture Notes in Computer Science, vol. 575, 1991, pp. 192-201.
43. R.M. Jensen, R.E. Bryant, and M.M. Veloso SetA*: An efficient BDD-based heuristic search algorithm Proceedings of the Eighteenth National Conference on Artificial Intelligence and Fourteenth Conference on Innovative Applications of Artificial Intelligence (AAAI/IAAI'02) 2002 AAAI Press New York 668 673
44. B. Karacali, K.C. Tai, Model checking based on simultaneous reachability analysis, in: Proceedings of the SPIN 2000 Conference on Model Checking of Computer Software, Lecture Notes in Computer Science, 2000, pp. 34-53.
45. A. Lluch-Lafuente, S. Edelkamp, S. Leue, Partial order reduction in directed model checking, in: Proceedings of the 9th International SPIN Workshop on Model Checking Software, Lecture Notes in Computer Science, vol. 2318, 2002, pp. 112-127.
46. E. Madelaine, D. Vergamini, Finiteness conditions and structural construction of automata for all process algebras, in: Proceedings of 2nd Workshop on Computer-Aided Verification, DIMACS Technical Report 90-31, 1990.
47. K. McMillan Symbolic Model Checking 1993 Kluwer Academic Publishers Boston
48. K. McMillan, Verification of infinite state systems by compositional model checking, in: Proceedings of the 10th Correct Hardware Design and Verification Methods International Conference on Concurrency Theory (CHARME'99), Lecture Notes in Computer Science, vol. 1703, 1999, pp. 219-234.
49. R. Milner Communication and Concurrency 1989 Prentice-Hall Englewood Cliffs, NJ
50. M.O. Moller, R. Alur, Heuristics for hierarchical partitioning with application to model checking, in: Proceedings of the 11th IFIP WG 10.5, Advanced Research Working Conference on Correct Hardware Design and Verification Methods (CHARME'01), Lecture Notes in Computer Science, vol. 2144, 2001, pp. 71-85.
51. J. Park, S. Song, TCP Model checking using Concurrency WorkBench, < www.dcs.warwick.ac.uk/doron/Report.doc >, 2002.
52. J. Pearl Heuristics: Intelligent Search Strategies for Computer Problem Solving 1984 Addison-Wesley Reading, MA
53. D. Peled, All from one, one for all, on model-checking using representatives, in: Proceedings of the Fifth International Conference on Computer-Aided Verification (CAV'93), Lecture Notes in Computer Science, vol. 679, 1993, pp. 409-423.
54. W. Reisig Petri nets EATCS Monogr. Theoret. Comput. Sci. 4 1985
55. P. Rondogiannis, and M.H.M. Cheng Petri-net-based deadlock analysis of process algebra programs Sci. Comput. Progr. 23 1994 55 89
56. A. Santone Automatic verification of concurrent systems using a formula-based compositional approach Acta Inform. 38 2 2002 531 564
57. A. Santone Heuristic search + local model checking in selective mu-calculus IEEE Trans. Software Eng. 29 6 2003 510 523
58. J. Sifakis, Property preserving homomorphisms of transition systems, in: Logics of Programs, Lecture Notes in Computer Science, vol. 164, 1983.
59. C. Stirling, and D. Walker Local model checking in the modal mu-calculus Theoret. Comput. Sci. 89 1991 161 177
60. K.C. Tai, P.V. Koppol, Hierarchy-based incremental analysis of communication protocols, in: Proceedings of the International Conference on Network Protocols, 1993, pp. 318-325.
61. R.N. Taylor Complexity of analyzing the synchronization structure of concurrent programs Acta Inform. 19 1983 57 84
62. A. Valmari, A stubborn attack on state explosion, in: Proceedings of the Second International Conference on Computer-Aided Verification (CAV'90), Lecture Notes in Computer Science, vol. 531, 1990, pp. 156-165.
63. C.H. Yang, D.L. Dill, Validation with guided search of the state space, in: Proceedings of the 35th Conference on Design Automation (DAC'98), 1998, pp. 599-604.