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

02/14/2019
by   Lau Skorstengaard, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/02/2020

Uninitialized Capabilities

This technical report describes a new extension to capability machines. ...
research
01/29/2022

Logical Pseudocode: Connecting Algorithms with Proofs

Proofs (sequent calculus, natural deduction) and imperative algorithms (...
research
09/30/2022

Technical Report on: Anchoring Sagittal Plane Templates in a Spatial Quadruped

This technical report provides a more thorough treatment of the proofs a...
research
05/02/2022

A Critique of Uribe's "P vs. NP"

In this critique, we examine the technical report by Daniel Uribe entitl...
research
02/18/2020

ShadowGuard : Optimizing the Policy and Mechanism of Shadow Stack Instrumentation using Binary Static Analysis

A shadow stack validates on-stack return addresses and prevents arbitrar...
research
12/04/2021

LoNLI: An Extensible Framework for Testing Diverse Logical Reasoning Capabilities for NLI

Natural Language Inference (NLI) is considered a representative task to ...

Please sign up or login with your details

Forgot password? Click here to reset