A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Efficient, formally verifiable data structures using ACL2 single-threaded objects for high-assurance systems
2009
Proceedings of the Eighth International Workshop on the ACL2 Theorem Prover and its Applications - ACL2 '09
Classical data structures such as stacks, queues, and doubleended queues (deques) find broad use in security-critical applications. At the highest Evaluation Assurance Level (EAL) of the Common Criteria, such data structures must be formally specified, and proven to meet their specifications. Formal verification systems can readily reason about unbounded, functional data structures. However, such data structures are in the main not appropriate for direct implementation in high-confidence
doi:10.1145/1637837.1637853
fatcat:b7ephfsyc5estliot2c5voqs7e