Subject
General Computer Science,Theoretical Computer Science
Reference14 articles.
1. Symbolic model checking: 1020 states and beyond;Burch,1990
2. Three uses of the herbrand-gentzen theorem in relating model theory and proof theory;Craig;J. Symbolic Logic,1957
3. L. de Moura, H. Rueß, M. Sorea, Lazy theorem proving for bounded model checking over infinite domains, in: 18th Conf. on Automated Deduction, CADE 2002, Lecture Notes in Computer Science, Springer, Copenhagen, Denmark, July 27–30, 2002.
4. T.A. Henzinger, R. Jhala, R. Majumdar, K.L. McMillan, Abstractions from proofs, in: ACM Symp. on Principles of Programming Language, POPL 2004, 2004, pp. 232–244.
5. Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic;Krajíc˘ek;J. Symbolic Logic,1997
Cited by
146 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献