| Accurate Step Counting (2005) | |||||||||||||||||
Abstract | |||||||||||||||||
| 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 counting 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. 1 | |||||||||||||||||
Publication details | |||||||||||||||||
| |||||||||||||||||