scientific article; zbMATH DE number 2087550
From MaRDI portal
Publication:4738360
zbMATH Open1077.68610MaRDI QIDQ4738360FDOQ4738360
Authors: Flemming Nielson, Hanne Riis Nielson, Helmut Seidl 
Publication date: 11 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2305/23050243.htm
Title of this publication is not available (Why is that?)
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)
- Automated Complexity Analysis Based on Context-Sensitive Rewriting
- A transformational approach to parametric accumulated-cost static profiling
- A general framework for static profiling of parametric resource usage
- Information flow security in boundary ambients
- Nesting analysis of mobile ambients
- Tyrolean Complexity Tool: Features and Usage.
- Title not available (Why is that?)
- Automated complexity analysis based on ordered resolution
- Title not available (Why is that?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4738360)
