_id,doi,title
8623,10.1007/978-3-030-60508-7_1,Monitorability under assumptions
8679,10.1038/s42256-020-00237-3,Neural circuit policies enabling auditable autonomy
8704,10.1109/ICRA40945.2020.9196608,Gershgorin loss stabilizes the recurrent neural network compartment of an end-to-end robot learning scheme
8750,10.1109/MEMOCODE51338.2020.9314994,Efficient reachability analysis of parametric linear hybrid systems with  time-triggered transitions
8790,10.1109/TCAD.2020.3012859,Reachability analysis of linear hybrid systems via block decomposition
6761,10.1016/j.tcs.2019.06.031,Dynamic resource allocation games
7348,10.4230/LIPIcs.CSL.2020.20,Monitoring event frequencies
7426,10.1016/j.nahs.2020.100856,Abstraction based verification of stability of polyhedral switched systems
7505,10.3233/FAIA200375,Outside the box: Abstraction-based monitoring of neural networks
9040,10.34727/2020/isbn.978-3-85448-042-6_21,Formal methods with a touch of magic
9103,10.1109/CDC42340.2020.9304042,Lagrangian reachtubes: The next generation
9197,10.1609/aaai.v34i02.5546,All-pay bidding games on graphs
9202,10.1109/RTSS49844.2020.00031,Hybridization for stability verification of nonlinear switched systems
9632,,WoodFisher: Efficient second-order approximation for neural network compression
10877,10.29007/rjwn,ARCH-COMP19 Category Report: Hybrid systems with piecewise constant dynamics
8570,10.29007/bj1w,ARCH-COMP19 Category Report: Continuous and hybrid systems with linear continuous dynamics
6752,10.1145/3340295,Infinite-duration bidding games
6822,10.1007/978-3-030-30806-3_1,Bidding games on Markov decision processes
6884,10.4230/LIPICS.MFCS.2019.11,Bidding mechanisms in graph games
6885,10.4230/LIPICS.CONCUR.2019.27,Long-run average behavior of vector addition systems with states