A unified memory model for pointers

Authors:
Harvey Tuch;Gerwin Klein
Affiliations:
National ICT Australia, Sydney, Australia, School of Computer Science and Engineering, UNSW, Sydney, Australia;National ICT Australia, Sydney, Australia, School of Computer Science and Engineering, UNSW, Sydney, Australia
Venue:
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Year:
2005

Citing 12
Cited 5

Kit: A Study in Operating System Verification

IEEE Transactions on Software Engineering
On micro-kernel construction

SOSP '95 Proceedings of the fifteenth ACM symposium on Operating systems principles
Automatic verification of pointer programs using monadic second-order logic

Proceedings of the ACM SIGPLAN 1997 conference on Programming language design and implementation
Specification and verification of the UCLA Unix security kernel

Communications of the ACM
Separation Logic: A Logic for Shared Mutable Data Structures

LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Modelization and verification of a multiprocessor realtime OS kernel

Proceedings of the 7th IFIP WG6.1 International Conference on Formal Description Techniques VII
Proving Pointer Programs in Hoare Logic

MPC '00 Proceedings of the 5th International Conference on Mathematics of Program Construction
Formal Methods: A Practical Tool for OS Implementors

HOTOS '97 Proceedings of the 6th Workshop on Hot Topics in Operating Systems (HotOS-VI)
CCured: type-safe retrofitting of legacy software

ACM Transactions on Programming Languages and Systems (TOPLAS)
Proving pointer programs in higher-order logic

Information and Computation - Special issue: 19th international conference on automated deduction (CADE-19)
Isabelle/HOL: a proof assistant for higher-order logic

Isabelle/HOL: a proof assistant for higher-order logic
On the correctness of operating system kernels

TPHOLs'05 Proceedings of the 18th international conference on Theorem Proving in Higher Order Logics

Running the manual: an approach to high-assurance microkernel development

Proceedings of the 2006 ACM SIGPLAN workshop on Haskell
Types, bytes, and separation logic

Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Structured Types and Separation Logic

Electronic Notes in Theoretical Computer Science (ENTCS)
Formal Memory Models for the Verification of Low-Level Operating-System Code

Journal of Automated Reasoning
Formal verification of the heap manager of an operating system using separation logic

ICFEM'06 Proceedings of the 8th international conference on Formal Methods and Software Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

One of the challenges in verifying systems level code is the low-level, untyped view of the machine state that operating systems have. We describe a way to faithfully formalise this view while at the same time providing an easy-to-use, abstract and typed view of memory where possible. We have used this formal memory model to verify parts of the virtual memory subsystem of the L4 high-performance microkernel. All formalisations and proofs have been carried out in the theorem prover Isabelle and the verified code has been integrated into the current implementation of L4.