July 5-6, 2013 | Castle of Hagenberg, Austria

Site Search

Symposium Program

Friday, July 5.
09:30-10:00: Registration, opening
10:00-11:00: Invited Talk. Joel Ouaknine. Session chair: Laura Kovács
Decision Problems for Linear Recurrence Sequences
11:00-11:30: Coffee break
Session 1. Chair: Rachid Rebiha
11:30-12:00: Matan Ziv-Av and Mikhail Klin
Computer Algebra Investigation of Known Primitive Triangle-Free Strongly Regular Graphs
Slides.
12:00-12:30: Kazuko Takahashi, Shizuo Yoshimaru and Mizuki Goto
Data Conversion Method between a Natural Number and a Binary Tree for an Inductive Proof and Its Application
12:30-14:00: Lunch break
14:00-15:00: Invited Talk. Wei Li. Session chair: Tudor Jebelean
A Semantic Framework for Program Debugging
Slides.
15:00-15:30: Coffee break
Session 2. Chair: Dongming Wang
15:30-16:00: Severin Neumann
A Modified Parallel F4 Algorithm for Shared and Distributed Memory Architectures
16:00-16:30: Takahiro Kubota, Yoshihiko Kakutani, Go Kato, Yasuhito Kawano and Hideki Sakurada
Automated Verification of Equivalence on Quantum Cryptographic Protocols
16:30-17:00: Rachid Rebiha, Nadir Matringe and Arnaldo Moura
Generating Asymptotically Non-terminant Initial Variable Values for Linear Diagonalizable Programs
Slides.
17:00-17:20: Alexander Letichevsky, Alexander Godlevsky, Anton Guba, Alexander Kolchin, Oleksandr Letychevskyi and Vladimir Peschanenko
Usage of Invariants for Symbolic Verification of Requirements (Short Paper)
19:00: Conference dinner

Saturday, July 6.
09:00-10:00: Invited Talk. Bruno Buchberger. Session chair: Temur Kutsia
Mathematics of 21st Century: A Personal View.
Slides. Demo in the Mathematica notebook format. PDF version of the demo.
10:00-10:30: Coffee break
Session 3. Chair: Kazuko Takahashi
10:30-11:00: Fadoua Ghourabi, Tetsuo Ida and Kazuko Takahashi
Logical and Algebraic Views of a Knot Fold of a Regular Heptagon
11:00-11:20: Robert Vajda
Lebesgue Constants and Optimal Node Systems via Symbolic Computations (Short Paper)
11:30-13:00: Lunch break
Session 4. Chair: Tetsuo Ida
13:00-13:30: Marco Comini and Luca Torella
Automatic Inference of Term Equivalence in Term Rewriting Systems
13:30-14:00: María Alpuente, Demis Ballis, Francisco Frechina and Julia Sapina
Parametric Exploration of Rewriting Logic Computations
Slides.
14:00-14:30: Marco Comini and Luca Torella
A Condensed Goal-Independent Fixpoint Semantics Modeling the Small-Step Behavior of Rewriting
14:30-15:00: Closing and coffee break
15:00-16:00: SCSS Steering Committee discussion