The Transitive Composability of Relation Transition Systems

Relation Transition Systems (RTSs) have recently been proposed as a foundation for reasoning effectively about program equivalence in higher-order imperative languages like ML. RTSs fruitfully synthesize the co-inductive style of bisimulation-based methods with the treatment of local state in recent work on Step-indexed Kripke Logical Relations (SKLRs). Like SKLRs, RTSs are designed to have the potential to scale to inter-language reasoning; but unlike SKLRs, RTS proofs are also transitively composable, which is of critical importance for applications such as multi-stage verified compilation.

Provided by: Max Planck Institute for Software Systems Topic: Software Date Added: Jan 2012 Format: PDF

Find By Topic