Sciweavers

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

8

IFL
2005
Springer

favoriteEmaildiscussreport

103views Formal Methods» more IFL 2005»

Accurate Step Counting

13 years 10 months ago

Accurate Step Counting

Download www.cs.nott.ac.uk

Abstract Starting with an evaluator for a language, an abstract machine for the same language can be mechanically derived using successive program transformations. This has relevance to studying both the time and space properties of programs because these can be estimated by transitions of the abstract machine and measuring the size of the additional data structures needed, such as environments and stacks. In this paper we will use this process to derive a function that accurately counts the number of steps required to evaluate expressions in a simple language, and illustrate this function with a range of examples.

Catherine Hope, Graham Hutton

Real-time Traffic

Abstract Machine | Additional Data Structures | IFL 2005 | Successive Program Transformations |

claim paper

Related Content

» Fast and Accurate Motion Estimation Using Orientation Tensors and Parametric Motion Models

» Automatic generation of Cycle Accurate and Cycle Count Accurate transaction level bus mode...

» On Accurate and Efficient Statistical Counting in SensorBased Surveillance Systems

» Cycle count accurate memory modeling in system level design

» Counting Positives Accurately Despite Inaccurate Classification

» Using focused regression for accurate timeconstrained scaling of scientific applications

» An Adaptive Mechanism for Accurate Query Answering under Differential Privacy

» Counting Lattice Paths by Narayana Polynomials

» Towards Robust Peer Counting

Post Info
More Details (n/a)

Added	27 Jun 2010
Updated	27 Jun 2010
Type	Conference
Year	2005
Where	IFL
Authors	Catherine Hope, Graham Hutton

Comments (0)