DELFIN+: An efficient deadlock detection tool for CCS processes

Journal of Computer and System Sciences

Volumn 72, Issue 8, 2006, Pages 1397-1412

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

^a UNIVERSITY OF SANNIO   (Italy)

Author keywords

CCS; Deadlock; Heuristic search; Model checking; State explosion

Indexed keywords

COMPUTER SYSTEM RECOVERY; FINITE AUTOMATA; HEURISTIC METHODS; MATHEMATICAL MODELS; PROBLEM SOLVING;

DEADLOCK DETECTION; HEURISTIC SEARCH; MODEL CHECKING; STATE EXPLOSION;

ERROR CORRECTION;

EID: 33750436585     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/j.jcss.2006.03.003     Document Type: Article

References (47)

1. Aceto L. The solitaire. URL:. http://www.cs.auc.dk/~luca/DAT4/solitaire.cwb
2. Anastasi G., Bartoli A., and De Francesco N. Efficient verification of a multicast protocol for mobile computing. Comput. J. 44 1 (2001) 21-30
3. Alur R., and Wang B.-Y. "Next" heuristic for on-the-fly model checking. Proceedings of the 10th International Conference on Concurrency Theory. CONCUR '99. Lecture Notes in Comput. Sci. vol. 1664 (1999) 98-113
4. Anastasi G., Spadoni F., and Bartoli A. Group multicast in distributed mobile systems with unreliable wireless network. SRDS '99: Proceedings of the 18th IEEE Symposium on Reliable Distributed Systems. IEEE Comput. Soc. vol. 14 (1999) 14-23
5. Arnold A., Begay D., and Crubille P. Construction and Analysis of Transition Systems with MEC (1994), World Scientific (Chapter 6)
6. Barbuti R., De Francesco N., Santone A., and Vaglini G. Selective mu-calculus and formula-based abstractions of transition systems. J. Comput. System Sci. 59 3 (1999) 537-556
7. Behrmann G., Fehnker A., Hune T.S., Larsen K., Petterson P., and Romijn J. Efficient guiding towards cost-optimality in UPPAAL. Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems. TACAS '01. Lecture Notes in Comput. Sci. vol. 2031 (2001) 174-188
8. Bensalem S., Bouajjani A., Loiseaux C., and Sifakis J. Property preserving simulations. Proceedings of the Fourth Workshop on Computer Aided Verification. CAV '92. Lecture Notes in Comput. Sci. vol. 663 (1992) 260-273
9. Bertoli P., Cimatti A., Slaney J., and Thiebaux S. Solving power supply restoration problems with planning via symbolic model-checking. Proceedings of the Sixth International Conference on AI Planning & Scheduling. AIPS '02 (2002), AAAI Press 23-29
10. Bolognesi T., and Brinksma E. Introduction to ISO specification language LOTOS. Comp. Networks ISDN Systems 14 (1987) 25-59
11. Bloem R., Ravi K., and Somenzi F. Efficient decision procedures for model checking of linear time logic properties. Proceedings of the 11th International Conference on Computer-Aided Verification. CAV '99. Lecture Notes in Comput. Sci. vol. 1633 (1999) 222-235
12. Bouajjani A., Fernandez J.C., and Halbwachs N. Minimal model generation. Proceedings of the International Conference on Computer-Aided Verification. CAV '90. Lecture Notes in Comput. Sci. vol. 531 (1990) 197-203
13. Bradfield J., and Stirling C. Verifying temporal properties of processes. CONCUR '90: Theories of Concurrency-Unification and Extension, Proc. (1990), Springer-Verlag 115-125
14. Brebner G.J. A CCS-based investigation of deadlock in a multi-process electronic mail system. Formal Aspect Comput. 5 5 (1993) 467-478
15. Bruns G. A case study in safety-critical design. Proceedings of the Fourth International Workshop on Computer-Aided Verification. CAV '92 (1992), Springer-Verlag 220-233
16. Clarke E.M., Grumberg O., and Long D.E. Model checking and abstraction. ACM Trans. Program. Lang. Syst. 16 5 (1994) 1512-1542
17. Clarke E.M., Grumberg O., and Peled D. Model Checking (2000), MIT Press
18. Cleaveland R., and Sims S. The NCSU concurrency workbench. Proceedings of the Eighth International Conference on Computer-Aided Verification. CAV '96. Lecture Notes in Comput. Sci. vol. 1102 (1996) 394-397
19. The context management application server element. URL:. http://www.cs.uvic.ca/~bmkapron/ccs.html
20. De Francesco N., and Santone A. Syntactic reductions for efficient deadlock analysis. Softw. Test. Verif. Reliab. 12 3 (2002) 173-186
21. De Francesco N., Santone A., and Vaglini G. State space reduction by non-standard semantics for deadlock analysis. Sci. Comput. Program. 30 3 (1998) 309-338
22. Edelkamp S., and Reffel F. OBDDs in heuristic search. Proceedings of the 22nd Annual German Conference on Artificial Intelligence. KI '98. Lecture Notes in Comput. Sci. vol. 1504 (1998) 81-92
23. Edelkamp S., Lluch-Lafuente A., and Leue S. Directed explicit model checking with HSF-SPIN. Proceedings of the 8th International SPIN Workshop on Model Checking Software. Lecture Notes in Comput. Sci. vol. 2057 (2001) 57-79
24. Edelkamp S., Lluch-Lafuente A., and Leue S. Trail-Directed Model Checking. Electron. Notes Theor. Comput. Sci. vol. 55 (2001)
25. Godefroid P. Partial-Order Methods for the Verification of Concurrent Systems. Lecture Notes in Comput. Sci. vol. 1032 (1996)
26. Godefroid P., and Khurshid S. Exploring very large state spaces using genetic algorithms. Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems. TACAS '02. Lecture Notes in Comput. Sci. vol. 2280 (2002) 266-280
27. Godefroid P., and Wolper P. Using partial orders for efficient verification of deadlock freedom and safety properties. Proceedings of the Third International Conference on Computer-Aided Verification. CAV '91. Lecture Notes in Comput. Sci. vol. 575 (1991) 332-342
28. Graf S., Steffen B., and Luttgen G. Compositional minimization of finite state systems using interface specifications. Formal Aspects Comput. 8 5 (1996) 607-616
29. Gradara S., Santone A., and Villani M.L. Using heuristic search for finding deadlocks in concurrent systems. Inform. and Comput. 202 2 (2005) 191-226
30. Groote J.F., and van de Pol J. A bounded retransmission protocol for large data packets. Algebraic Methodology and Software Technology (1996) 536-550
31. Havelund K., and Shankar N. Experiments in theorem proving and model checking for protocol verification. FME '96: Industrial Benefit and Advances in Formal Methods (1996), Springer-Verlag 662-681
32. Helmink L., Sellink M.P.A., and Vaandrager F.W. Proof-checking a data link protocol. TYPES '93: Proceedings of the International Workshop on Types for Proofs and Programs. Lecture Notes in Comput. Sci. vol. 806 (1994) 127-165
33. Jard C., and Jéron T. Bounded-memory algorithms for verification on-the-fly. Proceedings of the Third International Conference on Computer-Aided Verification. CAV '91. Lecture Notes in Comput. Sci. vol. 575 (1991) 192-201
34. Jensen R.M., Bryant R.E., and Veloso M.M. 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 668-673
35. Lluch-Lafuente A., Edelkamp S., and Leue S. Partial order reduction in directed model checking. Proceedings of the 9th International SPIN Workshop on Model Checking Software. Lecture Notes in Comput. Sci. vol. 2318 (2002) 112-127
36. McMillan K. Symbolic Model Checking (1993), Kluwer Academic, Boston
37. Milner R. Communication and Concurrency (1989), Prentice Hall
38. Moller M.O., and Alur R. Heuristics for hierarchical partitioning with application to model checking. Proceedings of the 11th IFIP WG 10.5, Advanced Research Working Conference on Correct Hardware Design and Verification Methods. CHARME '01. Lecture Notes in Comput. Sci. vol. 2144 (2001) 71-85
39. Park J., and Song S. TCP model checking using concurrency WorkBench. URL: (2002). http://www.dcs.warwick.ac.uk/~doron/Report.doc
40. Pearl J. Heuristics: Intelligent Search Strategies for Computer Problem Solving (1984), Addison-Wesley
41. Peled D. All from one, one for all, on model-checking using representatives. Proceedings of the Fifth International Conference on Computer-Aided Verification. CAV '93. Lecture Notes in Comput. Sci. vol. 679 (1993) 409-423
42. Santone A. Heuristic search + local model checking in selective mu-calculus. IEEE Trans. Softw. Engrg. 29 6 (2003) 510-523
43. Sifakis J. Property preserving homomorphisms of transition systems. Logics of Programs. Lecture Notes in Comput. Sci. vol. 164 (1983)
44. Stirling C. An introduction to modal and temporal logics for CCS. Concurrency: Theory, Language, and Architecture. Lecture Notes in Comput. Sci. vol. 391 (1989)
45. Stirling C., and Walker D. Local model checking in the modal mu-calculus. Theoret. Comput. Sci. 89 (1991) 161-177
46. Valmari A. A stubborn attack on state explosion. Proceedings of the Second International Conference on Computer-Aided Verification. CAV '90. Lecture Notes in Comput. Sci. vol. 531 (1990) 156-165
47. Yang C.H., and Dill D.L. Validation with guided search of the state space. Proceedings of the 35th Conference on Design Automation. DAC '98 (1998) 599-604