ETAPS 2019
Sat 6 - Thu 11 April 2019 Prague, Czech Republic
Mon 8 Apr 2019 15:00 - 15:30 at SUN I - Verification and Analysis Chair(s): Dirk Beyer

Coupled similarity is a notion of equivalence for systems with internal actions. It has outstanding applications in contexts where internal choices must transparently be distributed in time or space, for example, in process calculi encodings or in action refinements. No tractable algorithms for the computation of coupled similarity have been proposed up to now. Accordingly, there has not been any tool support. We present a game-theoretic algorithm to compute coupled similarity, running in cubic time and space with respect to the number of states in the input transition system. We show that one cannot hope for much better because deciding the coupled simulation preorder is at least as hard as deciding the weak simulation preorder. Our results are backed by an Isabelle/HOL formalization, as well as by a parallelized implementation using the Apache Flink framework.

Mon 8 Apr

tacas-2019-papers
14:00 - 16:00: TACAS 2019 - Verification and Analysis at SUN I
Chair(s): Dirk BeyerLMU Munich
tacas-2019-papers14:00 - 14:30
Talk
Junkil ParkUniversity of Pennsylvania, Miroslav PajicDuke University, Oleg SokolskyUniversity of Pennsylvania, USA, Insup Lee
Link to publication
tacas-2019-papers14:30 - 15:00
Talk
Maria ChristakisMPI-SWS, Matthias HeizmannUniversity of Freiburg, Muhammad Numair MansurMax Planck Institute for Software Systems (MPI-SWS), Christian SchillingIST Austria, Valentin WüstholzConsenSys Diligence
Link to publication
tacas-2019-papers15:00 - 15:30
Talk
Benjamin BispingTechnische Universität Berlin, Uwe Nestmann
Link to publication
tacas-2019-papers15:30 - 16:00
Talk
Christian SternagelUniversity of Innsbruck, Austria, Akihisa Yamada
Link to publication