Standard
Asymptotic speedups, bisimulation and distillation (Work in progress). / Jones, Neil; Hamilton, G. W.
Perspectives of system informatics: 9th International Ershov Informatics Conference, PSI 2014, St. Petersburg, Russia, June 24-27, 2014. Revised Selected Papers. ed. / Andrei Voronkov; Irina Virbitskaite. Springer, 2015. p. 177-185 (Lecture Notes in Computer Science, Vol. 8974).
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Harvard
Jones, N & Hamilton, GW 2015,
Asymptotic speedups, bisimulation and distillation (Work in progress). in A Voronkov & I Virbitskaite (eds),
Perspectives of system informatics: 9th International Ershov Informatics Conference, PSI 2014, St. Petersburg, Russia, June 24-27, 2014. Revised Selected Papers. Springer, Lecture Notes in Computer Science, vol. 8974, pp. 177-185, 9th International Ershov Informatics Conference on Perspectives of System Informatics, PSI 2014, St. Petersburg, Russian Federation,
24/06/2014.
https://doi.org/10.1007/978-3-662-46823-4_15APA
Jones, N., & Hamilton, G. W. (2015).
Asymptotic speedups, bisimulation and distillation (Work in progress). In A. Voronkov, & I. Virbitskaite (Eds.),
Perspectives of system informatics: 9th International Ershov Informatics Conference, PSI 2014, St. Petersburg, Russia, June 24-27, 2014. Revised Selected Papers (pp. 177-185). Springer. Lecture Notes in Computer Science Vol. 8974
https://doi.org/10.1007/978-3-662-46823-4_15Vancouver
Jones N, Hamilton GW.
Asymptotic speedups, bisimulation and distillation (Work in progress). In Voronkov A, Virbitskaite I, editors, Perspectives of system informatics: 9th International Ershov Informatics Conference, PSI 2014, St. Petersburg, Russia, June 24-27, 2014. Revised Selected Papers. Springer. 2015. p. 177-185. (Lecture Notes in Computer Science, Vol. 8974).
https://doi.org/10.1007/978-3-662-46823-4_15Author
Jones, Neil ; Hamilton, G. W. / Asymptotic speedups, bisimulation and distillation (Work in progress). Perspectives of system informatics: 9th International Ershov Informatics Conference, PSI 2014, St. Petersburg, Russia, June 24-27, 2014. Revised Selected Papers. editor / Andrei Voronkov ; Irina Virbitskaite. Springer, 2015. pp. 177-185 (Lecture Notes in Computer Science, Vol. 8974).
Bibtex
@inproceedings{ac319fad1a8b4a9b91c0c389b5eb69d2,
title = "Asymptotic speedups, bisimulation and distillation (Work in progress)",
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.",
author = "Neil Jones and Hamilton, {G. W.}",
year = "2015",
doi = "10.1007/978-3-662-46823-4_15",
language = "English",
isbn = "978-3-662-46822-7",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "177--185",
editor = "Andrei Voronkov and Irina Virbitskaite",
booktitle = "Perspectives of system informatics",
address = "Switzerland",
note = "9th International Ershov Informatics Conference on Perspectives of System Informatics, PSI 2014 ; Conference date: 24-06-2014 Through 27-06-2014",
}
RIS
TY - GEN
T1 - Asymptotic speedups, bisimulation and distillation (Work in progress)
AU - Jones, Neil
AU - Hamilton, G. W.
PY - 2015
Y1 - 2015
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84942523079&partnerID=8YFLogxK
U2 - 10.1007/978-3-662-46823-4_15
DO - 10.1007/978-3-662-46823-4_15
M3 - Article in proceedings
AN - SCOPUS:84942523079
SN - 978-3-662-46822-7
T3 - Lecture Notes in Computer Science
SP - 177
EP - 185
BT - Perspectives of system informatics
A2 - Voronkov, Andrei
A2 - Virbitskaite, Irina
PB - Springer
T2 - 9th International Ershov Informatics Conference on Perspectives of System Informatics, PSI 2014
Y2 - 24 June 2014 through 27 June 2014
ER -
