The Concurrency Workbench: A Semantics-Based Tool for the Verification of Concurrent Systems

ACM Transactions on Programming Languages and Systems (TOPLAS)

Volumn 15, Issue 1, 1993, Pages 36-72

  Cleaveland, Rance ^a,b   Parrow, Joachim ^c   Steffen, Bernhard ^d  

^a NORTH CAROLINA STATE UNIVERSITY   (United States)

^b UNIVERSITY OF SUSSEX   (United Kingdom)

^c SWEDISH INSTITUTE OF COMPUTER SCIENCE   (Sweden)

^d RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

automatic verification; concurrency; finite state systems; process algebra

Indexed keywords

ALGORITHMS; BOOLEAN ALGEBRA; COMPUTATIONAL LINGUISTICS; COMPUTER HARDWARE DESCRIPTION LANGUAGES; DISTRIBUTED COMPUTER SYSTEMS; FINITE AUTOMATA; NETWORK PROTOCOLS;

AUTOMATIC VERIFICATION; CONCURRENCY WORKBENCH; CONCURRENT SYSTEMS VERIFICATION; FINITE STATE SYSTEMS; MILNER'S CALCULUS OF COMMUNICATING SYSTEMS; PRIMITIVE ALGORITHMS; PROCESS ALGEBRA;

COMPUTER NETWORKS;

EID: 0027342054     PISSN: 01640925     EISSN: 15584593     Source Type: Journal    
DOI: 10.1145/151646.151648     Document Type: Article

References (56)

1. BARTLETT, K. A., SCANTLEBURY, R. A., AND WILKINSON, P. T. A note on reliable full-duplex transmission over half-duplex links. Commun. ACM 12, 5 (May 1969), 260-261.
2. BLOOM, B., ISTRAIL, S., AND MEYER, A. Bisimulation can't be traced. In Proceedings of the ACM Symposium on Principles of Programming Languages (San Diego, Jan. 1988), pp. 229-239.
3. BOUDOL, G., DE SIMONE, R., AND VERGAMINI, D. Experiment with auto and autograph on a simple case sliding window protocol. INRIA Rep. 870, July 1988.
4. CAMILLERI, J., AND WINSKEL, G. CCS with priority choice. In Proceedings of the Sixth Annual Symposium on Logic in Computer Science (Amsterdam, July 1991), Computer Society Press, Los Alamitos, pp. 246-255.
5. CLARKE, E. M., LONG, D. E., AND MCMILLAN, K. L. Compositional model checking. In Proceedings of the Fourth Annual Symposium on Logic in Computer Science. (Asilomar, 1989), Computer Society Press, Los Alamitos, 1991, pp. 353-362.
6. CLARKE, E. M., EMERSON, E., AND SISTLA, A. P. Automatic verification of finite state concurrent systems using temporal logic specifications. ACM Trans. Program. Lang. Syst. 8, 2 (Apr. 1986), 244-263.
7. CLEAVELAND, R. Tableau-based model checking in the propositional Mu-Calculus. Acta Inf. 27, 8 (Sept. 1990), 725-747.
8. CLEAVELAND, R. On automatically distinguishing inequivalent processes. In Computer-Aided Verification ′90 (Piscataway, July 1991), American Mathematical Society, pp. 463-477. American Mathematical Society, Providence, 1991.
9. CLEAVELAND, R., AND HENNESSY, M. C. B. Testing equivalence as a bisimulation equivalence. In Proceedings of the Workshop on Automatic Verification Methods for Finite-State Systems, (Grenoble, June 1989), pp. 11-23. Lecture Notes in Computer Science 407, Springer-Verlag, Berlin, 1989.
10. CLEAVELAND, R., AND HENNESSY, M. C. B Priorities in process algebra. Inf Comput 87, 1/2 (July/Aug. 1990), 58-77.
11. CLEAVELAND, R., PARROW, J., AND STEFFEN, B. The Concurrency Workbench: Operating Instructions. Tech. Note 10, Laboratory for Foundations of Computer Science, Univ of Edinburgh, Sept. 1988.
12. CLEAVELAND, R., PARROW, J., AND STEFFEN, B. A semantics-based tool for the verification of finite-state systems. In Proceedings of the Ninth IFIP Symposium on Protocol Specification, Testing and Verification (Enschede, June 1989), pp. 287-302. North-Holland, Amsterdam, 1990.
13. CLEAVELAND, R., PARROW, J., AND STEFFEN, B. The concurrency workbench. In Proceedings of the Workshop on Automatic Verification Methods for Finite-State Systems (Grenoble, June 1989), pp. 24-37. Lecture Notes in Computer Science 407, Springer-Verlag, Berlin, 1989.
14. CLEAVELAND, R., AND STEFFEN, B. When is ‘partial’ adequate? A logic-based proof technique using partial specifications. In Proceedings of the Fifth Annual Symposium on Logic in Computer Science (Philadelphia, June 1990), pp. 440-449. Computer Society Press, Los Alamitos, 1990.
15. CLEAVELAND, R., AND STEFFEN, B. A preorder for partial process specifications. In Proceedings of CONCUR ′90, (Amsterdam, Aug. 1990), pp. 141-151. Lecture Notes in Computer Science 458, Springer-Verlag, Berlin, 1990.
16. CLEAVELAND, R., AND STEFFEN, B. Computing behavioural relations, logically. In Proceedings of the 18th International Colloquium on Automata. Languages and Programming (Madrid, July 1991), pp. 127-138. Lecture Notes in Computer Science 510, Springer-Verlag, Berlin, 1991.
17. CLEAVELAND, R., AND STEFFEN, B. A linear-time model-checking algorithm for the alternation-free modal Mu-calculus. In Proceedings of Computer-Aided Verification ′91 (Aalborg, July 1991), pp. 48-58. Lecture Notes in Computer Science 575, Springer-Verlag, Berlin, 1992.
18. CLEAVELAND, R., AND ZWARICO, A. A theory of testing for real time. In Proceedings of the Sixth Annual Symposium on Logic in Computer Science (Amsterdam, July 1991), pp. 110-119. Computer Society Press, Los Alamitos, 1991.
19. DENICOLA, R., AND HENNESSY, M. C. B. Testing equivalence for processes Theor. Comput. Sci. 34, (1983), 83-133.
20. EMERSON, E. A., AND LEI, C -L. Efficient model checking in fragments of the propositional Mu-calculus. In Proceedings of the First Annual Symposium on Logic in Computer Science (Cambridge, June 1986), pp. 267-278. Computer Society Press, Washington, 1986.
21. ERNBERG, P., AND FREDLUND, L.-Å. Identifying some bottlenecks of the concurrency workbench. Tech. Rep. T90002, Swedish Inst, of Computer Science, 1990.
22. FERNANDEZ, J.-C. Aldébaran: Une système de vérification par réduction de processus communicants. Ph.D. Thesis, Université de Grenoble, 1988.
23. FREDLUND, L.-Å., Jonsson, B., and Parrow, J. An implementation of a transitional semantics for an imperative language. In Proceedings of CONCUR ′90 (Amsterdam, Aug. 1990), pp. 246-262. Lecture Notes in Computer Science 458, Springer-Verlag, Berlin, 1990.
24. GLABBEEK, R. VAN, SMOLKA, S. A., STEFFEN, B., AND TOFTS, C. M. N. Reactive, generative, and stratified models of probabilistic processes. In Proceedings of the Fifth Annual Symposium on Logic in Computer Science (Philadelphia, June 1990), pp. 130-141. Computer Society Press, Los Alamitos, 1990.
25. GOYER, J. H. Communications protocols for the B-HIVE multicomputer. Master's Thesis, North Carolina State Univ., 1991.
26. GRAF, S., AND STEFFEN, B. Compositional minimization of finite-state systems. In Computer-Aided Verification ′90 (Piscataway, July 1990), pp. 57-76. American Mathematical Society, Providence, 1991.
27. GROOTE, J. F., AND VAANDRAGER, F. An efficient algorithm for branching bisimulation and stuttering equivalence. In Proceedings of the 17th International Colloquium on Automata, Languages and Programming (Univ. of Warwick, July 1990), pp. 626-638. Lecture Notes in Computer Science 443, Springer-Verlag, Berlin, 1990.
28. HAR'EL, Z., AND KURSHAN, R. P. Software for analytical development of communications protocols. AT&T Tech. J. 69, 1 (Feb. 1990), 45-59.
29. HENNESSY, M. C. B. Algebraic Theory of Processes. MIT Press, Boston, 1988.
30. HILLERSTRÖM, M. Verification of CCS-processes. M.Sc. Thesis, Computer Science Dept., Aalborg, Univ., 1987.
31. HOARE, C. A. R. Communicating Sequential Processes. Prentice-Hall, London, 1985.
32. HOLZMANN, G. Design and Validation of Computer Protocols. Prentice-Hall, Englewood Cliffs, 1991.
33. HOPCROFT, J., AND ULLMAN, J. Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading, 1979.
34. JENSEN, C.-T. The concurrency workbench with priorities. In Proceedings of Computer-Aided Verification ′91. (Aalborg, July 1991), pp. 147-157. Lecture Notes in Computer Science 575, Springer-Verlag, Berlin, 1992.
35. JONSSON, B., KAHN, A., AND PARROW, J. Implementing a model checking algorithm by adapting existing automated tools. In Proceedings of the Workshop on Automatic Verification Methods for Finite-State Systems (Grenoble, June 1989), pp. 179-188. Lecture Notes in Computer Science 407, Springer-Verlag, Berlin, 1989.
36. JONSSON, B., AND PARROW, J. Deciding bisimulation equivalences for a class of non-finite-state programs. In Proceedings of the Sixth Annual Symposium on Theoretical Aspects of Computer Science (Paderborn, Feb. 1989), pp. 421-433. Lecture Notes in Computer Science 349, Springer-Verlag, Berlin, 1989. To appear in Inf. Comput.
37. KANELLAKIS, P., AND SMOLKA, S. A. CCS expressions, finite state processes, and three problems of equivalence. Inf. Comput. 86, 1 (May 1990), 43-68.
38. LARSEN, K. G. Proof systems for Hennessy-Milner logic with recursion. In Proceedings of CAAP, (Nancy, Mar. 1988), pp. 215-230. Lecture Notes in Computer Science 299, Springer-Verlag, Berlin, 1988.
39. LARSEN, K. G., AND THOMSEN, B. A modal process logic. In Proceedings of the Third Annual Symposium on Logic in Computer Science (Edinburgh, July 1988), pp. 203-210. Computer Society Press, Washington, 1988.
40. LARSEN, K. G., AND SKOU, A. Bisimulation through probabilistic testing. Inf. Comput. 94, 1 (Sept. 1991), 1-28.
41. LEE, C.-H. Implementering av CCS med värdeöverfbring. SICS Tech. Rep. 1989 (in Swedish).
42. MALHOTRA, J., SMOLKA, S. A., GIACALONE, A., AND SHAPIRO, R. Winston: A tool for hierarchical design and simulation of concurrent systems. In Proceedings of the Workshop on Specification and Verification of Concurrent Systems (Univ. of Stirling, Scotland, 1988), pp. 140-152, Springer-Verlag, Berlin, 1988.
43. MILNER, R. Communication and Concurrency. Prentice Hall, 1989.
44. PAIGE, R., AND TARJAN, R. E. Three partition refinement algorithms. SIAM J. Comput. 16, 6 (Dec. 1987), 973-989.
45. PARROW, J. Submodule construction as equation solving in CCS. Theor. Comput. Sci. 68 (1989), 175-202.
46. PARROW, J. Verifying a CSMA/CD-Protocol with CCS. In Proceedings of the Eighth IFIP Symposium on Protocol Specification, Testing, and Verification (Atlantic City, June 1988), North Holland, Amsterdam, 1988. pp. 373-387.
47. RICHIER, J., RODRIGUEZ, C., SIFAKIS, J., AND VOIRON, J. Verification in XESAR of the sliding window protocol. In Proceedings of the Seventh IFIP Symposium on Protocol Specification, Testing, and Verification (Zurich, May 1987), North Holland, Amsterdam, 1987, pp. 235-250.
48. ROY, V., AND DE SIMONE, R. Auto/autograph. In Computer-Aided Verification ′90(Piscataway, July 1990), American Mathematical Society, Providence, 1991. pp. 477-491.
49. SMOLKA, S. A., AND STEFFEN, B. Priority as extremal probability. In Proceedings of CONCUR ′90 (Amsterdam, Aug. 1990), pp. 456-466. Lecture Notes in Computer Science 458, Springer-Verlag, Berlin, 1990.
50. STEFFEN, B. Characteristic formulae. In Proceedings of the 16th International Colloquium on Automata, Languages and Programming (Stressa, July 1989), pp. 723-733. Lecture Notes in Computer Science 372, Springer-Verlag, Berlin, 1989.
51. STEFFEN, B., AND INGÓLFSDÓTTIR, A. Characteristic formulae for CCS with divergence. To appear in Theor. Comput. Sci.
52. STIRLING, C. Modal logics for communicating systems. Theor. Comput. Sci. 49, (1987), 311-347.
53. STIRLING, C., AND WALKER, D. J. Local model checking in the modal Mu-calculus. In Proceedings of TAPSOFT (Barcelona, Mar. 1989), pp. 369-383. Lecture Notes in Computer Science 352, Springer-Verlag, Berlin, 1989.
54. WALKER, D. J. Bisimulation equivalence and divergence in CCS. In Proceedings of the Third Annual Symposium on Logic in Computer Science (Edinburgh. 1988), pp. 186-192. Computer Society Press, Washington, 1988.
55. WALKER, D. J. Analysing mutual exclusion algorithms using CCS. Formal Aspects Comput. 1 (1989), 273-292.
56. WINSKEL, G. On the compositional checking of validity. In Proceedings CONCUR ′90 (Amsterdam, Aug. 1990), pp. 481-501. Lecture Notes in Computer Science 458, pp. 481-501, 1990.