The existence of refinement mappings
Theoretical Computer Science
Synchronous programming with events and relations: the SIGNAL language and its semantics
Science of Computer Programming
Temporal verification of reactive systems: safety
Temporal verification of reactive systems: safety
A Discipline of Programming
Translation Validation for Synchronous Languages
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
TACAS '98 Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Compiling with proofs
Malware: from modelling to practical detection
ICDCIT'10 Proceedings of the 6th international conference on Distributed Computing and Internet Technology
| Hi-index | 0.00 |
In several key safety-critical embedded applications, it has become mandatory to verify the process of translation by compilers since usually compilers are only certified rather than verified. In this paper, we shall describe a methodology and a system for the validation of translation of a safe-subset of Ada to assembly language programs. The work described here is an application of Translation Validation technique to safety-critical programs that are developed using standard software engineering practices using safe subsets of Ada such as SPARK Ada [3]. Our method consists of converting the high level language (HLL) program and its object code to a common semantic representation such as Fair Transition System (FTS) [6], and then establishing that the object code is a refinement of the HLL program. The proof of refinement is performed using STeP (Stanford Temporal Prover) theorem prover. The proposed approach also has the additional advantage that the embedded system remains unaffected by compiler revisions/updates. We conclude with a discussion of our practical experience, effectiveness and further possibilities.