VSL 2014: VIENNA SUMMER OF LOGIC 2014

This page contains an index consisting of author-provided keywords.

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

Disclaimer | Powered by EasyChair Smart Program