Volume
OASIcs, Volume 40
First International Workshop on Rewriting Techniques for Program Transformations and Evaluation
- Part of: Series: Open Access Series in Informatics (OASIcs)
Event
WPTE 2014, July 13, 2014, Vienna, AustriaEditors
Publication Details
- published at: 2014-07-13
- Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
- ISBN: 978-3-939897-70-5
- DBLP: db/conf/rta/wpte2014
Access Numbers
- Detailed Access Statistics available here
-
Total Document Accesses (updated on a weekly basis):
0PDF Downloads
Documents
No documents found matching your filter selection.
Document
Complete Volume
OASIcs, Volume 40, WPTE'14, Complete Volume
Abstract
OASIcs, Volume 40, WPTE'14, Complete Volume
Cite as
First International Workshop on Rewriting Techniques for Program Transformations and Evaluation. Open Access Series in Informatics (OASIcs), Volume 40, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)
Copy BibTex To Clipboard
@Proceedings{schmidtschau_et_al:OASIcs.WPTE.2014,
title = {{OASIcs, Volume 40, WPTE'14, Complete Volume}},
booktitle = {First International Workshop on Rewriting Techniques for Program Transformations and Evaluation},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-70-5},
ISSN = {2190-6807},
year = {2014},
volume = {40},
editor = {Schmidt-Schau{\ss}, Manfred and Sakai, Masahiko and Sabel, David and Chiba, Yuki},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.WPTE.2014},
URN = {urn:nbn:de:0030-drops-46216},
doi = {10.4230/OASIcs.WPTE.2014},
annote = {Keywords: 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}
}
Document
Front Matter
Frontmatter, Table of Contents, Preface, Workshop Organization
Abstract
Frontmatter, Table of Contents, Preface, Workshop Organization
Cite as
First International Workshop on Rewriting Techniques for Program Transformations and Evaluation. Open Access Series in Informatics (OASIcs), Volume 40, pp. i-xv, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)
Copy BibTex To Clipboard
@InProceedings{schmidtschau_et_al:OASIcs.WPTE.2014.i,
author = {Schmidt-Schau{\ss}, Manfred and Sakai, Masahiko and Sabel, David and Chiba, Yuki},
title = {{Frontmatter, Table of Contents, Preface, Workshop Organization}},
booktitle = {First International Workshop on Rewriting Techniques for Program Transformations and Evaluation},
pages = {i--xv},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-70-5},
ISSN = {2190-6807},
year = {2014},
volume = {40},
editor = {Schmidt-Schau{\ss}, Manfred and Sakai, Masahiko and Sabel, David and Chiba, Yuki},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.WPTE.2014.i},
URN = {urn:nbn:de:0030-drops-45814},
doi = {10.4230/OASIcs.WPTE.2014.i},
annote = {Keywords: Frontmatter, Table of Contents, Preface, Workshop Organization}
}
Document
Invited Talk
HERMIT: An Equational Reasoning Model to Implementation Rewrite System for Haskell (Invited Talk)
Abstract
HERMIT is a rewrite system for Haskell.
Cite as
Andrew Gill. HERMIT: An Equational Reasoning Model to Implementation Rewrite System for Haskell (Invited Talk). In First International Workshop on Rewriting Techniques for Program Transformations and Evaluation. Open Access Series in Informatics (OASIcs), Volume 40, p. 1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)
Copy BibTex To Clipboard
@InProceedings{gill:OASIcs.WPTE.2014.1,
author = {Gill, Andrew},
title = {{HERMIT: An Equational Reasoning Model to Implementation Rewrite System for Haskell}},
booktitle = {First International Workshop on Rewriting Techniques for Program Transformations and Evaluation},
pages = {1--1},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-70-5},
ISSN = {2190-6807},
year = {2014},
volume = {40},
editor = {Schmidt-Schau{\ss}, Manfred and Sakai, Masahiko and Sabel, David and Chiba, Yuki},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.WPTE.2014.1},
URN = {urn:nbn:de:0030-drops-45888},
doi = {10.4230/OASIcs.WPTE.2014.1},
annote = {Keywords: Program Transformation, Equational Reasoning, Optimization}
}
Document
Notes on Structure-Preserving Transformations of Conditional Term Rewrite Systems
Abstract
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.
Cite as
Karl Gmeiner and Naoki Nishida. Notes on Structure-Preserving Transformations of Conditional Term Rewrite Systems. In First International Workshop on Rewriting Techniques for Program Transformations and Evaluation. Open Access Series in Informatics (OASIcs), Volume 40, pp. 3-14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)
Copy BibTex To Clipboard
@InProceedings{gmeiner_et_al:OASIcs.WPTE.2014.3,
author = {Gmeiner, Karl and Nishida, Naoki},
title = {{Notes on Structure-Preserving Transformations of Conditional Term Rewrite Systems}},
booktitle = {First International Workshop on Rewriting Techniques for Program Transformations and Evaluation},
pages = {3--14},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-70-5},
ISSN = {2190-6807},
year = {2014},
volume = {40},
editor = {Schmidt-Schau{\ss}, Manfred and Sakai, Masahiko and Sabel, David and Chiba, Yuki},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.WPTE.2014.3},
URN = {urn:nbn:de:0030-drops-45871},
doi = {10.4230/OASIcs.WPTE.2014.3},
annote = {Keywords: conditional term rewriting, unraveling, condition elimination}
}
Document
Verifying Optimizations for Concurrent Programs
Abstract
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.
Cite as
William Mansky and Elsa L. Gunter. Verifying Optimizations for Concurrent Programs. In First International Workshop on Rewriting Techniques for Program Transformations and Evaluation. Open Access Series in Informatics (OASIcs), Volume 40, pp. 15-26, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)
Copy BibTex To Clipboard
@InProceedings{mansky_et_al:OASIcs.WPTE.2014.15,
author = {Mansky, William and Gunter, Elsa L.},
title = {{Verifying Optimizations for Concurrent Programs}},
booktitle = {First International Workshop on Rewriting Techniques for Program Transformations and Evaluation},
pages = {15--26},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-70-5},
ISSN = {2190-6807},
year = {2014},
volume = {40},
editor = {Schmidt-Schau{\ss}, Manfred and Sakai, Masahiko and Sabel, David and Chiba, Yuki},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.WPTE.2014.15},
URN = {urn:nbn:de:0030-drops-45869},
doi = {10.4230/OASIcs.WPTE.2014.15},
annote = {Keywords: optimizing compilers, interactive theorem proving, program transformations, temporal logic, relaxed memory models}
}
Document
Inverse Unfold Problem and Its Heuristic Solving
Abstract
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.
Cite as
Masanori Nagashima, Tomofumi Kato, Masahiko Sakai, and Naoki Nishida. Inverse Unfold Problem and Its Heuristic Solving. In First International Workshop on Rewriting Techniques for Program Transformations and Evaluation. Open Access Series in Informatics (OASIcs), Volume 40, pp. 27-38, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)
Copy BibTex To Clipboard
@InProceedings{nagashima_et_al:OASIcs.WPTE.2014.27,
author = {Nagashima, Masanori and Kato, Tomofumi and Sakai, Masahiko and Nishida, Naoki},
title = {{Inverse Unfold Problem and Its Heuristic Solving}},
booktitle = {First International Workshop on Rewriting Techniques for Program Transformations and Evaluation},
pages = {27--38},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-70-5},
ISSN = {2190-6807},
year = {2014},
volume = {40},
editor = {Schmidt-Schau{\ss}, Manfred and Sakai, Masahiko and Sabel, David and Chiba, Yuki},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.WPTE.2014.27},
URN = {urn:nbn:de:0030-drops-45848},
doi = {10.4230/OASIcs.WPTE.2014.27},
annote = {Keywords: program transformation, unfolding, conditional term rewriting system}
}
Document
On Proving Soundness of the Computationally Equivalent Transformation for Normal Conditional Term Rewriting Systems by Using Unravelings
Abstract
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.
Cite as
Naoki Nishida, Makishi Yanagisawa, and Karl Gmeiner. On Proving Soundness of the Computationally Equivalent Transformation for Normal Conditional Term Rewriting Systems by Using Unravelings. In First International Workshop on Rewriting Techniques for Program Transformations and Evaluation. Open Access Series in Informatics (OASIcs), Volume 40, pp. 39-50, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)
Copy BibTex To Clipboard
@InProceedings{nishida_et_al:OASIcs.WPTE.2014.39,
author = {Nishida, Naoki and Yanagisawa, Makishi and Gmeiner, Karl},
title = {{On Proving Soundness of the Computationally Equivalent Transformation for Normal Conditional Term Rewriting Systems by Using Unravelings}},
booktitle = {First International Workshop on Rewriting Techniques for Program Transformations and Evaluation},
pages = {39--50},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-70-5},
ISSN = {2190-6807},
year = {2014},
volume = {40},
editor = {Schmidt-Schau{\ss}, Manfred and Sakai, Masahiko and Sabel, David and Chiba, Yuki},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.WPTE.2014.39},
URN = {urn:nbn:de:0030-drops-45850},
doi = {10.4230/OASIcs.WPTE.2014.39},
annote = {Keywords: conditional term rewriting, unraveling, condition elimination}
}
Document
Structural Rewriting in the pi-Calculus
Abstract
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.
Cite as
David Sabel. Structural Rewriting in the pi-Calculus. In First International Workshop on Rewriting Techniques for Program Transformations and Evaluation. Open Access Series in Informatics (OASIcs), Volume 40, pp. 51-62, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)
Copy BibTex To Clipboard
@InProceedings{sabel:OASIcs.WPTE.2014.51,
author = {Sabel, David},
title = {{Structural Rewriting in the pi-Calculus}},
booktitle = {First International Workshop on Rewriting Techniques for Program Transformations and Evaluation},
pages = {51--62},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-70-5},
ISSN = {2190-6807},
year = {2014},
volume = {40},
editor = {Schmidt-Schau{\ss}, Manfred and Sakai, Masahiko and Sabel, David and Chiba, Yuki},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.WPTE.2014.51},
URN = {urn:nbn:de:0030-drops-45827},
doi = {10.4230/OASIcs.WPTE.2014.51},
annote = {Keywords: Process calculi, Rewriting, Semantics}
}
Document
Preliminary Report
Contextual Equivalences in Call-by-Need and Call-By-Name Polymorphically Typed Calculi (Preliminary Report)
Abstract
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.
Cite as
Manfred Schmidt-Schauß and David Sabel. Contextual Equivalences in Call-by-Need and Call-By-Name Polymorphically Typed Calculi (Preliminary Report). In First International Workshop on Rewriting Techniques for Program Transformations and Evaluation. Open Access Series in Informatics (OASIcs), Volume 40, pp. 63-74, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)
Copy BibTex To Clipboard
@InProceedings{schmidtschau_et_al:OASIcs.WPTE.2014.63,
author = {Schmidt-Schau{\ss}, Manfred and Sabel, David},
title = {{Contextual Equivalences in Call-by-Need and Call-By-Name Polymorphically Typed Calculi}},
booktitle = {First International Workshop on Rewriting Techniques for Program Transformations and Evaluation},
pages = {63--74},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-70-5},
ISSN = {2190-6807},
year = {2014},
volume = {40},
editor = {Schmidt-Schau{\ss}, Manfred and Sakai, Masahiko and Sabel, David and Chiba, Yuki},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.WPTE.2014.63},
URN = {urn:nbn:de:0030-drops-45839},
doi = {10.4230/OASIcs.WPTE.2014.63},
annote = {Keywords: functional programming, polymorphic typing, contextual equivalence, semantics}
}