Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

6

FPCA
1989

favoriteEmaildiscussreport

110views Programming Languages» more FPCA 1989»

Automatic Complexity Analysis

13 years 8 months ago

Automatic Complexity Analysis

Download akira.ruc.dk

One way to analyse programs is to to derive expressions for their computational behaviour. A time bound function (or worst-case complexity) gives an upper bound for the computation time as a function of the size of input. We describe a system to derive such time bounds automatically using abstract interpretation. The semantics-based setting makes it possible to prove the correctness of the time bound function. The system can analyse programs in a ﬁrst-order subset of Lisp and we show how the system also can be used to analyse programs in other languages.

Mads Rosendahl

Real-time Traffic

FPCA 1989 | Programming Languages | Time Bound | Time Bound Function | Upper Bound |

claim paper

Related Content

» Automatic Complexity Analysis for Programs Extracted from Coq Proof

» Automatic Complexity Analysis and Model Reduction of Nonlinear Biochemical Systems

» Towards an automatic complexity analysis for generic programs

» Towards the automatic analysis of complex human body motions

» Automated Implicit Computational Complexity Analysis System Description

» Determining Case in Arabic Learning Complex Linguistic Behavior Requires Complex Linguisti...

» Automated Complexity Analysis Based on the Dependency Pair Method

» Multisensor Based Generation of Templates for Object Tracking in Complex Scenarios

» Analysis of CCME Coevolutionary Dynamics Automatic Problem Decomposition and Regularizatio...

Post Info
More Details (n/a)

Added	11 Aug 2010
Updated	11 Aug 2010
Type	Conference
Year	1989
Where	FPCA
Authors	Mads Rosendahl

Comments (0)