Verifying efficient function calls in CakeML
Verifying efficient function calls in CakeML
复制标题
验证 CakeML 中的高效函数调用
DOI:
10.1145/3110262
复制
发表时间:
2017
影响因子:
--
通讯作者:
Owens S
中科院分区:
文献类型:
--
作者:
Owens S
We have designed an intermediate language (IL) for the CakeML compiler that supports the verified, efficient compilation of functions and calls. Verified compilation steps include batching of multiple curried arguments, detecting calls to statically known functions, and specialising calls to known functions with no free variables. Finally, we verify the translation to a lower-level IL that only supports closed, first-order functions.These compilation steps resemble those found in other compilers (especially OCaml). Our contribution here is the design of the semantics of the IL, and the demonstration that our verification techniques over this semantics work well in practice at this scale. The entire development was carried out in the HOL4 theorem prover.
登录
查看更多内容
DOI:
--
发表时间:
2010
期刊:
ACM-SIGACT Symposium on Principles of Programming Languages
影响因子:
--
作者:
A. Chlipala
通讯作者:
A. Chlipala
DOI:
--
发表时间:
2004
期刊:
ACM SIGPLAN International Conference on Functional Programming
影响因子:
--
作者:
S. Marlow;S. Jones
通讯作者:
S. Jones
DOI:
--
发表时间:
1993
期刊:
Mathematical Foundations of Programming Semantics
影响因子:
--
作者:
A. Pitts
通讯作者:
A. Pitts
DOI:
--
发表时间:
2015
期刊:
ACM-SIGACT Symposium on Principles of Programming Languages
影响因子:
--
作者:
Dominique Devriese;Marco Patrignani;Frank Piessens
通讯作者:
Frank Piessens
DOI:
--
发表时间:
2015
期刊:
ACM SIGPLAN International Conference on Functional Programming
影响因子:
--
作者:
Georg Neis;C. Hur;Jan;Craig McLaughlin;Derek Dreyer;Viktor Vafeiadis
通讯作者:
Viktor Vafeiadis