WPTE 2014 VSL PROCEEDINGS: AUTHOR INDEX

Papers Papers with Abstracts Preface Author Index Keyword Index Additional files

Shortcuts: C G K L M N S Y

C
Chiba, Yuki	Verifying the Correctness of Tupling Transformations based on Conditional Rewriting (PDF, talk)
G
Gill, Andrew	HERMIT: An Equational Reasoning Model to Implementation Rewrite System for Haskell (PDF, talk)
Gmeiner, Karl	On Proving Soundness of the Computationally Equivalent Transformation for Normal Conditional Term Rewriting Systems by Using Unravelings (PDF, talk) Notes on Structure-Preserving Transformations of Conditional Term Rewrite Systems (PDF, talk)
Gunter, Elsa	Verifying Optimizations for Concurrent Programs (PDF, talk)
K
Kato, Tomofumi	Inverse Unfold Problem and Its Heuristic Solving (PDF, talk)
L
Lhoussaine, Cedric	Attractor Equivalence: An Observational Semantics for Reaction Networks (PDF, talk)
M
Madelaine, Guillaume	Attractor Equivalence: An Observational Semantics for Reaction Networks (PDF, talk)
Mansky, William	Verifying Optimizations for Concurrent Programs (PDF, talk)
Moser, Georg	A Complexity Preserving Transformation from Jinja Bytecode to Rewrite Systems (PDF, talk)
N
Nagashima, Masanori	Inverse Unfold Problem and Its Heuristic Solving (PDF, talk)
Niehren, Joachim	Attractor Equivalence: An Observational Semantics for Reaction Networks (PDF, talk)
Nishida, Naoki	Inverse Unfold Problem and Its Heuristic Solving (PDF, talk) On Proving Soundness of the Computationally Equivalent Transformation for Normal Conditional Term Rewriting Systems by Using Unravelings (PDF, talk) Notes on Structure-Preserving Transformations of Conditional Term Rewrite Systems (PDF, talk)
S
Sabel, David	Structural Rewriting in the Pi-Calculus (PDF, talk) Contextual Equivalences in Call-by-Need and Call-By-Name Polymorphically Typed Calculi (Preliminary Report) (PDF, talk)
Sakai, Masahiko	Inverse Unfold Problem and Its Heuristic Solving (PDF, talk)
Schaper, Michael	A Complexity Preserving Transformation from Jinja Bytecode to Rewrite Systems (PDF, talk)
Schmidt-Schauss, Manfred	Contextual Equivalences in Call-by-Need and Call-By-Name Polymorphically Typed Calculi (Preliminary Report) (PDF, talk)
Y
Yanagisawa, Makishi	On Proving Soundness of the Computationally Equivalent Transformation for Normal Conditional Term Rewriting Systems by Using Unravelings (PDF, talk)