Types, Maps and Separation Logic

Authors:
Rafal Kolanski;Gerwin Klein
Affiliations:
Sydney Research Lab., NICTA, Australia and School of Computer Science and Engineering, UNSW, Sydney, Australia;Sydney Research Lab., NICTA, Australia and School of Computer Science and Engineering, UNSW, Sydney, Australia
Venue:
TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
Year:
2009

Citing 12
Cited 2

BI as an assertion language for mutable data structures

POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Separation Logic: A Logic for Shared Mutable Data Structures

LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Permission accounting in separation logic

Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Types, bytes, and separation logic

Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Local Action and Abstract Separation Logic

LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
Towards a practical, verified kernel

HOTOS'07 Proceedings of the 11th USENIX workshop on Hot topics in operating systems
KeY-C: A Tool for Verification of C Programs

CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Mapped Separation Logic

VSTTE '08 Proceedings of the 2nd international conference on Verified Software: Theories, Tools, Experiments
Formal Verification of C Systems Code

Journal of Automated Reasoning
Formal Memory Models for the Verification of Low-Level Operating-System Code

Journal of Automated Reasoning
Formal pervasive verification of a paging mechanism

TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
On the verification of memory management mechanisms

CHARME'05 Proceedings of the 13 IFIP WG 10.5 international conference on Correct Hardware Design and Verification Methods

Lyrebird: assigning meanings to machines

SSV'10 Proceedings of the 5th international conference on Systems software verification
Comprehensive formal verification of an OS microkernel

ACM Transactions on Computer Systems (TOCS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a separation-logic framework for reasoning about low-level C code in the presence of virtual memory. We describe our abstract, generic Isabelle/HOL framework for reasoning about virtual memory in separation logic, and we instantiate this framework to a precise, formal model of ARMv6 page tables. The logic supports the usual separation logic rules, including the frame rule, and extends separation logic with additional basic predicates for mapping virtual to physical addresses. We build on earlier work to parse potentially type-unsafe, system-level C code directly into Isabelle/HOL and further instantiate the separation logic framework to C.