Lukina, A., Schilling, C., &; Henzinger, T. A. (2021). Into the unknown: active monitoring of neural networks. In 21st International Conference on Runtime Verification (Vol. 12974, pp. 42–61). Cham: Springer Nature.https://doi.org/10.1007/978-3-030-88494-9_3 

Hasani, R., Lechner, M., Amini, A., Rus, D., &; Grosu, R. (2020). A natural lottery ticket winner: Reinforcement learning with ordinary neural circuits. In Proceedings of the 37th International Conference on Machine Learning (pp. 4082–4093). Virtual.

Ferrere, T., Henzinger, T. A., &; Kragl, B. (2020). Monitoring event frequencies. In 28th EACSL Annual Conference on Computer Science Logic (Vol. 152). Barcelona, Spain: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.CSL.2020.20 

Althoff, M., Bak, S., Bao, Z., Forets, M., Frehse, G., Freire, D.,https://doi.org/10.29007/7dt2__Wetzlinger, M. (2020). ARCH-COM Category Report: Continuous and hybrid systems with linear dynamics. In EPiC Series in Computing (Vol. 74, pp. 16–48). EasyChair.https://doi.org/10.29007/7dt2 

Geretti, L., Alexandre Dit Sandretto, J., Althoff, M., Benet, L., Chapoutot, A., Chen, X.,https://doi.org/10.29007/zkf6__Schilling, C. (2020). ARCH-COM Category Report: Continuous and hybrid systems with nonlinear dynamics. In EPiC Series in Computing (Vol. 74, pp. 49–75). EasyChair.https://doi.org/10.29007/zkf6 

Chatterjee, K., Henzinger, T. A., &; Otop, J. (2020). Multi-dimensional long-run average problems for vector addition systems with states. In 31st International Conference on Concurrency Theory (Vol. 171). Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.CONCUR.2020.23 

Avni, G., &; Henzinger, T. A. (2020). A survey of bidding games on graphs. In 31st International Conference on Concurrency Theory (Vol. 171). Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.CONCUR.2020.2 

Alamdari, P. A., Avni, G., Henzinger, T. A., &; Lukina, A. (2020). Formal methods with a touch of magic. In Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design (pp. 138–147). Online Conference: TU Wien Academic Press.https://doi.org/10.34727/2020/isbn.978-3-85448-042-6_21 

Singh, S. P., &; Alistarh, D.-A. (2020). WoodFisher: Efficient second-order approximation for neural network compression. In Advances in Neural Information Processing Systems (Vol. 33, pp. 18098–18109). Vancouver, Canada: Curran Associates.

Gruenbacher, S., Cyranka, J., Lechner, M., Islam, M. A., Smolka, S. A., &; Grosu, R. (2020). Lagrangian reachtubes: The next generation. In Proceedings of the 59th IEEE Conference on Decision and Control (Vol. 2020, pp. 1556–1563). Jeju Islang, Korea (South): IEEE.https://doi.org/10.1109/CDC42340.2020.9304042 

Lechner, M. (2020). Learning representations for binary-classification without backpropagation. In 8th International Conference on Learning Representations. Virtualf; Addis Ababa, Ethiopia: ICLR.

Giacobbe, M., Henzinger, T. A., &; Lechner, M. (2020). How many bits does it take to quantize your neural network? In International Conference on Tools and Algorithms for the Construction and Analysis of Systems (Vol. 12079, pp. 79–97). Dublin, Ireland: Springer Nature.https://doi.org/10.1007/978-3-030-45237-7_5 

Avni, G., Henzinger, T. A., &; Kupferman, O. (2020). Dynamic resource allocation games. Theoretical Computer Science. Elsevier.https://doi.org/10.1016/j.tcs.2019.06.031 

Henzinger, T. A., Lukina, A., &; Schilling, C. (2020). Outside the box: Abstraction-based monitoring of neural networks. In 24th European Conference on Artificial Intelligence (Vol. 325, pp. 2433–2440). Santiago de Compostela, Spain: IOS Press.https://doi.org/10.3233/FAIA200375 

Baranowski, M., He, S., Lechner, M., Nguyen, T. S., &; Rakamari, Z. (2020). An SMT theory of fixed-point arithmetic. In Automated Reasoning (Vol. 12166, pp. 13–31). Paris, France: Springer Nature.https://doi.org/10.1007/978-3-030-51074-9_2 

Lechner, M., Hasani, R., Amini, A., Henzinger, T. A., Rus, D., &; Grosu, R. (2020). Neural circuit policies enabling auditable autonomy. Nature Machine Intelligence. Springer Nature.https://doi.org/10.1038/s42256-020-00237-3 

Lechner, M., Hasani, R., Rus, D., &; Grosu, R. (2020). Gershgorin loss stabilizes the recurrent neural network compartment of an end-to-end robot learning scheme. In Proceedings - IEEE International Conference on Robotics and Automation (pp. 5446–5452). Paris, France: IEEE.https://doi.org/10.1109/ICRA40945.2020.9196608 

Forets, M., Freire, D., &; Schilling, C. (2020). Efficient reachability analysis of parametric linear hybrid systems with  time-triggered transitions. In 18th ACM-IEEE International Conference on Formal Methods and Models for System Design. Virtual Conference: IEEE.https://doi.org/10.1109/MEMOCODE51338.2020.9314994 

Bogomolov, S., Forets, M., Frehse, G., Potomkin, K., &; Schilling, C. (2020). Reachability analysis of linear hybrid systems via block decomposition. In Proceedings of the International Conference on Embedded Software. Virtual .

Bogomolov, S., Forets, M., Frehse, G., Potomkin, K., &; Schilling, C. (2020). Reachability analysis of linear hybrid systems via block decomposition. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. IEEE.https://doi.org/10.1109/TCAD.2020.3012859