Sign in

Automating the Diagram Method to Prove Correctness of Program Transformations

By David Sabel
We report on the automation of a technique to prove the correctness of program transformations in higher-order program calculi which may permit recursive let-bindings as they occur in functional programming languages. A program transformation is correct if it preserves the observational semantics of programs. In our LRSX Tool the so-called... Show more
February 22, 2019
=
0
Loading PDF…
Loading full text...
Similar articles
Loading recommendations...
=
0
x1
Automating the Diagram Method to Prove Correctness of Program Transformations
Click on play to start listening