We are pleased to announce that our paper about compositional safety LTL synthesis has been accepted at VSTTE’22.

We are glad that our paper about the formal verification of Chisel programs with SVA-like assertions has been accepted at SEFM’22.

We are proud that our paper about synthesizing ranking functions for loop programs via SVM has been accepted in TCS.

We are happy that our paper about explicit bounds for linear forms in the exponentials of algebraic numbers has been accepted at ISSAC’22.

We our proud about our paper proposing a divide-and-conquer determinization algorithm for Büchi automata based on SCC decomposition has been accepted at CAV’22.

We are delighted that our paper about model checking probabilistic multiagent systems has been accepted in the JCST journal.

We are proud to have our paper about the practical robustness analysis for DNNs based on PAC-model learning appearing in ICSE’22.

We are glad that our paper about verifying pupperfish privacy in hidden Markov models has been accepted at VMCAI’22.

The SETTA paper about the polynomial-time alternating probabilistic bisimulation for interval MDPs [HashemiTHHE17] has been awarded with the SETTA’17 best paper award.