A |

algebraic number | Lebesgue Constants and Optimal Node Systems via Symbolic Computations |

automated verification | Automated Verification of Equivalence on Quantum Cryptographic Protocols |

B |

BB84 | Automated Verification of Equivalence on Quantum Cryptographic Protocols |

bottom-up semantics | A Condensed Goal-Independent Fixpoint Semantics Modeling the Small-Step Behavior of Rewriting |

C |

computational model | Data Conversion Method between a Natural Number and a Binary Tree for an Inductive Proof and Its Application |

computational origami | Logical and Algebraic Views of a Knot Fold of a Regular Heptagon |

computer algebra | Computer algebra investigation of known primitive triangle-free strongly regular graphs |

D |

Debugging | Parametric Exploration of Rewriting Logic Computations |

Distributed memory architecture | A modified parallel F4 algorithm for shared and distributed memory architectures |

E |

elecronic cash protocol | Data Conversion Method between a Natural Number and a Binary Tree for an Inductive Proof and Its Application |

equitable partitions | Computer algebra investigation of known primitive triangle-free strongly regular graphs |

F |

F4 algorithm | A modified parallel F4 algorithm for shared and distributed memory architectures |

formal methods | Automated Verification of Equivalence on Quantum Cryptographic Protocols |

G |

Geometrical constraint solving | Logical and Algebraic Views of a Knot Fold of a Regular Heptagon |

Groebner basis | Lebesgue Constants and Optimal Node Systems via Symbolic Computations |

Gröbner basis | A modified parallel F4 algorithm for shared and distributed memory architectures |

I |

induction scheme | Data Conversion Method between a Natural Number and a Binary Tree for an Inductive Proof and Its Application |

invariants | Usage of Invariants for Symbolic Verification of Requirements |

K |

knot fold | Logical and Algebraic Views of a Knot Fold of a Regular Heptagon |

L |

Lebesgue constant | Lebesgue Constants and Optimal Node Systems via Symbolic Computations |

linear algebra | Generating Asymptotically Non-terminant Initial Variable Values for Linear Diagonalizable Programs. |

M |

Maude | Parametric Exploration of Rewriting Logic Computations |

MPI | A modified parallel F4 algorithm for shared and distributed memory architectures |

P |

polynomial interpolation | Lebesgue Constants and Optimal Node Systems via Symbolic Computations |

process calculi | Automated Verification of Equivalence on Quantum Cryptographic Protocols |

program animation | Parametric Exploration of Rewriting Logic Computations |

property-oriented specifications | Automatic Inference of Term Equivalence in Term Rewriting Systems |

Q |

quantifier elimination | Lebesgue Constants and Optimal Node Systems via Symbolic Computations |

quantum cryptography | Automated Verification of Equivalence on Quantum Cryptographic Protocols |

R |

Requirements Specification | Usage of Invariants for Symbolic Verification of Requirements |

resultant | Lebesgue Constants and Optimal Node Systems via Symbolic Computations |

rewriting logic | Parametric Exploration of Rewriting Logic Computations |

S |

semantics-based inference methods | Automatic Inference of Term Equivalence in Term Rewriting Systems |

Slicing | Parametric Exploration of Rewriting Logic Computations |

static analysis | Generating Asymptotically Non-terminant Initial Variable Values for Linear Diagonalizable Programs. |

stepping | Parametric Exploration of Rewriting Logic Computations |

strongly regular graphs | Computer algebra investigation of known primitive triangle-free strongly regular graphs |

symbolic verification | Usage of Invariants for Symbolic Verification of Requirements |

T |

term rewriting | A Condensed Goal-Independent Fixpoint Semantics Modeling the Small-Step Behavior of Rewriting |

Term Rewriting Systems | Automatic Inference of Term Equivalence in Term Rewriting Systems A Condensed Goal-Independent Fixpoint Semantics Modeling the Small-Step Behavior of Rewriting |

termination analysis | Generating Asymptotically Non-terminant Initial Variable Values for Linear Diagonalizable Programs. |

theorem proving | Logical and Algebraic Views of a Knot Fold of a Regular Heptagon |

theorem proving methods | Data Conversion Method between a Natural Number and a Binary Tree for an Inductive Proof and Its Application |