This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
S. Aggarwal, R. P. Kurshan, and K. K. Sabnani. A Calculus for Protocol Specification and Validation. In Protocol Specification, Testing and Verification, North-Holland, 1983, pp. 19–34.
B. Alpern and F. Schneider. Verifying Temporal Properties without using Temporal Logic. Tech. Rept. 85-723, Cornell University Computer Science Department, December, 1985.
M. Ben-Ari, Z. Manna, A. Pneuli. "The Temporal Logic of Branching Time". Acta Informatica, 20 (1983), 207–226.
M. C. Browne. An Improved Algorithm for the Automatic Verification of Finite State Systems using Temporal Logic. Proceedings of the 1986 Conference on Logic in Computer Science., Cambridge, Massachusetts, June, 1986, pp. 260–267.
M. Browne, E. Clarke, D. Dill, B. Mishra. "Automatic Verification of Sequential Circuits using Temporal Logic". IEEE Transactions on Computers C-35, 12 (December 1986).
E.M. Clarke, E.A. Emerson. Synthesis of Synchronization Skeletons for Branching Time Temporal Logic. Proc. of the Workshop on Logic of Programs, Yorktown Heights, NY, 1981.
E.M. Clarke, E.A. Emerson, A.P. Sistla. "Automatic Verification of Finite-State Concurrent Systems using Temporal Logic Specifications". ACM Transactions on Programming Languages and Systems 8, 2 (1986), 244–263.
David L. Dill and Edmund M. Clarke. "Automatic Verification of Asynchronous Circuits using Temporal Logic". IEE Proceedings 133, pt. E, 5 (September 1986).
E.A. Emerson and E.M. Clarke. Springer Lecture Notes in Computer Science. Volume 85: Characterizing Properties of Parallel Programs as Fixpoints. In Proc. of the Seventh International Colloquium on Automata, Languages and Programming, Springer Verlag, 1981.
E.A. Emerson, J.Y. Halpern. ""Sometimes" and "Not Never" Revisited: On Branching versus Linear Time". Proc. 10th ACM Symp. on Principles of Programming Languages, 1983.
E.A. Emerson, Chin Laung Lei. "Modalities for Model Checking: Branching Time Strikes Back". Twelfth Symposium on Principles of Programming Languages, New Orleans, La. (January 1985).
Z. Habasinski. Program Verification and Muller Automata. Unpublished Report, Tech. Univ., Poznan.
R.P. Kurshan. Testing Containment of ω-Regular Languages. Tech. Rept. 1121-861010-33-TM, Bell Laboratories Technical Memorandum, 1986.
O. Lichtenstein and A. Pnueli. Checking that Finite State Concurrent Programs Satisfy Their Linear Specification. Conference Record of the Twelth Annual ACM Symposium on Principles of Programming Languages, New Orleans, La., January, 1985.
Z. Manna and A. Pnueli. Specification and Verification of Concurrent Programs by ∀-Automata. Conference Record of the Fourteenth Annual Symposium on Principles of Programming Lannguages, ACM, Munich, January, 1987, pp. 1–12.
J.P. Quielle, J. Sifakis. "Specification and Verification of Concurrent Systems in CESAR". Proc. of the Fifth International Symposium in Programming, 1981.
A.P. Sistla, E.M. Clarke. "Complexity of Propositional Temporal Logics". Journal of the Association for Computing Machinery 32, 3 (July 1986), 733–749.
W. Thomas. On Chain Logic, Path Logic, and First-Order Logic over Infinite Trees. Symposium on Logic in Computer Science, 1987, pp. 245–257.
M. Vardi and P. Wolper. An Automata-Theoretic Approach to Automatic Program Verification. Proceedings of the Conference on Logic in Computer Science, Boston, Mass., June, 1986.
M. Y. Vardi and P. Wolper. Springer Lecture Notes in Computer Science. Volume 164: Yet Another Process Logic. In Logics of Programs, Edmund Clarke and Dexter Kozen, Eds., Springer Verlag, 1983, pp. 501–513.
P. Wolper. Temporal Logic can be more Expressive. Proceedings of the 22nd Symposium on Foundations of Computer Science, 1981, pp. 340–348.
P. Wolper, M. Y. Vardi, A. P. Sistla. Reasoning about Infinite Computation Paths. Proceedings of the 24th Symposium on the Foundations of Computer Science, 1983, pp. 185–194.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Clarke, E.M., Grumberg, O., Kurshan, R.P. (1989). A synthesis of two approaches for verifying finite state concurrent systems. In: Meyer, A.R., Taitslin, M.A. (eds) Logic at Botik '89. Logic at Botik 1989. Lecture Notes in Computer Science, vol 363. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51237-3_7
Download citation
DOI: https://doi.org/10.1007/3-540-51237-3_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51237-0
Online ISBN: 978-3-540-46180-7
eBook Packages: Springer Book Archive