Compositional verification for component-based systems and application

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

Volumn 5311 LNCS, Issue , 2008, Pages 64-79

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

^a VERIMAG   (France)

Author keywords

[No Author keywords available]

Indexed keywords

DATA TRANSFER; SPACE RESEARCH;

COMPONENT BASED SYSTEMS; COMPOSITIONAL METHOD; COMPOSITIONAL VERIFICATION; FINITE-STATE ABSTRACTION; MULTI-PARTY INTERACTIONS; POTENTIAL DEADLOCKS; REACHABILITY SET; STATE SPACE EXPLORATION;

SOFTWARE ENGINEERING;

EID: 56749153543     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-88387-6_7     Document Type: Conference Paper

References (24)

1. 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)
2. Alur, R., Henzinger, T.: Reactive modules. In: Proceedings of the 11th Annual Symposium on LICS, pp. 207-218. IEEE Computer Society Press, Los Alamitos (1996)
3. Abadi, M., Lamport, L.: Conjoining specification. ACM Transactions on Programming Languages and Systems 17(3), 507-534 (1995)
4. Clarke, E., Long, D., McMillan, K.: Compositional model checking. In: Proceedings of the 4th Annual Symposium on LICS, pp. 353-362. IEEE Computer Society Press, Los Alamitos (1989)
5. Chandy, K., Misra, J.: Parallel program design: a foundation. Addison-Wesley Publishing Company, Reading (1988)
6. Grumberg, O., Long, D.E.: Model checking and modular verification. ACM Transactions on Programming Languages and Systems 16(3), 843-871 (1994)
7. 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)
8. Pnueli, A.: In transition from global to modular temporal reasoning about programs, 123-144 (1985)
9. 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)
10. Cobleigh, J.M., Avrunin, G.S., Clarke, L.A.: Breaking up is hard to do: An evaluation of automated assume-guarantee reasoning. ACM Transactions on Software Engineering and Methodology 17(2) (2008)
11. Peterson, J.: Petri Net theory and the modelling of systems. Prentice-Hall, Englewood Cliffs (1981)
12. 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)
13. Basu, A., Bozga, M., Sifakis, J.: Modeling heterogeneous real-time components in bip. In: SEFM, pp. 3-12 (2006)
14. Team, O.: The omega library. Version 1.1.0 (November 1996)
15. 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)
16. Alur, R., Courcoubetis, C., Halbwachs, N., Henzinger, T.A., Ho, P.H., Nicollin, X., Olivero, A., Sifakis, J., Yovine, S.: The algorithmic analysis of hybrid systems. TCS 138(1), 3-34 (1995)
17. 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)
18. Bradley, A.R., Manna, Z.: Checking safety by inductive generalization of counterexamples to induction. In: FMCAD, pp. 173-180 (2007)
19. Bensalem, S., Lakhnech, Y.: Automatic generation of invariants. FMSD 15(1), 75-92 (1999)
20. Sifakis, J.: Structural properties of petri nets. In: Winkowski, J. (ed.) MFCS 1978. LNCS, vol. 64, pp. 474-483. Springer, Heidelberg (1978)
21. Yamauchi, M., Watanabe, T.: Time complexity analysis of the minimal siphon extraction problem of petri nets. IEICE Transactions on Communications/Electronics/Information and Systems (1999)
22. Tanimoto, S., Yamauchi, M., Watanabe, T.: Finding minimal siphons in general petri nets. IEICE Trans. on Fundamentals in Electronics, Communications and Computer Science E79-A(11), 1817-1824 (1996)
23. Bensalem, S., Lakhnech, Y., Owre, S.: Computing abstractions of infinite state systems automatically and compositionally. In: Y. Vardi, M. (ed.) CAV 1998. LNCS, vol. 1427, pp. 319-331. Springer, Heidelberg (1998)
24. Bensalem, S., Lakhnech, Y., Owre, S.: Invest: A tool for the verification of invariants. In: Y. Vardi, M. (ed.) CAV 1998. LNCS, vol. 1427, pp. 505-510. Springer, Heidelberg (1998)