SIGN IN
SIGN UP
Automated complexity analysis based on ordered resolution
Full Text:
PDF
Buy this Article
Authors:
David Basin
Univ. Freiburg, Freiburg, Germany
Harald Ganzinger
Max-Planck-Institut für Informatik, Saarbrücken, Germany
Published in:
· Journal
Journal of the ACM (JACM)
JACM Homepage
archive
Volume 48 Issue 1, Jan. 2001
Pages 70-109
ACM
New York, NY
, USA
table of contents
doi>
10.1145/363647.363681
2001 Article
Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 23
· Downloads (cumulative): 553
· Citation Count: 15
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
automated theorem proving
complexity analysis
complexity measures and classes
deduction and theorem proving
first-order theories
mathematical logic
ordered resolution
theory
verification
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder