Skip to main content

Research Repository

See what's under the surface

Advanced Search

Accurate Step Counting

Hope, Catherine; Hutton, Graham

Authors

Catherine Hope



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 space and time properties of programs because these can be estimated by counting transitions of the abstract machine and measuring the size of the additional data structures needed, such as environments and stacks. In this article we use this process to derive a function that accurately counts the number of steps required to evaluate expressions in a simple language.

Publication Date Jan 1, 2005
Peer Reviewed Peer Reviewed
APA6 Citation Hope, C., & Hutton, G. (2005). Accurate Step Counting
Copyright Statement Copyright information regarding this work can be found at the following address: http://eprints.nottingh.../end_user_agreement.pdf

Files

stepCounting.pdf (160 Kb)
PDF

Copyright Statement
Copyright information regarding this work can be found at the following address: http://eprints.nottingham.ac.uk/end_user_agreement.pdf





You might also like



Downloadable Citations

;