Automatic complexity analysis

DOI10.1007/3-540-45927-8_18MaRDI QIDQ4738360zbMATH OpenFDO

Authors Flemming Nielson, Hanne Riis Nielson, Helmut Seidl

Publication date 11 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2305/23050243.htm

zbMATH Keywords

automatic complexity analysisHorn clausesProgram analysissparseness

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• Automated higher-order complexity analysis
• On the complexity of automatic complexity
• Automated complexity analysis based on ordered resolution
• Automated Complexity Analysis Based on the Dependency Pair Method
• Automated Complexity Analysis Based on Context-Sensitive Rewriting
• Automated Implicit Computational Complexity Analysis (System Description)
• Complexity of automata evaluating formulas
• Automated complexity analysis of Nuprl extracted programs
• scientific article; zbMATH DE number 5267

Cited in

(9)

• Nesting analysis of mobile ambients
• Information flow security in boundary ambients
• A transformational approach to parametric accumulated-cost static profiling
• Automated complexity analysis based on ordered resolution
• Tyrolean Complexity Tool: Features and Usage.
• scientific article; zbMATH DE number 1747450 (Why is no real title available?)
• A general framework for static profiling of parametric resource usage
• Automated Complexity Analysis Based on Context-Sensitive Rewriting
• scientific article; zbMATH DE number 5041651 (Why is no real title available?)

This page was built for publication: Automatic complexity analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4738360)