Certifying and reasoning on cost annotations of functional programs

Authors:
Roberto M. Amadio;Yann Régis-Gianas
Affiliations:
Université Paris Diderot (UMR-CNRS 7126), France;Université Paris Diderot (UMR-CNRS 7126), France,INRIA (Team PI.R2), France
Venue:
FOPARA'11 Proceedings of the Second international conference on Foundational and Practical Aspects of Resource Analysis
Year:
2011

Citing 7
Cited 0

Complexity analysis for a lazy higher-order language

Proceedings of the third European symposium on programming on ESOP '90
From system F to typed assembly language

ACM Transactions on Programming Languages and Systems (TOPLAS)
Special Feature: Epigrams on programming

ACM SIGPLAN Notices
A Hoare Logic for Call-by-Value Functional Programs

MPC '08 Proceedings of the 9th international conference on Mathematics of Program Construction
Formal verification of a realistic compiler

Communications of the ACM - Barbara Liskov: ACM's A.M. Turing Award Winner
A verified compiler for an impure functional language

Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Worst-case execution times for a purely functional language

IFL'06 Proceedings of the 18th international conference on Implementation and application of functional languages

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a so-called labelling method to insert cost annotations in a higher-order functional program, to certify their correctness with respect to a standard compilation chain to assembly code, and to reason on them in a higher-order Hoare logic.