Add to ORKGAbstract. Two programs or fragments of program are mutually equiv-alent i ↵ either they both diverge or they end up in similar states. Mutual equivalence is desirable in many contexts, ranging from capturing pro-gram equivalence or correctness of program transformations within the same language, to capturing correctness of compilers from one language to another. This paper introduces a language-independent proof system for mutual equivalence. The proof system is parametric in the opera-tional semantics of the two languages and in a state similarity relation.
Inter-language interoperability is big business, as the success of Microsoft’s.NET and COM and Sun’s...
We examine the problem of finding fully abstract translations between programming languages, i.e., t...
AbstractA new notion of input/output equivalence of distributed imperative programs, with synchronou...
Abstract. Two programs are mutually equivalent if they both diverge or they end up in similar states...
International audienceTwo programs are mutually equivalent if they both diverge or they end up in si...
International audienceTwo programs are mutually equivalent if, for the same input, either they both ...
We present language-independent formal methods that are parameterized by the operational semantics o...
Program equivalence is the problem of proving that two programs are equal under some definition of e...
We develop foundations for proving properties relating two programs. Our formalization is based on a...
We describe two approaches to showing program equivalence. Program equivalence is useful for showing...
We target the problem of automatically synthesizing proofs of semantic equivalence between two progr...
A programming language is viewed as a language for expressing “instructions” for a computation to be...
We examine the problem of finding fully abstract translations between programming languages, i.e., t...
Abstract. Existing verified compilers are proved correct under a closed-world assumption, i.e., that...
AbstractA program schema defines a class of programs, all of which have identical statement structur...
Inter-language interoperability is big business, as the success of Microsoft’s.NET and COM and Sun’s...
We examine the problem of finding fully abstract translations between programming languages, i.e., t...
AbstractA new notion of input/output equivalence of distributed imperative programs, with synchronou...
Abstract. Two programs are mutually equivalent if they both diverge or they end up in similar states...
International audienceTwo programs are mutually equivalent if they both diverge or they end up in si...
International audienceTwo programs are mutually equivalent if, for the same input, either they both ...
We present language-independent formal methods that are parameterized by the operational semantics o...
Program equivalence is the problem of proving that two programs are equal under some definition of e...
We develop foundations for proving properties relating two programs. Our formalization is based on a...
We describe two approaches to showing program equivalence. Program equivalence is useful for showing...
We target the problem of automatically synthesizing proofs of semantic equivalence between two progr...
A programming language is viewed as a language for expressing “instructions” for a computation to be...
We examine the problem of finding fully abstract translations between programming languages, i.e., t...
Abstract. Existing verified compilers are proved correct under a closed-world assumption, i.e., that...
AbstractA program schema defines a class of programs, all of which have identical statement structur...
Inter-language interoperability is big business, as the success of Microsoft’s.NET and COM and Sun’s...
We examine the problem of finding fully abstract translations between programming languages, i.e., t...
AbstractA new notion of input/output equivalence of distributed imperative programs, with synchronou...