Author:
Zhang Ting,Sipma Henny B.,Manna Zohar
Publisher
Springer Berlin Heidelberg
Reference24 articles.
1. Bjørner, N.S.: Integrating Decision Procedures for Temporal Verification. PhD thesis, Computer Science Department, Stanford University (November 1998)
2. Bjørner, N.S., Browne, A., Colón, M., Finkbeiner, B., Manna, Z., Sipma, H.B., Uribe, T.E.: Verifying temporal properties of reactive systems: A STeP tutorial. Formal Methods in System Design 16(3), 227–270 (2000)
3. Compton, K.J., Henson, C.W.: A uniform method for proving lower bounds on the computational complexity of logical theories. Annals of Pure and Applied Logic 48, 1–79 (1990)
4. Cooper, D.C.: Theorem proving in arithmetic without multiplication. In: Machine Intelligence, vol. 7, pp. 91–99. American Elsevier, Amsterdam (1972)
5. Downey, J., Sethi, R., Tarjan, R.E.: Variations of the common subexpression problem. Journal of ACM 27, 758–771 (1980)
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献