D-finder: A tool for compositional deadlock detection and verification

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5643 LNCS, Issue , 2009, Pages 614-619

  Bensalem, Saddek ^a   Bozga, Marius ^a   Nguyen, Thanh Hung ^a   Sifakis, Joseph ^a  

^a VERIMAG   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPONENT BASED SYSTEMS; COMPOSITIONAL METHOD; DEADLOCK DETECTION; POTENTIAL DEADLOCKS; PROOF STRATEGY;

COMPUTER AIDED ANALYSIS;

EID: 70350241655     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02658-4_45     Document Type: Conference Paper

References (19)

1. Alur, R., Henzinger, T.: Reactive modules. In: Proceedings of the 11th Annual Symposium on LICS, pp. 207-208. IEEE Computer Society Press, Los Alamitos (1996)
2. Abadi, M., Lamport, L.: Conjoining specifications. Toplas 17(3), 507-534 (1995)
3. Clarke, E., Long, D., McMillan, K.: Compositional model checking. In: Proceedings of the 4th Annual Symposium on LICS, pp. 353-362 (1989)
4. Chandy, K., Misra, J.: Parallel program design: a foundation. Addison-Wesley Publishing Company, Reading (1988)
5. Grumberg, O., Long, D.E.: Model checking and modular verification. ACM Transactions on Programming Languages and Systems 16(3), 843-871 (1994)
6. McMillan, K.L.: A compositional rule for hardware design refinement. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol. 1254, pp. 24-35. Springer, Heidelberg (1997)
7. Pnueli, A.: In transition from global to modular temporal reasoning about programs, pp. 123-144 (1985)
8. Stark, E.W.: A proof technique for rely/guarantee properties. In: Maheshwari, S.N. (ed.) FSTTCS 1985. LNCS, vol. 206, pp. 369-391. Springer, Heidelberg (1985)
9. Kupferman, O., Vardi, M.Y.: Modular model checking. In: de Roever, W.-P., Langmaack, H., Pnueli, A. (eds.) COMPOS 1997. LNCS, vol. 1536, pp. 381-401. Springer, Heidelberg (1998)
10. Peterson, J.: Petri Net theory and the modelling of systems. Prentice Hall, Englewood Cliffs (1981)
11. Apt, K.R., Francez, N., de Roever, W.P.: A proof system for communicating sequential processes. ACM Trans. Program. Lang. Syst. 2(3), 359-385 (1980)
12. Basu, A., Bozga, M., Sifakis, J.: Modeling heterogeneous real-time components in bip. In: SEFM, pp. 3-12 (2006)
13. Lakhnech, Y., Bensalem, S., Berezin, S., Owre, S.: Incremental verification by abstraction. In: Margaria, T., Yi, W. (eds.) TACAS 2001. LNCS, vol. 2031, pp. 98-112. Springer, Heidelberg (2001)
14. Bradley, A.R., Manna, Z.: Checking safety by inductive generalization of counterexamples to induction. In: FMCAD, pp. 173-180 (2007)
15. Bensalem, S., Lakhnech, Y.: Automatic generation of invariants. FMSD 15(1), 75-92 (1999)
16. Bensalem, S., Bozga, M., Sifakis, J., Nguyen, T.H.: Compositional verification for component-based systems and application. In: Cha, S., Choi, J.-Y., Kim, M., Lee, I., Viswanathan, M. (eds.) ATVA 2008. LNCS, vol. 5311, pp. 64-79. Springer, Heidelberg (2008)
17. Team, O.: The omega library. Version 1.1.0 (1996)
18. Dutertre, B., de Moura, L.: A fast linear-arithmetic solver for DPLL(T). In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 81-94. Springer, Heidelberg (2006)
19. Cobleigh, J.M., Avrunin, G.S., Clarke, L.A.: Breaking up is hard to do: An evaluation of automated assume-guarantee reasoning. ACM TSEM 17(2) (2008)