Proving Properties of Dynamic Process Networks

Information and Computation

Volumn 140, Issue 2, 1998, Pages 95-114

  Dam, Mads ^a  

^a SWEDISH INSTITUTE OF COMPUTER SCIENCE   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0009008220     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1997.2680     Document Type: Article

References (26)

1. Abadi, M., and Lamport, L. (1993), Composing specifications, ACM Trans. Programming Languages Systems 15, 73-132.
2. Abrahamson, K. (1979), Modal logic of concurrent programs, Lecture Notes in Computer Science, Vol. 70, pp. 21-33, Springer-Verlag, Berlin/New York.
3. Amadio, R., and Dam, M. (1995), Reasoning about higher-order processes, in "Proc. CAAP'95," Lecture Notes in Computer Science, Vol. 915, pp. 202-216, Springer-Verlag, Berlin/New York.
4. Andersen, H., Stirling, C., and Winskel, G. (1994), A compositional proof system for the modal μ-calculus, in "Proc. LICS'94," pp. 144-153.
5. Barringer, H., Kuiper, R., and Pnueli, A. (1984), Now you may compose temporal logic specifications, in "Proc. STOC'84," pp. 51-63.
6. Bradfield, J., and Stirling, C. (1992), Local model checking for infinite state spaces, Theoret. Comput. Sci. 96, 157-174.
7. Cleaveland, R. (1990), Tableau-based model checking in the prepositional mu-calculus, Acta Informat. 27, 725-747.
8. Cleaveland, R., Dreimüller, M., and Steffen, B. (1992), Faster model checking for the modal mu-calculus, in "Proc. CAV'92," Lecture Notes in Computer Science, Vol. 663, pp. 383-394, Springer-Verlag, Berlin/New York.
9. Dam, M. (1994a), CTL* and ECTL* as fragments of the modal mu-calculus, Theoret. Comput. Sci. 126, 77-96.
10. Dam, M. (1994b), "Model Checking Mobile Processes" [full version], SICS Report RR 94:1. [Preliminary version appeared in "Proc. CONCUR'93," Lecture Notes in Computer Science, Vol. 715, pp. 22-36, Springer-Verlag, Berlin/New York]
11. Emerson, E. A., and Lei, C. (1986), Efficient model checking in fragments of the prepositional mu-calculus, in "Proc. LICS'86," pp. 267-278.
12. Esparza, J. (1997), Decidability of model checking for infinite-state concurrent systems, Acta Informat. 34, 85-107.
13. Grumberg, O., and Long, D. E. (1994), Model checking and modular verification, ACM Trans. Programming Languages Systems 16, 843-871.
14. Hungar, H. (1994), Model checking of macro processes, in "Proc. CAV'94," Lecture Notes in Computer Science, Vol. 818, pp. 169-181, Springer-Verlag, Berlin/New York.
15. Jones, C. (1983), Specification and design of (parallel) programs, in "Proc. IFIP'83," pp. 321-332.
16. Jonsson, B. (1994), Compositional specification and verification of distributed systems, in "ACM Transactions on Programming Languages and Systems," Vol. 16, pp. 259-303, Assoc. Comput. Mach., New York.
17. Kozen, D. (1983), Results on the prepositional μ-calculus, Theoret. Comput. Sci. 27, 333-354.
18. Larsen, K. G. (1992), Efficient local correctness checking, in "Proc. CAV'92," Lecture Notes in Computer Science, Vol. 663, Springer-Verlag, Berlin/New York.
19. Larsen, K. G., and Liu, X. (1991), Compositionality through an operational semantics of contexts, J. Logic Computat. 1, 761-795.
20. Milner, R. (1989), "Communication and Concurrency," Prentice-Hall International, Englewood Cliffs, NJ.
21. Pnueli, A. (1985), In transition from global to modular temporal reasoning about programs, in "Logics and Models of Concurrent Systems," NATO ASI Series F, Computer and System Sciences, Vol. 13, pp. 123-144.
22. Simpson, A. (1995), Compositionality via cut-elimination: Hennessy-Milner logic for an arbitrary GSOS, in "Proc. LICS'95," pp. 420-430.
23. Stirling, C. (1988), A generalization of Owicki-Gries's Hoare logic for a concurrent while language, Theoret. Comput. Sci. 58, 347-359.
24. Stirling, C., and Walker, D. (1991), Local model checking in the modal mu-calculus, Theoret. Comput. Sci. 89, 161-177.
25. Streett, R. S., and Emerson, E. A. (1989), An automata theoretic decision procedure for the propositional mu-calculus, Inform. and Comput. 81, 249-264.
26. Winskel, G. (1991), A note on model checking the modal μ-calculus, Theoret. Comput. Sci. 83, 157-187.