Accurate Step Counting
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 abst...
| Main Authors: | , |
|---|---|
| Format: | Conference or Workshop Item |
| Published: |
2005
|
| Online Access: | https://eprints.nottingham.ac.uk/247/ |