Accepted Papers

  • [Paper#4] Well-Behaved (Co)algebraic Semantics of Regular Expressions in Dafny (Stefan Zetzsche and Wojciech Różowski)
  • [Paper#7] Maximizing Weighted Dominance in the Plane (Waseem Akram and Sanjeev Saxena)
  • [Paper#10] Reversibility in Process Calculi with Nondeterminism and Probabilities (Marco Bernardo and Claudio Antares Mezzina)
  • [Paper#17] Winning Strategy Templates for Stochastic Parity Games towards Permissive and Resilient Control (Kittiphon Phalakarn, Sasinee Pruekprasert and Ichiro Hasuo)
  • [Paper#18] A Theory of Proc-Omata — and a Proof Technique for Parameterized Process Architectures (Benoît Ballenghien and Burkhart Wolff)
  • [Paper#19] Disconnection Rules are Complete for Chemical Reactions (Leo Lobski, Fabio Zanasi and Ella Gale)
  • [Paper#22] Generalized Parikh Matrices For Tracking Subsequence Occurrences (Szilárd Zsolt Fazekas and Xinhao Huang)
  • [Paper#23] Verifying Type Safety for Isabelle/Solidity (Billy Thornton and Diego Marmsoler)
  • [Paper#24] Formal Foundations for Efficient Simulation of MOM Systems: The Refinement Calculus for Object-Oriented Event-Graphs (Sini Chen, Huibiao Zhu, Ran Li, Lili Xiao, Jiapeng Wang, Ning Ge and Xinbin Cao)
  • [Paper#25] Card-Based Protocols with Single-Card Encoding (Kazumasa Shinagawa)
  • [Paper#26] Verification with Common Knowledge of Rationality for Graph Games (Rindo Nakanishi, Yoshiaki Takata and Hiroyuki Seki)
  • [Paper#27] Jump Complexity of Deterministic Finite Automata with Translucent Letters (Szilárd Zsolt Fazekas, Victor Mitrana, Andrei Păun and Mihaela Păun)
  • [Paper#28] Learning Closed Signal Flow Graphs (Ekaterina Piotrovskaya, Leo Lobski and Fabio Zanasi)
  • [Paper#29] History-Based Reasoning about Behavioral Subtyping (Jinting Bian, Hans-Dieterh Hiep and Frank de Boer)
  • [Paper#31] Dual Adjunction Between Ω-Automata and Wilke Algebra Quotients (Anton Chernev, Helle Hvid Hansen and Clemens Kupke)
  • [Paper#34] On Concurrent Program Algebra and Demonic Automata (Emil Sekerinski)
  • [Paper#35] Switched Systems in Coq for Modeling Periodic Controllers (Andrei Aleksandrov and Kim Völlinger)
  • [Paper#39] Bisimulations and Logics for Higher-Dimensional Automata (Safa Zouari, Uli Fahrenberg and Krzysztof Ziemianski)
  • [Paper#41] Automated proof of Ramsey theorem via symbolic computation (Zhenbing Zeng, Jian Lu and Liangyu Chen)
  • [Paper#46] Runtime Enforcement with Event Reordering (Ankit Pradhan, C G Mitun Akil and Srinivas Pinisetty)