Reasoning About a Machine with Local Capabilities: Provably Safe Stack and Return Pointer Management - Technical Appendix Including Proofs and Details

Lau Skorstengaard, Dominique Devriese, Lars Birkedal

Research output: Book/ReportOther report

Abstract

We propose a calling convention for capability machines with local capabilities. The calling convention ensures local-state encapsulation and well-bracketed control flow. We use the calling convention in a hand-full of program examples and prove that they behave correctly. The correctness proofs use a logical relation that is also presented in this appendix. This is the technical appendix for the paper with the same name and authors accepted at ESOP18 and under review for TOPLAS.
Original languageEnglish
Publication statusPublished - 14 Feb 2019

Keywords

  • cs.PL

Fingerprint Dive into the research topics of 'Reasoning About a Machine with Local Capabilities: Provably Safe Stack and Return Pointer Management - Technical Appendix Including Proofs and Details'. Together they form a unique fingerprint.

Cite this