Proceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation
Applying source-code verification to a microkernel: the VFiasco project
EW 10 Proceedings of the 10th workshop on ACM SIGOPS European workshop
Finding user/kernel pointer bugs with type inference
SSYM'04 Proceedings of the 13th conference on USENIX Security Symposium - Volume 13
Sound, complete and scalable path-sensitive analysis
Proceedings of the 2008 ACM SIGPLAN conference on Programming language design and implementation
Full functional verification of linked data structures
Proceedings of the 2008 ACM SIGPLAN conference on Programming language design and implementation
seL4: formal verification of an OS kernel
Proceedings of the ACM SIGOPS 22nd symposium on Operating systems principles
Precise reasoning for programs using containers
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Proceedings of the 32nd ACM SIGPLAN conference on Programming language design and implementation
Verification of semantic commutativity conditions and inverse operations on linked data structures
Proceedings of the 32nd ACM SIGPLAN conference on Programming language design and implementation
Hi-index | 0.00 |
We present a technique for developing software that can be automatically formally verified for the absence of memory safety errors. Our technique makes use of Data Representation Synthesis to encapsulate all data structures inside within relational interfaces. We show that operations on relations can be precisely reasoned about using existing techniques for automatic precise reasoning on containers. In this work, we present a port of the Fiasco.OC microkernel to structures generated by Data Representation Synthesis that will be automatically verified by precise container reasoning techniques.