Verification of liveness properties using compositional reachability analysis

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

Volumn 1301, Issue , 1997, Pages 227-243

  Cheungt, Shing Chi ^a   Giannakopoulou, Dimitra ^b   Kramer, Jeff ^b  

^a HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

^b IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

B chi automata; Compositional verification; Distributed computing systems; Labelled transition systems; Liveness properties; Reachability analysis

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS;

COMPOSITIONAL VERIFICATION; DISTRIBUTED COMPUTING SYSTEMS; LABELLED TRANSITION SYSTEMS; LIVENESS PROPERTIES; REACHABILITY ANALYSIS;

SOFTWARE ENGINEERING;

EID: 84949466858     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (27)

1. S. Aggarwal, C. Courcoubetis, and P, Wolper, “Adding Liveness Properties to Coupled Finite-State Machines,” ACM Transactions on Programming Languages and Systems, vol. 12, no. 2,, 1990.
2. A. V. Aho, J. E. Hopcroft, and J. D. Ullman, Data Structures and Algorithms: Addison-Wesley, 1983.
3. B. Alpern and F. B. Schneider, "Verifying Temporal Properties without Temporal Logic," ACM Transactions on Programming Languages and Systems, vol. 11, no. 1, pp. 147-167, 1989.
4. G. R. Andrews, Concurrent Programming - Principles and Practice: The Benjamin / Cummings Publishing Company Ltd., 1991.
5. G. S. Avrunin, U. A. Buy, J. C. Corbett, L. K. Dillon, and J. C. Wileden, "Automated Analysis of Concurrent Systems with the Constrained Expression Toolset," IEEE Transactions on Software Engineering, vol. 17, no. 11, pp. 1204-1222, 1991.
6. T. Bultan, J. Fischer, and R. Gerber, "Compositional Verification by Model Checking for Counter-Examples," presented at International Symposium on Software Testing and Analysis, San Diego, California, January 1996.
7. S. C. Cheung and J. Kramer, "Checking Subsystem Safety Properties in Compositional Reachability Analysis," presented at 18th International Conference on Software Engineering, Berlin, Germany, March 1996.
8. S. C. Cheung and J. Kramer, "Context Constraints for Compositional Reachability Analysis," ACM Transactions on Software Engineering and Methodology,, October 1996.
9. E. M. Clarke, D. E. Long, and K. L. McMillan, "Compositional Model Checking," presented at 4th Annual Symposium on Logic in Computer Science, Pacific Grove, California, June 1989.
10. H.-C. Fernandez, L, Mounier, C, Jard, and T. Jéron, "On-the-fly Verification of Finite Transition Systems," in Computer-Aided Verification, R. Kurshan, Ed.: Kluwer Academic Publishers, 1993.
11. C. Ghezzi, M. Jazayeri, and D. Mandrioli, Fundamentals of Software Engineering, Chapter 6: Prentice-Hall, Inc., 1991.
12. D. Giannakopoulou, J. Kramer, and S. C. Cheung, "TRACTA: An Environment for Analysing the Behaviour of Distributed Systems," presented at ACM SIGPLAN Workshop on Automated Analysis of Software, Paris, January 1997.
13. P. Godefroid and G. J. Holzmann, "On the Verification of Temporal Properties," presented at 13th IFIP WG 6.1 International Symposium, on Protocol Specification, Testing, and Verification.
14. P. Gribomont and P. Wolper, "Temporal Logic," in From Modal Logic to Deductive Databases, A. Thayse, Ed.: John Wiley and Sons, 1989.
15. C. A. R. Hoare, Communicating Sequential Processes: Prentice-Hall, 1985.
16. J. Kemppainen, M. Levanto, A. Valmari, and M. Clegg, ""ARA" Puts Advanced Reachability Analysis Techniques Together," presented at 5th Nordic Workshop on Programming Environment Research, Tampere, Finland, January 1992.
17. J. Kramer and J. Magee, "Exposing the Skeleton in the Coordination Closet," presented at Coordination '97, Berlin, September 1997.
18. J. C. Lin and S. Paul, "RMTP: A Reliable Multicast Transport Protocol," presented at IEEE INFOCOMM’96, San Francisco, California, March 1996
19. J. Malhotra, S. A. Smolka, A. Giacalone, and R. Shapiro, "A Tool for Hierarchical Design and Simulation of Concurrent Systems," presented at BCS-FACS Workshop on Specification and Verification of Concurrent Systems, Stirling, Scotland, July 1988.
20. R. Milner, Communication and Concurrency: Prentice-Hall, 1989.
21. A. Rabinovich, "Checking Equivalences Between Concurrent Systems of Finite Agents," presented at 19th International Colloquium on Automata, Languages and Programming, Wien, Austria, July 1992.
22. K. K. Sabnani, A. M. Lapone, and M. Ü. Uyar, "An Algorithmic Procedure for Checking Safety Properties of Protocols," IEEE Transactions on Communications, vol. 37, no. 9, pp. 940-948, September 1989.
23. K. C. Tai and P. V. Koppol, "Hierarchy-Based Incremental Reachability Analysis of Communication Protocols," presented at IEEE International Conference on Network Protocols, San Francisco, California, October 1993.
24. A. Valmari. Alleviating State Explosion during Verification of Behavioural Equivalence, Technical Report, A-1992, Department of Computer Science, University of Helsinki, Finland, August 1992.
25. W. J. Yeh. Controlling State Explosion in Reachability Analysis, Technical Report, SERC-TR-147-P, SERC, Purdue University, December 1993.
26. W. J. Yeh and M. Young, "Compositional Reachability Analysis Using Process Algebra," presented at Symposium on Testing, Analysis, and Verification (TAV4), Victoria, British Columbia, October 8-10, 1991.
27. W. J. Yeh and M. Young, “Hierarchical Tracing of Concurrent Programs,” presented at 3rd Irvine Software Symposium (ISS’93), Irvine, California, April 1993.