Abstract
Translation validation is an alternative to the verification of translators (compilers, code generators). Rather than proving in advance that the compiler always produces a target code which correctly implements the source code (compiler verification), each individual translation (i.e. a run of the compiler) is followed by a validation phase which verifies that the target code produced on this run correctly implements the submitted source program. In order to be a practical alternative to compiler verification, a key feature of this validation is its full automation.
In this paper we demonstrate the feasibility of translation validation for industrial code generators from DC+ -a widely used intermediate format for synchronous languages- to C. We explain the compilation pattern from DC+ to C and advocate new abstraction techniques for a fragment of first order logic as part of the automation of our approach.
This research was done as part of the ESPRIT project SACRES and was supported in part by a grant from the Deutsche Forschungs Gemeinschaft, the Minerva Foundation and an infra-structure grant from the Israeli Ministry of Science and Art
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
M. Abadi and L. Lamport. The existence of refinement mappings. Theoretical Computer Science, 82(2), 1991.
A. Benviniste, P. Le Guernic, and C. Jacquemot. Synchronous programming with events and relations: the SIGNAL language. Science of Computer Programming, 16, 1991.
G. Berry and G. Gonthier. The ESTEREL synchronous programming language: Design, semantics, implementation. Science of Computer Programming, 19(2), 1992.
E. Börger, E. Grädel, and Y. Gurevich. The Classical Decision Problem. Springer, 1996.
P. Caspi, N. Halbwachs, P. Raymond, and D. Pilaud. The synchronous dataflow programming language LUSTRE. Proceedings of the IEEE, 79(9), 1991.
A. Cimatti, F. Giunchiglia, and P. Pecchiari et al. A provably correct embedded verifier for the certification of safety critical software. In CAV, number 1254 in LNCS. Springer, 1997.
The declarative code DC+. ESPRIT Project: SACRES, Project Report, 1997. Version 1.3.
Another look at real-time programming, volume 9 of Proc. of the IEEE, September 1991.
F. Maraninchi. Operational and compositional semantics of synchronous automata compositions. In Proceedings CONCUR, volume 630 of LNCS. Springer, 1992.
A. Pnueli, M. Siegel, and O. Shtrichman. Translation validation for synchronous languages. In ICALP’ 98, LNCS. Springer-Verlag, 1998.
A. Pnueli, M. Siegel, and E. Singermann. Translation validation. In TACAS 98: Tools and Algorithms for the Construction and Analysis of Systems, LNCS. Springer-Verlag, 1998.
private communications with TNI (BREST), Siemens (Munich) and Inria (Rennes).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pnueli, A., Shtrichman, O., Siegel, M. (1999). Translation Validation: From DC+ to C. In: Hutter, D., Stephan, W., Traverso, P., Ullmann, M. (eds) Applied Formal Methods — FM-Trends 98. FM-Trends 1998. Lecture Notes in Computer Science, vol 1641. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48257-1_8
Download citation
DOI: https://doi.org/10.1007/3-540-48257-1_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66462-8
Online ISBN: 978-3-540-48257-4
eBook Packages: Springer Book Archive