WPTE 2014 VSL PROCEEDINGS: KEYWORD INDEX

Papers Papers with Abstracts Preface Author Index Keyword Index Additional files

Shortcuts: A C E I O P R S T U

A
Attractor	Attractor Equivalence: An Observational Semantics for Reaction Networks (PDF, talk)
C
call-by-need lambda calculus	Contextual Equivalences in Call-by-Need and Call-By-Name Polymorphically Typed Calculi (Preliminary Report) (PDF, talk)
condition elimination	On Proving Soundness of the Computationally Equivalent Transformation for Normal Conditional Term Rewriting Systems by Using Unravelings (PDF, talk)
conditional term rewriting	On Proving Soundness of the Computationally Equivalent Transformation for Normal Conditional Term Rewriting Systems by Using Unravelings (PDF, talk) Verifying the Correctness of Tupling Transformations based on Conditional Rewriting (PDF, talk) Notes on Structure-Preserving Transformations of Conditional Term Rewrite Systems (PDF, talk)
conditional term rewriting system	Inverse Unfold Problem and Its Heuristic Solving (PDF, talk)
contextual equivalence	Contextual Equivalences in Call-by-Need and Call-By-Name Polymorphically Typed Calculi (Preliminary Report) (PDF, talk)
correct program transformation	Contextual Equivalences in Call-by-Need and Call-By-Name Polymorphically Typed Calculi (Preliminary Report) (PDF, talk)
E
equivalence	Attractor Equivalence: An Observational Semantics for Reaction Networks (PDF, talk)
I
interactive theorem proving	Verifying Optimizations for Concurrent Programs (PDF, talk)
O
Observational Semantics	Attractor Equivalence: An Observational Semantics for Reaction Networks (PDF, talk)
optimizing compilers	Verifying Optimizations for Concurrent Programs (PDF, talk)
P
polymorphic typing	Contextual Equivalences in Call-by-Need and Call-By-Name Polymorphically Typed Calculi (Preliminary Report) (PDF, talk)
Process calculi	Structural Rewriting in the Pi-Calculus (PDF, talk)
program analysis	A Complexity Preserving Transformation from Jinja Bytecode to Rewrite Systems (PDF, talk)
program transformation	Inverse Unfold Problem and Its Heuristic Solving (PDF, talk) Verifying the Correctness of Tupling Transformations based on Conditional Rewriting (PDF, talk)
program transformations	Verifying Optimizations for Concurrent Programs (PDF, talk)
R
Reaction Networks	Attractor Equivalence: An Observational Semantics for Reaction Networks (PDF, talk)
relaxed memory models	Verifying Optimizations for Concurrent Programs (PDF, talk)
Rewriting	Structural Rewriting in the Pi-Calculus (PDF, talk)
Runtime Complexity	A Complexity Preserving Transformation from Jinja Bytecode to Rewrite Systems (PDF, talk)
S
semantics	Structural Rewriting in the Pi-Calculus (PDF, talk)
Structure preserving	Notes on Structure-Preserving Transformations of Conditional Term Rewrite Systems (PDF, talk)
Systems Biology	Attractor Equivalence: An Observational Semantics for Reaction Networks (PDF, talk)
T
temporal logic	Verifying Optimizations for Concurrent Programs (PDF, talk)
term rewriting	Notes on Structure-Preserving Transformations of Conditional Term Rewrite Systems (PDF, talk) A Complexity Preserving Transformation from Jinja Bytecode to Rewrite Systems (PDF, talk)
The Correctnes Of Transformations	Verifying the Correctness of Tupling Transformations based on Conditional Rewriting (PDF, talk)
Transformations	Notes on Structure-Preserving Transformations of Conditional Term Rewrite Systems (PDF, talk)
Tupling	Verifying the Correctness of Tupling Transformations based on Conditional Rewriting (PDF, talk)
U
unfolding	Inverse Unfold Problem and Its Heuristic Solving (PDF, talk)
unraveling	On Proving Soundness of the Computationally Equivalent Transformation for Normal Conditional Term Rewriting Systems by Using Unravelings (PDF, talk)
Unravelings	Notes on Structure-Preserving Transformations of Conditional Term Rewrite Systems (PDF, talk)