eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Open Access Series in Informatics
2190-6807
2014-07-13
40
0
0
10.4230/OASIcs.WPTE.2014
article
OASIcs, Volume 40, WPTE'14, Complete Volume
Schmidt-Schauß, Manfred
Sakai, Masahiko
Sabel, David
Chiba, Yuki
OASIcs, Volume 40, WPTE'14, Complete Volume
https://drops.dagstuhl.de/storage/01oasics/oasics-vol040-wpte2014/OASIcs.WPTE.2014/OASIcs.WPTE.2014.pdf
Conference proceedings, Formal Definitions and Theory, Translator writing systems and compiler generators, Specifying and Verifying and Reasoning about Programs, Semantics of Programming Languages, Mathematical Logic, Grammars and Other Rewriting Systems
eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Open Access Series in Informatics
2190-6807
2014-07-13
40
i
xv
10.4230/OASIcs.WPTE.2014.i
article
Frontmatter, Table of Contents, Preface, Workshop Organization
Schmidt-Schauß, Manfred
Sakai, Masahiko
Sabel, David
Chiba, Yuki
Frontmatter, Table of Contents, Preface, Workshop Organization
https://drops.dagstuhl.de/storage/01oasics/oasics-vol040-wpte2014/OASIcs.WPTE.2014.i/OASIcs.WPTE.2014.i.pdf
Frontmatter
Table of Contents
Preface
Workshop Organization
eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Open Access Series in Informatics
2190-6807
2014-07-13
40
1
1
10.4230/OASIcs.WPTE.2014.1
article
HERMIT: An Equational Reasoning Model to Implementation Rewrite System for Haskell (Invited Talk)
Gill, Andrew
HERMIT is a rewrite system for Haskell.
https://drops.dagstuhl.de/storage/01oasics/oasics-vol040-wpte2014/OASIcs.WPTE.2014.1/OASIcs.WPTE.2014.1.pdf
Program Transformation
Equational Reasoning
Optimization
eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Open Access Series in Informatics
2190-6807
2014-07-13
40
3
14
10.4230/OASIcs.WPTE.2014.3
article
Notes on Structure-Preserving Transformations of Conditional Term Rewrite Systems
Gmeiner, Karl
Nishida, Naoki
Transforming conditional term rewrite systems (CTRSs) into unconditional systems (TRSs) is a common approach to analyze properties of CTRSs via the simpler framework of unconditional rewriting. In the past many different transformations have been introduced for this purpose. One class of transformations, so-called unravelings, have been analyzed extensively in the past.
In this paper we provide an overview on another class of transformations that we call structure-preserving transformations. In these transformations the structure of the conditional rule, in particular their left-hand side is preserved in contrast to unravelings. We provide an overview of transformations of this type and define a new transformation that improves previous approaches.
https://drops.dagstuhl.de/storage/01oasics/oasics-vol040-wpte2014/OASIcs.WPTE.2014.3/OASIcs.WPTE.2014.3.pdf
conditional term rewriting
unraveling
condition elimination
eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Open Access Series in Informatics
2190-6807
2014-07-13
40
15
26
10.4230/OASIcs.WPTE.2014.15
article
Verifying Optimizations for Concurrent Programs
Mansky, William
Gunter, Elsa L.
While program correctness for compiled languages depends fundamentally on compiler correctness, compiler optimizations are not usually formally verified due to the effort involved, particularly in the presence of concurrency. In this paper, we present a framework for stating and reasoning about compiler optimizations and transformations on programs in the presence of relaxed memory models. The core of the framework is the PTRANS specification language, in which program transformations are expressed as rewrites on control flow graphs with temporal logic side conditions. We demonstrate our technique by verifying the correctness of a redundant store elimination optimization in a simple LLVM-like intermediate language, relying on a theorem that allows us to lift single-thread simulation relations to simulations on multithreaded programs.
https://drops.dagstuhl.de/storage/01oasics/oasics-vol040-wpte2014/OASIcs.WPTE.2014.15/OASIcs.WPTE.2014.15.pdf
optimizing compilers
interactive theorem proving
program transformations
temporal logic
relaxed memory models
eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Open Access Series in Informatics
2190-6807
2014-07-13
40
27
38
10.4230/OASIcs.WPTE.2014.27
article
Inverse Unfold Problem and Its Heuristic Solving
Nagashima, Masanori
Kato, Tomofumi
Sakai, Masahiko
Nishida, Naoki
Unfold/fold transformations have been widely studied in various programming paradigms and are used in program transformations, theorem proving, and so on. This paper, by using an example, show that
restoring an one-step unfolding is not easy, i.e., a challenging task, since some rules used by unfolding may be lost. We formalize this problem by regarding one-step program transformation as a relation. Next we discuss some issues on a specific framework, called pure-constructor systems, which constitute a subclass of conditional term rewriting systems. We show that the inverse of T preserves rewrite relations if T preserves rewrite relations and the signature. We propose a heuristic procedure to solve the problem, and show its successful examples. We improve the procedure, and show examples for which the improvement takes effect.
https://drops.dagstuhl.de/storage/01oasics/oasics-vol040-wpte2014/OASIcs.WPTE.2014.27/OASIcs.WPTE.2014.27.pdf
program transformation
unfolding
conditional term rewriting system
eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Open Access Series in Informatics
2190-6807
2014-07-13
40
39
50
10.4230/OASIcs.WPTE.2014.39
article
On Proving Soundness of the Computationally Equivalent Transformation for Normal Conditional Term Rewriting Systems by Using Unravelings
Nishida, Naoki
Yanagisawa, Makishi
Gmeiner, Karl
In this paper, we show that the SR transformation, a computationally equivalent transformation proposed by Serbanuta and Rosu, is sound for weakly left-linear normal conditional term rewriting systems (CTRS). Here, soundness for a CTRS means that reduction of the transformed unconditional term rewriting system (TRS) creates no undesired reduction for the CTRS. We first show that every reduction sequence of the transformed TRS starting with a term corresponding to the one considered on the CTRS is simulated by the reduction of the TRS obtained by the simultaneous unraveling. Then, we use the fact that the unraveling is sound for weakly left-linear normal CTRSs.
https://drops.dagstuhl.de/storage/01oasics/oasics-vol040-wpte2014/OASIcs.WPTE.2014.39/OASIcs.WPTE.2014.39.pdf
conditional term rewriting
unraveling
condition elimination
eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Open Access Series in Informatics
2190-6807
2014-07-13
40
51
62
10.4230/OASIcs.WPTE.2014.51
article
Structural Rewriting in the pi-Calculus
Sabel, David
We consider reduction in the synchronous pi-calculus with replication, without sums. Usual definitions of reduction in the pi-calculus use a closure w.r.t. structural congruence
of processes. In this paper we operationalize structural congruence by providing a reduction relation for pi-processes which also performs necessary structural conversions explicitly by
rewrite rules. As we show, a subset of structural congruence axioms is sufficient. We show that our rewrite strategy is equivalent to the usual strategy including structural congruence w.r.t.the observation of barbs and thus w.r.t. may- and should-testing equivalence in the pi-calculus.
https://drops.dagstuhl.de/storage/01oasics/oasics-vol040-wpte2014/OASIcs.WPTE.2014.51/OASIcs.WPTE.2014.51.pdf
Process calculi
Rewriting
Semantics
eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Open Access Series in Informatics
2190-6807
2014-07-13
40
63
74
10.4230/OASIcs.WPTE.2014.63
article
Contextual Equivalences in Call-by-Need and Call-By-Name Polymorphically Typed Calculi (Preliminary Report)
Schmidt-Schauß, Manfred
Sabel, David
This paper presents a call-by-need polymorphically typed lambda-calculus with letrec, case, constructors and seq. The typing of the calculus is modelled in a system-F style. Contextual equivalence is used as semantics of expressions. We also define a call-by-name variant without letrec. We adapt several tools and criteria for recognizing correct program transformations to polymorphic typing, in particular an inductive applicative simulation.
https://drops.dagstuhl.de/storage/01oasics/oasics-vol040-wpte2014/OASIcs.WPTE.2014.63/OASIcs.WPTE.2014.63.pdf
functional programming
polymorphic typing
contextual equivalence
semantics