Z in practice
Design and verification of secure systems
SOSP '81 Proceedings of the eighth ACM symposium on Operating systems principles
The verified software repository: a step towards the verifying compiler
Formal Aspects of Computing
Formal Refinement for Operating System Kernels
Formal Refinement for Operating System Kernels
POSIX and the Verification Grand Challenge: A Roadmap
ICECCS '08 Proceedings of the 13th IEEE International Conference on on Engineering of Complex Computer Systems
A formal security policy for xenon
Proceedings of the 6th ACM workshop on Formal methods in security engineering
Formal methods: Practice and experience
ACM Computing Surveys (CSUR)
VCC: A Practical System for Verifying Concurrent C
TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
seL4: formal verification of an OS kernel
Proceedings of the ACM SIGOPS 22nd symposium on Operating systems principles
Mechanising Data-Types for Kernel Design in Z
Formal Methods: Foundations and Applications
| Hi-index | 0.00 |
Separation kernels are key components in embedded applications. Their small size and widespread use in high-integrity environments make them good targets for formal modelling and verification. We summarise results from the mechanisation of a separation kernel scheduler using the Z/Eves theorem prover. We concentrate on key data structures to model scheduler operations. The results are part of an experiment in a Grand Challenge in software verification, as part of a pilot project in verified OS kernels. The project aims at creating a mechanised formal model of kernel components that gets refined to code. This provides a set of reusable components, proof strategies, and general lemmas. Important findings about properties and requirements are also discussed.