Correctness by construction: Towards verification in hierarchical system development

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

Volumn 1885, Issue , 2000, Pages 163-180

  Majster Cederbaum, Mila ^a   Salger, Frank ^a  

^a UNIVERSITY OF MANNHEIM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; HIERARCHICAL SYSTEMS; LIFE CYCLE; SEMANTICS; SPECIFICATIONS; SYNTACTICS; TEMPORAL LOGIC;

ACTION REFINEMENT; CORRECTNESS BY CONSTRUCTION; INFINITE STATE SYSTEMS; MODAL MU CALCULUS; MODEL-CHECKING TECHNIQUES; OPERATIONAL SEMANTICS; REFINEMENT STEP; SYSTEMS LIFE CYCLE;

MODEL CHECKING;

EID: 23044517958     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10722468_10     Document Type: Conference Paper

References (35)

1. P.C.Attie, and E.A.Emerson. Synthesis of concurrent systems with many similar sequential processes (extended abstract). In ACM, editor, POPL '89. Proceedings of the sixteenth annual A CM symposium on Principles of programming languages, January 11-13, 1989, Austin, TX, pages 191-201, New York, NY, USA, 1989. ACM Press.
2. L. Aceto and M. Hennessy. Adding action refinement to a finite process algebra. Lecture Notes in Computer Science, 510:506-519:1991.
3. R. Alur, T. A. Henzinger, and S. K. Rajamani. Symbolic exploration of transition hierarchies. Lecture Notes in Computer Science, 1384:330-344,1998.
4. In W. P. De Roever G. Rozenberg J.W. De Bakker, editor, REX Workshop on Stepwise Refinement of Distributed Systems: Models, Formalism, Correctness, Mook, The Netherlands, May/June 1989, volume 430 of Lecture Notes in Computer Science. Springer-Verlag, 1990.
5. S. Bensalem, Y. Lakhnech, and S. Owre. Computing abstractions of infinite state systems compositionally and automatically. In Alan J. Hu and Moshe Y. Vardi, editors, Computer-Aided Verification, CAV '98, volume 1427 of Lecture Notes in Computer Science, pages 319-331,Vancouver, Canada, June 1998. Springer-Verlag.
6. R.E. Bryant. Graph-Based Algorithms for Boolean Function Manipulation. IEEE Transactions on Computers, C-35(8):677-691, August 1986.
7. J. Bradfield and C. Stirling. Local model checking for infinite state spaces. Theoretical Computer Science, 96(1):157-174, April 1992.
8. International Conf. on Computer-Aided Verification, volume (LNCS) 407 (1989), 531 (1990), 575 (1991), 663 (1992), 697 (1993), 818 (1994), 939 (1995), 1102 (1996), 1254 (1997), 1427 (1998), 1633 (1999), New York, NY, USA. Springer-Verlag Inc.
9. P. Cousot and R. Cousot. Abstract interpretation frameworks. Journal of Logic and Computation, 2(4):511-547, 1992.
10. E.M. Clarke and E.A. Emerson. Design and Synthesis of Synchronization Skeletons using Branching Time Temporal Logic. In D. Kozen, editor, Proceedings of the Workshop on Logics of Programs, volume 131 of Lecture Notes in Computer Science, pages 52-71, Yorktown Heights, New York, May 1981. Springer-Verlag.
11. E. M. Clarke, T. Filkorn, and S. Jha. Exploiting symmetry in temporal logic model checking. In Courcoubetis, editor, Proceedings of The Fifth Workshop on Computer-Aided Verification, June/July 1993.
12. E. Clarke, D. Grumberg, and D. Long. Model Checking and Abstraction. ACM Transactions on Programming Languages and Systems, 16(5):1512-1542, 1994.
13. R. Cleaveland. The concurrency workbench: A semantics-based verification tool for the verification of concurrent systems. A CM Transactions on Programming Languages and Systems, 15(1):36-72, January 1993.
14. L. Castellano, G. De Michelis, and L. Pomello. Concurrency vs interleaving: an instructive example. Bulletin of the European Association for Theoretical Computer Science, 31:12-15, February 1987. Technical Contributions.
15. P. Cousot. Abstract interpretation. Symposium on Models of Programming Languages and Computation, ACM Computing Surveys, 28(2):324-328, June 1996.
16. M. Dam. CTL* and ECTL* as fragments of the modal u-calculus. Theoretical Computer Science, 126(1):77-96, April 1994.
17. E.A.Emerson, and C.L.Lei. Efficient model checking in fragments of the propositional u-calculus. In Symposium on Logic in. Computer Science (LICS '86), pages 267-278, Washington, D.C., USA, June 1986. IEEE Computer Society Press.
18. E. A. Emerson and A. P. Sistla. Symmetry and model checking. In C. Cour-coubetis, editor, Proceedings of The Fifth Workshop on Computer-Aided Verificaton, June/July 1993.
19. U. Goltz, R. Gorrieri, and A. Rensink. On syntactic and semantic action refinement. Lecture Notes in Computer Science, 789:385-404, 1994.
20. R. Gorrieri and A. Rensink. Action refinement. Technical Report UBLCS-99-9, University of Bologna (Italy). Department of Computer Science.,April 1999.
21. S. Graf. Verification of distributed cache memory by using abstractions. In David L. Dill, editor, Proceedings of the sixth International Conference on Computer-Aided Verification CAV, volume 818 of Lecture Notes in Computer Science, pages 207-219, Standford, California, USA, June 1994. Springer-Verlag.
22. M. Huhn. Action refinement and property inheritance in systems of sequential agents. In Ugo Montanari and Vladimiro Sassone, editors, CONCUR '96: Concurrency Theory, 7th International Conference, volume 1119 of Lecture Notes in Computer Science, pages 639-654, Pisa, Italy, 26-29 August 1996. Springer-Verlag.
23. H. Hungar. Local model checking for parallel compositions of context-free processes. Lecture Notes in Computer Science, 836:114-128, 1994.
24. D. Kozen. Results on the propositional mu -calculus. Theoretical Computer Science, 27(3):333-354, December 1983.
25. D.E. Long, A. Browne, E. M. Clarke, S. Jha, and W. R. Marrero. An improved algorithm for the evaluation of fixpoint expressions. In David L. Dill, editor, Proceedings ofthe sixth International Conference on Computer-Aided Verification CAV, volume 818 of Lecture Notes in Computer Science, pages 338-350, Standford, California, USA, June 1994. pringer-Verlag.
26. R. Milner. A Calculus of Communicating Systems. Springer, Berlin, 1 edition, 1980.
27. [MW84] Z. Manna and P. Wolper. Synthesis of communicating processes form temporal logic specifications. ACM Transactions on Programming Languages and Systems, 6:68-93, 1984.
28. D. Peled. Ten years of partial order reduction. Lecture Notes in Computer Science, 1427:17-28, 1998.
29. A. Pnueli and R. Rosner. On the synthesis of a reactive module. In ACM, editor, POPL 89. Proceedings ofthe sixteenth annual ACM symposium on Principles of programming languages, January 11-13, 1989, Austin, TX,pages 179-190.New York, NY, USA, 1989. ACM Press.
30. R. Paige and R. E. Tarjan. Three partition refinement algorithms. SIAM Journal on Computing, 16(6):973-989.December 1987.
31. H. Sai'di and N. Shankar. Abstract and model check while you prove. In Nicolas Halbwachs and Doron Peled, editors, Computer-Aided Verification, CAV 99, volume 1633 of Lecture Notes in Computer Science, pages 443-454, Trento, Italy, July 1999.Springer-Verlag.
32. C. Stirling. Local model checking games (extended abstract). In Insup Lee and Scott A. Smolka, editors, CONCUR '95: Concurrency Theory, 6th International Conference, volume 962 of Lecture Notes in Computer Science, pages 1-11, Philadelphia, Pennsylvania, 21-24 August 1995. Springer-Verlag.
33. C. Stirling. Modal and temporal logics for processes. Lecture Notes in Computer Science, 1043:149-237, 1996.
34. C. Stirling and D. Walker. Local model checking in the modal mu-calculus. Theoretical Computer Science, 89(1):161-177, October 1991.
35. R. van Glabbeek and U. Goltz. Equivalence notions for concurrent systems and refinement of actions. In A. Kreczmar and G. Mirkowska, editors, Proceedings of the Conference on Mathematical Foundations of Computer Science, volume 379 of LNCS, pages 237-248, Berlin, August28 September-1 1989. Springer.