Incremental invariant generation for compositional design

Proceedings - 2010 4th International Symposium on Theoretical Aspects of Software Engineering, TASE 2010

Volumn , Issue , 2010, Pages 157-167

  Bensalem, Saddek ^a   Legay, Axel ^b   Nguyen, Thanh Hung ^a   Sifakis, Joseph ^a   Yan, Rongjie ^a  

^a VERIMAG   (France)

^b CAMPUS DE BEAULIEU   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPONENT BASED SYSTEMS; COMPOSITIONAL METHOD; DEADLOCK FREEDOM; FIXED-POINT CHARACTERIZATION; REACHABILITY SET; TOOLSETS; VERIFICATION PROCESS;

DESIGN;

SOFTWARE ENGINEERING;

EID: 78149486289     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/TASE.2010.23     Document Type: Conference Paper

References (35)

1. M. Abadi and L. Lamport. Conjoining specification. ACM Transactions on Programming Languages and Systems, 17(3):507-534, 1995.
2. R. Alur and T. Henzinger. Reactive modules. In Proceedings of the 11th Annual Symposium on LICS, pages 207-208. IEEE Computer Society Press, 1996.
3. A. Annichini, E. Asarin, and A. Bouajjani. Symbolic techniques for parametric reasoning about counter and clock systems. In Proc. 12th Int. Conference on Computer Aided Verification (CAV), volume 1855 of Lecture Notes in Computer Science, pages 419-434. Springer, 2000.
4. A. Basu, M. Bozga, and J. Sifakis. Modeling heterogeneous real-time components in BIP. In SEFM '06, pages 3-12, Pune, India, 2006.
5. S. Bensalem, M. Bozga, T.-H. Nguyen, and J. Sifakis. Compositional verification for component-based systems and application. In ATVA, pages 64-79, Seoul, 2008.
6. S. Bensalem, M. Bozga, T.-H. Nguyen, and J. Sifakis. D-Finder: A tool for compositional deadlock detection and verification. In CAV, volume 5643 of Lecture Notes in Computer Science, pages 614-619. Springer, 2009.
7. S. Bensalem and Y. Lakhnech. Automatic generation of invariants. FMSD, 15(1):75-92, July 1999.
8. BIP - incremental component-based construction of real-time systems. http://www-verimag.imag.fr/ async/bip.php.
9. B. Boigelot. Symbolic Methods for Exploring Infinite State Spaces. Collection des publications de la Faculté des Sciences Appliquées de l'Université de Liège, Liège, Belgium, 1999.
10. B. Boigelot, A. Legay, and P. Wolper. Iterating transducers in the large (extended abstract). In Proc. 15th Int. Conference on Computer Aided Verification (CAV), Lecture Notes in Computer Science, pages 223-235. Springer, 2003.
11. K. Chandy and J.Misra. Parallel program design: a foundation. Addison-Wesley Publishing Company, 1988.
12. M. R. V. Chaudron, E. M. Eskenazi, A. V. Fioukov, and D. K. Hammer. A framework for formal component-based software architecting. In In Workshop on Specification and Verification of Component-Based Systems, 2001.
13. A. Cimatti, E. Clarke, F. Giunchiglia, and M. Roveri. NuSMV: a new symbolic model checker. Int. Journal on STTT, 2:2000, 2000.
14. E. Clarke, D. Long, and K. McMillan. Compositional model checking. In Proc. of the 4th Annual Symposium on LICS, pages 353-362. IEEE Press, 1989.
15. E. M. Clarke, O. Grumberg, and D. A. Peled. Model checking. The MIT Press, 1999.
16. J. M. Cobleigh, G. S. Avrunin, and L. A. Clarke. Breaking up is hard to do: An evaluation of automated assume-guarantee reasoning. ACM Trans. Softw. Eng. Methodol., 17(2), 2008.
17. Combest. http://www.combest.eu.com.
18. B. Dutertre and L. de Moura. A fast linear-arithmetic solver for DPLL(T). In CAV'06, volume 4144 of LNCS, pages 81-94, 2006.
19. G. Gössler and J. Sifakis. Composition for component-based modeling. Sci. Comput. Program., 55(1-3):161-183, 2005.
20. O. Grumberg and D. E. Long. Model checking and modular verification. ACM Transactions on Programming Languages and Systems, 16(3):843-871, 1994.
21. D. Heimbold and D. Luckham. Debugging Ada tasking programs. IEEE Softw., 2(2):47-57, 1985.
22. J-P.Queille and J.Sifakis. Specification and verification of concurrent systems in cesar. In Symposium on Programming, volume 137 of Lecture Notes in Computer Science. Springer, 1982.
23. J.R. Burch, E.M. Clarke, K.L. McMillan, D.L. Dill, and L.J. Hwang. Symbolic Model Checking: 1020 States and Beyond. In Proceedings of the Fifth Annual IEEE Symposium on Logic in Computer Science, pages 1-33, Washington, D.C., 1990. IEEE Computer Society Press.
24. O. Kupferman and M. Y. Vardi. An automata-theortetic approach to modular model checking. ACM Trans. Program. Lang. Syst., 22(1):87-128, 2000.
25. K. L. McMillan. A compositional rule for hardware design refinement. In CAV '97, pages 24-35. Springer-Verlag, 1997.
26. S. S. Patil. Limitations and Capabilities of Dijkstra's Semaphore Primitives for Coordination among Processes. Cambridge, Mass.: MIT, Project MAC, Computation Structures Group Memo 57, Feb, 1971.
27. D. Peled. All from one, one for all: on model checking using representatives. In CAV '93: Proceedings of the 5th International Conference on Computer Aided Verification, pages 409-423, London, UK, 1993. Springer-Verlag.
28. A. Pnueli. The temporal logic of programs. Foundations of Computer Science, Annual IEEE Symposium on, 0:46-57, 1977.
29. A. Pnueli. In transition from global to modular temporal reasoning about programs. Logics and models of concurrent systems, pages 123-144, 1985.
30. J. Sifakis. A framework for component-based construction extended abstract. In SEFM '05: Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods, pages 293-300, Washington, DC, USA, 2005. IEEE Computer Society.
31. F. Somenzi. CUDD: CU decision diagram package release 2.2.0.
32. E. W. Stark. A proof technique for rely/guarantee properties. In FSTTCS: proceedings of the 5th conference, volume 206, pages 369-391. Springer-Verlag, 1985.
33. O. Team. The Omega library. Version 1.1.0, November 1996.
34. M. Y. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification (preliminary report). In Proc. 2nd IEEE Symposium on Logic in Computer Science (LICS), pages 332-344. IEEE Computer Society, 1986.
35. P. Wolper and P. Godefroid. Partial-order methods for temporal verification. In Proc. 4th Int. Conference on Concurrency Theory (CONCUR), volume 715 of Lecture Notes in Computer Science, pages 233-246. Springer, 1993.