In this paper we describe a novel yet practical approach to the formal verification of implementations. Our approach splits verification into two major parts. The first part verifies an implementation against a low-level specification written using source-code annotations. The second extracts a high-level specification from the implementation with the low-level specification, and proves that it implies the original system specification from which the system was built. Semantics-preserving refactorings are applied to the implementation in both parts to reduce the complexity of the verification. Much of the approach is automated. It reduces the verification burden by distributing it over separate tools and techniques, and it addresses both functional correctness and high-level properties at separate levels. As an illustration, we give a detailed example by verifying an optimized implementation of the Advanced Encryption Standard (AES) against its official specification. © 2008 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Yin, X., Knight, J. C., Nguyen, E. A., & Weimer, W. (2008). Formal verification by reverse synthesis. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5219 LNCS, pp. 305–319). https://doi.org/10.1007/978-3-540-87698-4_26
Mendeley helps you to discover research relevant for your work.