PLTL-Partitioned Model Checking for Reactive Systems under Fairness Assumptions

ACM Transactions on Embedded Computing Systems

Volumn 4, Issue 2, 2005, Pages 267-301

  Chouali, S ^a   Julliand, J ^a   Masson, P A ^a   Bellegarde, F ^a  

^a UNIVERSITÉ DE FRANCHE COMTÉ   (France)

Author keywords

Design; fairness assumptions; out of core model checking; PLTL model checking; Refinement design; Verification

Indexed keywords

EID: 84977546439     PISSN: 15399087     EISSN: 15583465     Source Type: Journal    
DOI: 10.1145/1067915.1067918     Document Type: Article

References (40)

1. Abrial, J.-R., 1996. Extending B without changing it (for developing distributed systems). In 1st Conference on the B Method. Nantes, France, 169-190.
2. Abrial, J.-R., Mussat, L., 1998. Introducing dynamic constraints in B. In 2nd Conference on the B Method, France. Lecture Notes in Computer Science, vol. 1393. Springer-Verlag, Berlin, 83-128.
3. Alur, R., Alfaro De, L., Henzinger, T. A., and Mang, F. Y. C. 1999. Automating modular verification. In Proceedings of the 10th Conference on Concurrency Theory. Lecture Notes in Computer Science, vol. 1664. Springer-Verlag, Berlin, 82-97.
4. Bellegarde, F., Chouali, S., Julliand, J., Kouchnarenko, O., 2001. Comment limiter la specification de l'equite dans les systemes d'evenements B. In Approches Formelles dans l'Assistance au Développement de Logiciels (AFADL'01). Nancy, France, 205-220.
5. Bellegarde, F., Julliand, J., Kouchnarenko, O., 2000. Ready-simulation is not ready to express a modular refinement relation. In Proceedings of International Conference on Fondamental Aspects of Software Engineering, FASE'2000. Lecture Notes in Computer Science, vol. 1783. Springer-Verlag, Berlin, 266-283.
6. Bellegarde, F., Julliand, J., Kouchnarenko, O., 2002. Synchronized parallel composition of event systems in B. In Formal Specification and Development in Z and B, Proceedings of the 2nd International Conference of B and Z Users, (ZB 2002), Grenoble, France, D. Bert, J. P. Bowen, M. C. Henson, and K. Robinson, Eds. LNCS, vol. 2272. Springer, Berlin, 436-457.
7. Burch, J. R., Clarke, E. M., Mcmillan, K. L., Dill, D. L., Hwang, L. J., 1990. Symbolic model checking : 1020 states and beyond. In Proceedings of the 5th Annual IEEE Symposium on Logic in Computer Science. IEEE Computer Society Press, Philadelphia, PA, 428-439.
8. Cheung, S., Giannakopoulou, D., Kramer, J., 1997. Verification of liveness properties using compositional reachability analysis. In ESEC/SIGSOFTFSE, 6th European Software Engineering Conference. Lecture Notes in Computer Science, vol. 1301. Springer-Verlag, Berlin, 227-243.
9. Chouali, S., 2003. Contribution du raffinement a la vErification de sysèmes sous hypothEses d'quite. Ph.D. Thesis, University de Franche-Comte, Besancon, France.
10. Chouali, S., Jullid, J. 2003. Model checking des proprietes dynamiques sous hypotheses d'equite, exploitant le raffinement. In Approches Formelles dans l'Assistance au Developpement de Logiciels (AFADL03), Rennes, France, 277-291.
11. Clarke, E. M., Emerson, E. A., Sistla, P. 1986. Automatic verification of finite-state concurrent systems using temporal logic specification. In ACM Transactions on Programming Languages and Systems 2, 244-263.
12. Clarke, E.M., Grumberg, O., Long, D. E. 1994. Model checking and abstraction. ACMTrans-actions on Programming Languages and Systems 16, 5, 1512-1542.
13. Clarke, E. M., Long, D. E., Mcmill, K. L. 1989. Compositional model checking. In Proceedings of the 4th Annual Symposium on Logic in Computer Science. IEEE Computer Society Press, Pacific Grove, CA, 353-362.
14. Clarke, E. M. J., Grumberg, O., Peled, D. A. 1999. Model Checking. MIT Press, Cambridge, MA.
15. Cousot, P. D., Cousot, R., 1977. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In 4th ACM Symposium on Principles of Programming Languages (POPL'77). ACM Press, Los Angeles, CA, 238-252.
16. Darlot, C., Jullid, J., Kouchnarenko, O. 2003. Refinement preserves PLTL properties. In 3rd International Conference of B and Z Users, ZB'03, Turku, Finland. LNCS, vol. 2651. 408-420.
17. Dill, D., Hu, A., and Wong-Toi, H. 1991. Checking for language inclusion using simulation relation. In Proceedings of Computer Aided Verification (CAV91). LNCS, vol. 575. 255-265.
18. Dingel, J., and Filkorn, T. 1995. Model checking for infinite state systems using data abstraction, assumption-commitment style reasoning and theorem proving. In Computer Aided Verification, CAV95. Lecture Notes in Computer Science, vol. 939. Springer-Verlag, Lige, 54-69.
19. Grumberg, O., Long, D. E. 1994. Model checking and modular verification. ACM Transactions on Programming Languages and Systems 16, 3 (May), 843-871.
20. Henzinger, T., Kupferman, O., Rajami, S., 1997. Fair simulation. In Proceedings of the 8th Conference on Concurrency Theory. LNCS, vol. 1243. Springer-Verlag, Warsaw, Poland, 273-287.
21. Holzmann, G., 1991. Design and Validation of Computer Protocols. Prentice-Hall software series.
22. Julliand, J., Masson, P.-A., Mountassir, H., 2001. Verification par model-checking modulaire des proprietes dynamiques introduites en B. Technique et Science Informatiques 20, 7 (Sept.), 927-957.
23. Katz, S., Peled, D. A., 1988. An efficient verification method for parallel and distributed programs. In Workshop on Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency. LNCS, vol. 354. Springer-Verlag, Berlin, 489-507.
24. Kesten, Y., Klein, A., Pnueli, A., Raviv, G., 1999. A perfecto verification: combining model checking with deductive analysis to verify real-life software. in Formal Methods 99, Toulouse, France. Lecture Notes in Computer Science, vol. 1708. Springer-Verlag, Berlin, 173-194.
25. Kesten, Y., Pnueli, A., and Raviv, L. 1998. Algorithmic verification of linear temporal logic specifications. In Proceedings of the 25th International Colloquium on Automata, Languages, and Programming (ICALP 1998). LNCS, vol. 1443. Springer-Verlag, Berlin, 1-16.
26. Kesten, Y., Pnueli, A., Raviv, L., Shahar, E., 2001. Model checking with strong fairness. Tech. Rep. MCS01-07, Weizmann Institute of Science.
27. Kupferman, O., Vardi, M., 1996. Verification of fair transition systems. In Proceedings 8th International Conference on Computer Aided Verification (CAV96). LNCS, vol. 1102. SpringerVerlag, Berlin, 372-382.
28. Kupferman, O., Vardi, M. Y., 1998. Modular model checking. In Compositionality Workshop, COMPOS'97. Lecture Notes in Computer Science, vol. 1536. Springer-Verlag, Berlin, 381-401.
29. Kurshan, R., Levin, V., Minea, M., Peled, D., Yenign, H., 2002. Combining software and hardware verification techniques. Formal Methods in System Design 21, 251-280.
30. Kurshan, R. P., Lamport, L., 1993. Verification of a multiplier: 64-bits and beyond. In Proceedings of the 5th International Conference on Computer Aided Verification (CAV93). LNCS, vol. 697. Springer-Verlag, Elounda, Greece, 166-179.
31. Lichtenstein, O., Pnueli, A., 1985. Checking that finite state concurrent programs satisfy their linear specification. In Proceedings of the 12th ACM Symposium on Principles of Programming Languages (POPL85), New Orleans, USA. 97-107.
32. Manna, Z., Pnueli, A., 1992. The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer-Verlag, Berlin.
33. Manna, Z., Pnueli, A., 1995. Temporal Verification of Reactive Systems: Safety. SpringerVerlag, Berlin.
34. Masson, P.-A., 2001. Verification par model-checking modulaire de proprietes dynamiques PLTL exprimees dans le cadre de specifications B evenementielles. Ph.D. Thesis, Universite de Franche-Comt.
35. Masson, P.-A., Mountassir, H., Julliand, J., 2000. Modular verification for a class of PLTL properties. In Proceedings of the 2nd International Conference on Integrated Formal Methods (IFM2000), Dagstuhl Castle, Germany, LNCS, vol. 1945. Springer-Verlag, Berlin, 398-419.
36. Mcmillan, K., 1993. Symbolic Model-Checking. Kluwer Dordrecht.
37. Queille, J.-P., Sifakis, J., 1982. Specification and verification of concurrent systems in CESAR. In Proceedings of the International Symposium on Programming, Turin, Italy. LNCS, vol. 137. Springer-Verlag, Berlin, 337-351.
38. Toledo, S., 1999. A survey of out-of-core algorithms in numerical linear algebra. External Memory Algorithms and Visualization.
39. Vardi, M. Y., Wolper, P., 1986. An automata theoretic approach to automatic program verification. In Proceedings of the 1st IEEE Symposium on Logic in Computer Science (LICS'86), Cambridge, USA. 332-344.
40. Wolper, P., Godefroid, P., 1993. Partial-order methods for temporal verification. In Proceedings of the International Conference on Concurrency Theory (CONCUR'93). LNCS, vol. 715. Springer-Verlag, Hildesheim, 233-246.