Mechanical analysis of program complexity
Abstract
References
Index Terms
- Mechanical analysis of program complexity
Recommendations
Mechanical analysis of program complexity
SLIPE '85: Proceedings of the ACM SIGPLAN 85 symposium on Language issues in programming environmentsThere has been a great deal of research done which investigates the problem of evaluating the complexity of particular algorithms; little effort however has been applied to the mechanization of this evaluation. This paper presents the ACE (for Automatic ...
Point-free Program Transformation
Program Transformation: Theoretical Foundations and Basic Techniques. Part 1Functional programs are particularly well suited to formal manipulation by equational reasoning. In particular, it is straightforward to use calculational methods for program transformation. Well-known transformation techniques, like tupling or the ...
Proving Theorems by Program Transformation
To Andrzej Skowron on His 70th BirthdayIn this paper we present an overview of the unfold/fold proof method, a method for proving theorems about programs, based on program transformation. As a metalanguage for specifying programs and program properties we adopt constraint logic programming ...
Comments
Information & Contributors
Information
Published In
- June 1985257 pages
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations11Total Citations
- 381Total Downloads
- Downloads (Last 12 months)35
- Downloads (Last 6 weeks)8
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in