Verification of the IBOS Browser Security Properties in Reachability Logic

05/25/2020
by   Stephen Skeirik, et al.
0

This paper presents a rewriting logic specification of the Illinois Browser Operating System (IBOS) and defines several security properties, including the same-origin policy (SOP) in reachability logic. It shows how these properties can be deductively verified using our constructor-based reachability logic theorem prover. This paper also highlights the reasoning techniques used in the proof and three modularity principles that have been crucial to scale up and complete the verification effort.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/25/2018

All-Path Reachability Logic

This paper presents a language-independent proof system for reachability...
research
08/16/2019

Modular Verification of Heap Reachability Properties in Separation Logic

The correctness of many algorithms and data structures depends on reacha...
research
03/31/2022

Reachability Logic for Low-Level Programs

Automatic exploit generation is a relatively new area of research. Work ...
research
06/28/2022

Quantitative Verification of Opacity Properties in Security Systems

We delineate a methodology for the specification and verification of flo...
research
09/15/2017

A Constructor-Based Reachability Logic for Rewrite Theories

Reachability logic has been applied to K rewrite-rule-based language def...
research
09/25/2021

Verification of Switched Stochastic Systems via Barrier Certificates

The paper presents a methodology for temporal logic verification of cont...
research
08/23/2017

The Reachability of Computer Programs

Would it be possible to explain the emergence of new computational ideas...

Please sign up or login with your details

Forgot password? Click here to reset