Asymptotic speedups, bisimulation and distillation (Work in progress)

Neil Jones*, G. W. Hamilton

*Corresponding author af dette arbejde

Abstract

Distillation is a fully automatic program transformation that can yield superlinear program speedups. Bisimulation is a key to the proof that distillation is correct, i.e., preserves semantics. However the proof, based on observational equivalence, is insensitive to program running times. This paper shows how distillation can give superlinear speedups on some “old chestnut” programs well-known from the early program transformation literature: naive reverse, factorial sum, and Fibonacci.

OriginalsprogEngelsk
TitelPerspectives of system informatics : 9th International Ershov Informatics Conference, PSI 2014, St. Petersburg, Russia, June 24-27, 2014. Revised Selected Papers
RedaktørerAndrei Voronkov, Irina Virbitskaite
Antal sider9
ForlagSpringer
Publikationsdato2015
Sider177-185
ISBN (Trykt)978-3-662-46822-7
ISBN (Elektronisk)978-3-662-46823-4
DOI
StatusUdgivet - 2015
Begivenhed9th International Ershov Informatics Conference on Perspectives of System Informatics, PSI 2014 - St. Petersburg, Rusland
Varighed: 24 jun. 201427 jun. 2014

Konference

Konference9th International Ershov Informatics Conference on Perspectives of System Informatics, PSI 2014
Land/OmrådeRusland
BySt. Petersburg
Periode24/06/201427/06/2014
NavnLecture Notes in Computer Science
Vol/bind8974
ISSN0302-9743

Fingeraftryk

Dyk ned i forskningsemnerne om 'Asymptotic speedups, bisimulation and distillation (Work in progress)'. Sammen danner de et unikt fingeraftryk.

Citationsformater