Refinement calculus: a basis for translation validation, debugging and certification

Authors:
Rohit N. Kundaji;R. K. Shyamasundar
Affiliations:
School of Technology and Computer Science, Tata Institute of Fundamental Research, Mumbai, India;IBM Research, India Research Lab, IIT Delhi Hauz Khas, New Delhi, India and School of Technology and Computer Science, Tata Institute of Fundamental Research, Mumbai, India
Venue:
Theoretical Computer Science - Algebraic methods in language processing
Year:
2006

Citing 10
Cited 2

The existence of refinement mappings

Theoretical Computer Science
Translation validation for an optimizing compiler

PLDI '00 Proceedings of the ACM SIGPLAN 2000 conference on Programming language design and implementation
Symbolic Debugging of Optimized Code

ACM Transactions on Programming Languages and Systems (TOPLAS)
Modern Compiler Implementation in C

Modern Compiler Implementation in C
Validating software pipelining optimizations

CASES '02 Proceedings of the 2002 international conference on Compilers, architecture, and synthesis for embedded systems
Translation Validation for Synchronous Languages

ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Translation Validation

TACAS '98 Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Validation of Optimizing Compilers,

Validation of Optimizing Compilers,
Compiling with proofs

Compiling with proofs
Nontransparent debugging of optimized code

Nontransparent debugging of optimized code

Malware: from modelling to practical detection

ICDCIT'10 Proceedings of the 6th international conference on Distributed Computing and Internet Technology
A proof system for a PGAS language

Concurrency, Compositionality, and Correctness

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we show how refinement calculus provides a basis for translation validation of optimized programs written in high level languages. Towards such a direction, we shall provide a generalized proof rule for establishing refinement of source and target programs for which one need not have to know the underlying program transformations. Our method is supported by a semi-automatic tool that uses a theorem prover for validating the verification conditions. We further show that the translation validation infrastructure provides an effective basis for deriving semantic debuggers and illustrate the development of a simple debugger for optimized programs using this approach using Prolog. A distinct advantage of semantic debugging is that it permits the user to change values at run-time only when the values are consistent with the underlying semantics.