_id,doi,title
12171,10.1007/978-3-031-19992-9_22,"Synthesis of parametric hybrid automata from time series"
12175,10.1007/978-3-031-19135-0_5,History-deterministic timed automata are not determinizable
12302,10.1007/978-3-031-13188-2_6,FORQ-based language inclusion formal testing
12508,10.4230/LIPIcs.CONCUR.2022.14,History-deterministic timed automata
12509,10.4230/LIPIcs.MFCS.2022.3,An updated survey of bidding games on graphs
12510,10.1609/aaai.v36i6.20631,GoTube: Scalable statistical verification of continuous-depth models
12511,10.1609/aaai.v36i7.20695,Stability verification in stochastic control systems via neural network supermartingales
10665,,Scalable verification of quantized neural networks
10666,10.1109/ICRA48506.2021.9561036,Adversarial training is not ready for robot learning
10667,10.48550/arXiv.2111.03165,Infinite time horizon safety of Bayesian neural networks
10668,,On-off center-surround receptive fields for accurate and robust image classification
10669,,On the verification of neural ODEs with stochastic guarantees
10670,,Causal navigation by continuous-time neural networks
10671,,Liquid time-constant networks
10674,10.23638/LMCS-17(1:10)2021,Determinacy in discrete-bidding infinite-duration games
10688,10.34727/2021/isbn.978-3-85448-046-4_23,The Civl verifier
8912,10.1016/j.eswa.2020.114203,Boosting expensive synchronizing heuristics
9200,10.1145/3447928.3456704,Synthesis of hybrid automata with affine dynamics from time-series data
9239,10.1016/j.jcss.2021.02.008,Bidding mechanisms in graph games
9281,10.48550/arXiv.2103.11389,Formal verification of Zagier's one-sentence proof