EDT | CEST | JST | Tue Aug 27 | Wed Aug 28 | Thu Aug 29 | Fri Aug 30 |
---|---|---|---|---|---|---|
20:30-1 | 2:30 | 9:30 | Opening | |||
21:00-1 | 3:00 | 10:00 | Wolfram | Gerhard | Yokoyama | |
22:00-1 | 4:00 | 11:00 | Break | |||
22:30-1 | 4:30 | 11:30 | Formal Methods I Full Papers |
Symbolic Computation II Work in Progress |
Formal Methods III Full Papers |
|
23:30-1 | 5:30 | 12:30 | Lunch (on own) | |||
1:00 | 7:00 | 14:00 | Buchberger | Lee | Sato | |
2:00 | 8:00 | 15:00 | Formal Methods II Work in Progress |
Symbolic Computation III Full Paper and Work-in-Progress |
Formal Methods IV Full Papers |
|
3:00 | 9:00 | 16:00 | Break | Excursion | Break | |
3:30 | 9:30 | 16:30 | Symbolic Computation I Work in Progress |
Symbolic Computation IV Work in Progress |
||
5:10 | 11:10 | 18:10 | Reception | Closing | ||
7:00 | 13:00 | 20:00 | Banquet |
18:10 | Reception |
9:30 | Registration and Opening |
10:00 | Invited Talk: Relating Symbolic Computation to the Foundations of Science |
11:00 | Break |
Formal Methods I (Full Papers) | |
11:30 | Formal Verification of ABCD Parameters Based Models for Transmission Lines |
12:00 | Formal Analysis of Vehicular Crash Severity using KeYmaera X |
12:30 | Lunch (on own) |
14:00 | Keynote talk: Algorithmic Intelligence |
Formal Methods II (Work in Progress) | |
15:00 | The First Order Theorem-Proving with Power Maps in Semigroups |
15:20 | Improving LLM-based Code Completion Using LR Parsing-Based Candidates |
15:40 | Software for indefinite integration |
16:00 | Break |
Symbolic Computation I (Work in Progress) | |
16:30 | Faster bivariate lexicographic Groebner bases modulo xk |
16:50 | Gr\UTF{00F6}bner basis computation via learning |
17:10 | A Stable Computation of Multivariarte Apporximate GCD Based on SVD and Lifting Technique |
17:30 | Towards Trajectory Planning of a Robot Manipulator with Computer Algebra using B\UTF{00E9}zier Curves for Obstacle Avoidance |
17:50 | Solving Estimation Problems Using Minimax Polynomials and Gr\CID{124}bner Bases |
10:00 | Sponsor Talk: What's New in Maple 2024 |
11:00 | Break |
Symbolic Computation II (Work in Progress) | |
11:30 | Some Applications of Chinese Remainder Theorem Codes with Error-Correction |
11:50 | The geometry of N-body orbits and the DFT |
12:10 | Functional Decomposition of Sparse Polynomials |
12:30 | Lunch (on own) |
14:00 | Invited Talk: From computer algebra to signal processing |
Symbolic Computation III (Full Paper and Work in Progress) | |
15:00 | Riemann Surfaces, Branch Cuts and Charisma |
15:30 | Methods for Solving the Post Correspondence Problem and Certificate Generation |
15:50 | Excursion |
20:00 | Banquet |
10:00 | Invited Talk: Operations on Parametric Ideals |
11:00 | Break |
Formal Methods III (Full Papers) | |
11:30 | A Method to Prove Japanese Theorems and Others Appeared in Wasan using Maxima |
12:00 | Foundations of Haskell’s Rewrite Rules based on Higher-Kinded Polymorphic Rewrite Systems |
12:30 | Lunch (on own) |
14:00 | Invited Talk: Proof Assistants and Foundations of Mathematics |
Formal Methods IV (Full Papers) | |
15:00 | Certification of Sorting Algorithms Using Theorema and Coq |
15:30 | Symbolic Graph Query Solving |
16:00 | Break |
Symbolic Computation IV (Work in Progress) | |
16:30 | An Optimized Path Planning of Manipulator with Spline Curves Using Real Quantifier Elimination Based on Comprehensive Gr\UTF{00F6}bner Systems |
16:50 | Reasoning about the Embedded Shape of a Qualitatively Represented Curve |
17:10 | Algebraic (non) Relations Among Polyzetas |
17:30 | Towards Trajectory Planning for a 6-Degree-of-Freedom Robot Manipulator Considering the Orientation of the End-effector Using Computer Algebra |
17:50 | An e-origami origami artwork of a big wing crane |
18:10 | Closing |