SCSS 2013:Author IndexAuthor  Papers 

A  Alpuente, María  Parametric Exploration of Rewriting Logic Computations  B  Ballis, Demis  Parametric Exploration of Rewriting Logic Computations  Buchberger, Bruno  Mathematics of 21st Century: A Personal View  C  Comini, Marco  Automatic Inference of Term Equivalence in Term Rewriting Systems A Condensed GoalIndependent Fixpoint Semantics Modeling the SmallStep Behavior of Rewriting  F  Frechina, Francisco  Parametric Exploration of Rewriting Logic Computations  G  Ghourabi, Fadoua  Logical and Algebraic Views of a Knot Fold of a Regular Heptagon  Godlevsky, Alexander  Usage of Invariants for Symbolic Verification of Requirements  Goto, Mizuki  Data Conversion Method between a Natural Number and a Binary Tree for an Inductive Proof and Its Application  Guba, Anton  Usage of Invariants for Symbolic Verification of Requirements  I  Ida, Tetsuo  Logical and Algebraic Views of a Knot Fold of a Regular Heptagon  K  Kakutani, Yoshihiko  Automated Verification of Equivalence on Quantum Cryptographic Protocols  Kato, Go  Automated Verification of Equivalence on Quantum Cryptographic Protocols  Kawano, Yasuhito  Automated Verification of Equivalence on Quantum Cryptographic Protocols  Klin, Mikhail  Computer algebra investigation of known primitive trianglefree strongly regular graphs  Kolchin, Alexander  Usage of Invariants for Symbolic Verification of Requirements  Kubota, Takahiro  Automated Verification of Equivalence on Quantum Cryptographic Protocols  L  Letichevsky, Alexander  Usage of Invariants for Symbolic Verification of Requirements  Letychevskyi, Oleksandr  Usage of Invariants for Symbolic Verification of Requirements  Li, Wei  A Semantic Framework for Program Debugging  M  Matringe, Nadir  Generating Asymptotically Nonterminant Initial Variable Values for Linear Diagonalizable Programs.  Moura, Arnaldo  Generating Asymptotically Nonterminant Initial Variable Values for Linear Diagonalizable Programs.  N  Neumann, Severin  A modified parallel F4 algorithm for shared and distributed memory architectures  O  Ouaknine, Joel  Decision Problems for Linear Recurrence Sequences  P  Peschanenko, Vladimir  Usage of Invariants for Symbolic Verification of Requirements  R  Rebiha, Rachid  Generating Asymptotically Nonterminant Initial Variable Values for Linear Diagonalizable Programs.  S  Sakurada, Hideki  Automated Verification of Equivalence on Quantum Cryptographic Protocols  Sapiña, Julia  Parametric Exploration of Rewriting Logic Computations  T  Takahashi, Kazuko  Logical and Algebraic Views of a Knot Fold of a Regular Heptagon Data Conversion Method between a Natural Number and a Binary Tree for an Inductive Proof and Its Application  Torella, Luca  Automatic Inference of Term Equivalence in Term Rewriting Systems A Condensed GoalIndependent Fixpoint Semantics Modeling the SmallStep Behavior of Rewriting  V  Vajda, Robert  Lebesgue Constants and Optimal Node Systems via Symbolic Computations  Y  Yoshimaru, Shizuo  Data Conversion Method between a Natural Number and a Binary Tree for an Inductive Proof and Its Application  Z  ZivAv, Matan  Computer algebra investigation of known primitive trianglefree strongly regular graphs 

