A flat reachability-based measure for CakeML's cost semantics
Paper in proceeding, 2021

The CakeML project has recently developed a verified cost semantics that allows reasoning about the space safety of CakeML programs. With this space cost semantics, compiled machine code can be proven to have tight memory bounds ensuring no out-of-memory errors occur during execution. This paper proposes a new cost semantics which is designed to make proofs about space safety significantly simpler than they were with the original version. The work described here has been developed in the HOL4 theorem prover.

compiler verification

cost semantics

space usage

Author

Alejandro Gómez Londoño

Chalmers, Computer Science and Engineering (Chalmers), Formal methods

Magnus Myreen

Chalmers, Computer Science and Engineering (Chalmers), Formal methods

ACM International Conference Proceeding Series

1-9
9781450386449 (ISBN)

33rd Symposium on Implementation and Application of Functional Languages, IFL 2021
Virtual, Online, Netherlands,

Subject Categories

Embedded Systems

Computer Science

Computer Systems

DOI

10.1145/3544885.3544887

More information

Latest update

12/6/2022