Abstract is missing.
- Mathematics of 21st Century: A Personal ViewBruno Buchberger. 1 [doi]
- A Semantic Framework for Program DebuggingWei Li 0022. 2 [doi]
- Decision Problems for Linear Recurrence SequencesJoël Ouaknine. 3 [doi]
- Parametric Exploration of Rewriting Logic ComputationsMaría Alpuente, Demis Ballis, Francisco Frechina, Julia Sapiña. 4-18 [doi]
- Automatic Inference of Term Equivalence in Term Rewriting SystemsMarco Comini, Luca Torella. 19-30 [doi]
- A Condensed Goal-Independent Fixpoint Semantics Modeling the Small-Step Behavior of RewritingMarco Comini, Luca Torella. 31-49 [doi]
- Logical and Algebraic Views of a Knot Fold of a Regular HeptagonFadoua Ghourabi, Tetsuo Ida, Kazuko Takahashi. 50-63 [doi]
- Automated Verification of Equivalence on Quantum Cryptographic ProtocolsTakahiro Kubota, Yoshihiko Kakutani, Go Kato, Yasuhito Kawano, Hideki Sakurada. 64-69 [doi]
- A modified parallel F4 algorithm for shared and distributed memory architecturesSeverin Neumann. 70-80 [doi]
- Generating Asymptotically Non-terminant Initial Variable Values for Linear Diagonalizable ProgramsRachid Rebiha, Nadir Matringe, Arnaldo Vieira Moura. 81-92 [doi]
- Data Conversion Method between a Natural Number and a Binary Tree for an Inductive Proof and Its ApplicationKazuko Takahashi, Shizuo Yoshimaru, Mizuki Goto. 93-107 [doi]
- Computer algebra investigation of known primitive triangle-free strongly regular graphsMatan Ziv-Av, Mikhail H. Klin. 108-123 [doi]
- Usage of Invariants for Symbolic Verification of RequirementsAlexander A. Letichevsky, Alexander Godlevsky, Anton Guba, Alexander Kolchin, Olexander A. Letychevskyi, Vladimir S. Peschanenko. 124 [doi]
- Lebesgue Constants and Optimal Node Systems via Symbolic ComputationsRobert Vajda. 125 [doi]