Abstract is missing.
- Reachability Analysis of Nonlinear ODEs Using Polytopic Based Validated Runge-KuttaJulien Alexandre Dit Sandretto, Jian Wan. 1-14 [doi]
- The Satisfiability of Word Equations: Decidable and Undecidable TheoriesJoel D. Day, Vijay Ganesh, Paul He, Florin Manea, Dirk Nowotka. 15-29 [doi]
- Left-Eigenvectors Are Certificates of the Orbit ProblemSteven de Oliveira, Virgile Prevosto, Peter Habermehl, Saddek Bensalem. 30-44 [doi]
- Constrained Dynamic Tree NetworksMatthew Hague, Vincent Penelle. 45-58 [doi]
- EXPSPACE-Complete Variant of Countdown Games, and Simulation on Succinct One-Counter NetsPetr Jancar, Petr Osicka, Zdenek Sawa. 59-74 [doi]
- Revisiting MU-Puzzle. A Case Study in Finite Countermodels VerificationAlexei Lisitsa. 75-86 [doi]
- Knapsack in Hyperbolic GroupsMarkus Lohrey. 87-102 [doi]
- Generalized Tag SystemsTurlough Neary, Matthew Cook 0001. 103-116 [doi]
- Certain Query Answering on Compressed String Patterns: From Streams to HyperstreamsIovka Boneva, Joachim Niehren, Momar Sakho. 117-132 [doi]
- 1-complete ω-languagesMichal Skrzypczak. 133-145 [doi]
- Qualitative Reachability for Open Interval Markov ChainsJeremy Sproston. 146-160 [doi]