Certifying and Reasoning on Cost Annotations of Functional Programs-Reference-Cited by-同舟云学术

Certifying and Reasoning on Cost Annotations of Functional Programs

Published:2012 Issue: Volume: Page:72-89
ISSN:0302-9743
Container-title:Foundational and Practical Aspects of Resource Analysis
language:
Short-container-title:

Author:

Amadio Roberto M.,Régis-Gianas Yann

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-32495-6_5

Reference14 articles.

1. Amadio, R.M., Ayache, N., Régis-Gianas, Y., Saillard, R.: Certifying cost annotations in compilers. Université Paris Diderot, Research Report (2010), http://hal.archives-ouvertes.fr/hal-00524715/fr/

2. Amadio, R.M., Régis-Gianas, Y.: Certifying and reasoning on cost annotations of functional programs Université Paris Diderot, Research Report (2011), http://hal.inria.fr/inria-00629473/en/

3. AbsInt Angewandte Informatik, http://www.absint.com/

4. Lecture Notes in Computer Science;A. Bonenfant,2007

5. Chlipala, A.: A verified compiler for an impure functional language. In: Proc. ACM-POPL, pp. 93–106 (2010)

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On the Operational Theory of the CPS-Calculus: Towards a Theoretical Foundation for IRs;Proceedings of the ACM on Programming Languages;2024-08-15

2. Closure conversion is safe for space;Proceedings of the ACM on Programming Languages;2019-07-26

3. Verifying the Correctness and Amortized Complexity of a Union-Find Implementation in Separation Logic with Time Credits;Journal of Automated Reasoning;2017-09-22

4. A new verified compiler backend for CakeML;ACM SIGPLAN Notices;2016-12-05

5. Certified Complexity (CerCo);Foundational and Practical Aspects of Resource Analysis;2014