Abstract not found

We present a paradigm for proving the correctness of compilers for languages with parallelism. The source language is given a denotational semantics as a compositional translation to a higher-order process calculus. The target language is also given a denotational semantics as a compositional translation to the same process calculus. We show the compiler is correct in that it preserves denotation up to bisimulation. The target language is also given an operational semantics, and this operational semantics is shown correct in the sense that it is branching-bisimilar to the denotational semantics of the target language. Together, these results show that for any program, the operational semantics of the target code is branching-bisimilar to the semantics of the source code. 1 Introduction In a series of papers in the early 80's [35, 34, 36, 12] we proposed a paradigm for semantics-based compiler correctness, and over the last several years we have begun putting this paradigm into practic...

. This paper extends previous work in compiler derivation and verification to languages with true-concurrency semantics. We extend the -calculus to model process-centered concurrent computation, and give the semantics of a small language in terms of this calculus. We then define a target abstract machine whose states have denotations in the same calculus. We prove the correctness of a compiler for our language: the denotation of the compiled code is shown to be strongly bisimilar to the denotation of the source program, and the abstract machine running the compiled code is shown to be branching-bisimilar to the source program's denotation. 1 Introduction Our original goal was to verify a compiler for Linda [8], using that language as a representative of modern concurrent language design. Upon searching the literature, we found a vast amount of work on models of concurrency, but little that was obviously applicable to compiler derivation and verification. Accordingly we decided to tac...

We propose a general format of Structural Operational Semantics rules that can deal with parameterized and state-bearing processes. Plotkin's original SOS denitions of imperative programs and of CSP, as well as the operational semantics of value passing process calculi like LOTOS, CRL and real-time ACP are covered by this format. We prove that the format provides a well-dened operational semantics with respect to an appropriate notion of bisimulation, and identify sub-formats with desirable niteness and decidability properties. 1 Introduction Plotkin's [19, 20] method of Structural Operational Semantics (SOS) is widely used to dene the operational meaning of programming languages and process calculi. In recent years it has become more and more clear that many of the key theorems in operational semantics are to a large extent language independent: many important properties of SOS style denitions follow from the syntactic form of the inference rules, and can be established f...

Abstract. We present a rule format for structural operational semantics to guarantee that the associated labelled transition system is bounded nondeterministic. 1

www.elsevier.com/locate/jlap An alternative formulation of operational conservativity with binding terms