The complexity of verification

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129502, Issue , 1994, Pages 365-371

  Kurshan, R P ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTABILITY AND DECIDABILITY; COMPUTATIONAL COMPLEXITY; DECISION THEORY; FORMAL LOGIC; HEURISTIC METHODS; MATHEMATICAL MODELS; NETWORK PROTOCOLS; THEOREM PROVING;

AUTOMATA THEORETIC VERIFICATION; AUTOMATED THEOREM PROVING; DISCRETE EVENTS; VERIFICATION;

AUTOMATA THEORY;

EID: 0028132535     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/195058.195194     Document Type: Conference Paper

References (59)

1. S. Aggarwal, R. P. Kurshan, and K. Sabnani. A Calculus for Protocol Specification and Validaition. In Protocol Specification, Testing and Verification III, pages 19-34. North-Holland, 1983.
2. B. Alpern and F. B. Schneider. Defining Liveness. Inf. Proc. Letters 21, pages 181-185, (1985).
3. B. Alpern and F. B. Schneider. Recognizing Safety and Liveness. Distributed Computing 2, pages 117-126, (1987).
4. R. Alur and D. L. Dill. Automata for Modeling Real Time Systems. Lec. Notes in Comput. Sci. (LNCS) 443, pages 322-335, (1990).
5. H. R. Anderson and G. Winskel. Compositional Checking of Satisfaction. Formal Methods in Syst. Design 1, pages 323-354, (1992).
6. C. M. Angelo, D. Verkest, L. Claesen, and H. De Man. On the Comparison of HOL and Boyer-Moore for Formal Hardware Verification. Formal Methods in System Design 2, pages 45-72, (1993).
7. G. Barnes, J. F. Buss, W. L. Ruzzo, and B. Schieber. A Sublinear Space, Polynomial Time Algorithm for Directed S-T Connectivity. In Proc. 7th IEEE Structure in Complexity Thy. Conf., pages 27-33, (1992).
8. J. Barwise. Mathematical Proofs of Computer System Correctness. Notices, Amer. Math. Soc. 36, pages 884- 851, (1989).
9. W. W. Bledsoe and D. W. Loveland, editors. Automated Theorem Proving: After 25 Years, Contemp. Math 29. Amer. Math. Soc., 1984. Especially the paper Proof- Checking, Theorem-Proving and Program Verification by R. S. Boyer and J. S. Moore, 119-132.
10. J. R. Burch, E. M. Clarke, K. L. McMillan, D. L. Dill, and L. J. Hwang. Symbolic Model Checking: 1020 States and Beyond, LICS; Sequential Circuit Verification Using Symbolic Model Checking, IEEE Design Automation Conference (DAC), 1990.
11. Y. Choueka. Theories of Automata on w-Tapes: A Simplified Approach. J. Comp. Sys. Sci. 8, pages 117- 141, (1974).
12. E. M. Clarke, I. A. Draghicescu, and R. P. Kurshan. A Unified Approach for Showing Language Containment and Equivalence Between Various Types of ui-Automata. Information Processing Letters 46, pages 301-308, (1993).
13. E. M. Clarke and E. A. Emerson. Synthesis of Synchronization Skeletons for Branching Time Temporal Logic. In Proc. Logic of Programs Workshop, Lecture Notes in Computer Science (LNCS) 131, pages 52-71. Springer-Verlag, 1981.
14. E. M. Clarke and A. P. Sistla. The Complexity of Prepositional Linear Temporal Logic. J ACM 32, pages 733-749, (1985).
15. C. Courcoubetis, M. Y. Vardi, and P. Wolper. Reasoning About Fair Concurrent Programs. In Proc. 18th ACM Symp. on Theory of Computing, pages 283-294, Berkeley, 1986.
16. C. Courcoubetis, M. Y. Vardi, P. Wolper, and M. Yannakakis. Memory-Efficient Algorithms for the Verification of Temporal Properties. Formal Methods in System Design 1, pages 275-288, (1992).
17. D. L. Dill. Trace Theory for Automatic Hierarchical Verification of Speed-Independent Circuits. MIT Press, 1989.
18. D. L. Dill, A. J. Hu, and H. Wong-Toi. Checking for Language Inclusion Using Simulation Preorders. Lecture Notes in Computer Science (LNCS) 575, (1992).
19. E. A. Emerson. Temporal and Modal Logic. In Handbook ofTheoretical Computer Science, volume B, chapter 16, pages 995-1072. Elsevier, 1990.
20. J.-C. Fernandez, L. Mounier, C. Jard, and T. Jeron. On-The-Fly Verification of Finite Transition Systems. Formal Methods in System Design 1, pages 251-273, (1992).
21. M. R. Garey and D. S. Johnson. Computers and Intractability. Freeman, 1979.
22. M. Gordon. A Proof-Generating System for Higher- Order Logic. Kluwer SECS 35, pages 73-128, (1988).
23. S. Graf and B. Steffen. Compositional Minimization of Finite State Systems. Lecture Notes in Computer Science (LNCS) 531, pages 186-196, (1991).
24. O. Grumberg and D. E. Long. Model Checking and Modular Verification. In Proc. CONCUR '91, volume 527 of Lecture Notes in Computer Science. Springer- Verlag, 1991.
25. A. Gupta. Formal Hardware Verification Methods: A Survey. Formal Methods in System Design 1, pages 151-238, (1992).
26. M. Hennessy. Algebraic Theory of Processes. MIT Press, 1988.
27. M. C. B. Hennessy and R. Milner. Algebraic Laws for Nondeterminism and Concurrency. J. ACM 32, pages 137-161, (1985).
28. W. A. Hunt Jr. Microprocessor Design Verification. Journal of Automated Reasoning 5, pages 429-460, (1989). .
29. E. M. Clarke, O. Grumberg, and R. Kurshan. A Syn thesis of Two Approaches for Verifying Finite State Concurrent Systems. Lecture Notes in Computer Sci ence (LNCS) 363, pages 81-90, (1989).
30. J. Joyce. Formal Verification and Implementation of a Microprocessor. In G. Birtwistle and P. A. Sub- rahmanyam, editors, VLSI Specification, Verification and Synthesis, pages 129-157. Kluwer Academic Press, Boston, 1988.
31. P. C. Kanellakis and S. A. Smolka. CCS Expressions, Finite State Processes, and Three Problems of Equivalence. Inf. Comp. 86, pages 43-68, (1990).
32. D. Kozen. Lower Bounds for Natural Proof Systems. Proc 18th Symp. Found. Comput. Sci. (FOCS), pages 254-266, (1977).
33. R. P. Kurshan. Modelling Concurrent Processes. Symp. Applied Math. 31, pages 45-57, (1985).
34. R. P. Kurshan. Reducibility in Analysis of Coordination. LNCIS 103, pages 19-39, (1987).
35. R. P. Kurshan. Analysis of Discrete Event Coordination. Lec. Notes in Comput. Sci. (LNCS) 430, pages 414-453, (1990).
36. R. P. Kurshan. Formal Verification of Coordinating Processes: The Automata-Theoretic Approach. Princeton Univ. Press, 1994.
37. R. P. Kurshan and K. L. McMillan. Analysis of Digital Circuits Through Symbolic Reduction. IEEE Trans. CAD 10, pages 1356-1371, (1991).
38. D. E. Long. Model Checking, Abstraction, and Compositional Verification. PhD thesis, CMU, 1993.
39. Z. Manna and A. Pnueli. Specification and Verification of Concurrent Programs V-Automata. In Proc. 14th Symp. Princ. Prog. Lang. (POPL), pages 1-12. ACM, 1987.
40. Z. Manna and A. Pnueli. Tools and Rules for the Practicing Verifier. In Carnegie Mellon Computer Science: A 25-year Commemorative. ACM Press, 1990.
41. K. L. McMillan. Symbolic Model Checking. Kluwer, 1993.
42. R. Milner. A Calculus of Communicating Systems. Lecture Notes in Computer Science (LNCS) 92, (1980).
43. Int'l. Conf. on Computer-Aided Verification. The proceedings to date have been published in Springer- Verlag's Lect. Notes in Comput. Sci. 407 (1989), 531 (1990), 575 (1991), 663 (1992), 697 (1993).
44. J. L. Peterson. Petri Net Theory and The Modeling of Systems. Prentice-Hall, 1981.
45. H. Plunnecke and W. Reisig. Bibliography of Petri Nets 1990, in Advances in Petri Nets 1991, (1990/91). Contains 4100 entries!.
46. J. P. Queille and J. Sifakis. Specification and Verification of Concurrent Systems in CESAR. Lect. Notes Comput. Sci. (LNCS) 137, pages 337-351, (1982).
47. P. J. Ramadge. Supervisory Control Problems for Discrete Event Systems Modeled by Biichi Automata. IEEE Transactions on Automatic Control 34, pages 10-19, (1989).
48. W. Savitch. Relationships Between Nondeterministic and Deterministic Tape Complexities. J. Computer Syst. Sci. 4, pages 177-192, (1970).
49. C. Stirling and D. Walker. Local Model Checking in the Modal U-Calculus. Theoretical Comput. Sci. 86, pages 161-177, (1991).
50. M. Y. Vardi. Verification of Concurrent Programs The Automata-Theoretic Framework. In Proc. 2nd IEEE Symp. on Logic in Computer Science, pages 161-176, Ithaca, 1987.
51. M. Y. Vardi. Unified Verification Theory. In Proc. Temporal Logic in Specification 1987, pages 202-212. Springer-Verlag, 1989. Lecture Notes in Computer Science.
52. M. Y. Vardi and P. Wolper. Automata-Theoretic Techniques for Modal Logic of Programs. J. Computer and System Sciences 32, pages 183-221, (1986).
53. M. Y. Vardi and P. Wolper. An Automata-Theoretic Approach to Automatic Program Verification. In Proc. IEEE Symp. on Logic in Computer Science, pages 332334, Boston, 1987.
54. B. Vergauwen and J. Lewi. A Linear Local Model Checking Algorithm for CTL. Lecture Notes in Computer Science (LNCS) 715, pages 447-461, (1993).
55. D. Walker. Bisimulations and Divergence in CCS. In Third Annual Symposium on Logic in Computer Science, pages 186-192. Computer Society Press, 1988.
56. P. Wolper. Temporal Logic Can Be More Expressive. Inf. Control 56, pages 72-99, (1983).
57. P. Wolper. On the Relation of Programs and Computations to Models of Temporal Logic. Lecture Notes in Computer Science (LNCS) 398, pages 75-123, (1989).
58. P. Wolper and D. Leroy. Reliable Hashing Without Collision Detection. Lecture Notes in Computer Science (LNCS) 697, pages 59-70, (1993).
59. P. L. Wolper, M. Y. Vardi, and A. P. Sistla. Reasoning About Infinite Computation Paths. In Proc. 24th IEEE Symp. on Foundation of Computer Science, pages 185-194, Tuscon, 1983. (To appear in Inf. Comput.).