| Reachability is NP-complete even for the simplest neural networks M Sälzer, M Lange Reachability Problems: 15th International Conference, RP 2021, Liverpool, UK …, 2021 | 17 | 2021 |
| Fundamental Limits in Formal Verification of Message-Passing Neural Networks M Sälzer, M Lange International Conference on Learning Representations (ICLR), 2023 | 7 | 2023 |
| Verifying and interpreting neural networks using finite automata M Sälzer, E Alsmann, F Bruse, M Lange arXiv preprint arXiv:2211.01022, 2022 | 2 | 2022 |
| Local higher-order fixpoint iteration F Bruse, J Kreiker, M Lange, M Sälzer Information and Computation 289, 104963, 2022 | 2 | 2022 |
| Reachability in Simple Neural Networks M Sälzer, M Lange Fundamenta Informaticae 189 (3-4), 241-259, 2022 | 1 | 2022 |
| Towards Learning From Graph Representable Formal Models. M Sälzer, G Siebert OVERLAY@ GandALF, 67-71, 2021 | 1 | 2021 |
| A Logic for Reasoning About Aggregate-Combine Graph Neural Networks P Nunn, M Sälzer, F Schwarzentruber, N Troquard arXiv preprint arXiv:2405.00205, 2024 | | 2024 |
| On Challenges and Opportunities in the Translation of Deep Neural Networks into Finite Automata M Sälzer, E Alsmann, M Lange | | 2023 |
| Time-Aware Robustness of Temporal Graph Neural Networks for Link Prediction M Sälzer, S Beddar-Wiesing 30th International Symposium on Temporal Representation and Reasoning (TIME …, 2023 | | 2023 |
| Finite Convergence of μ-Calculus Fixpoints on Genuinely Infinite Structures F Bruse, M Sälzer, M Lange 46th International Symposium on Mathematical Foundations of Computer Science …, 2021 | | 2021 |
| Complexity and Decidability Results for Verification of Deep Learning Models M Sälzer, M Lange LiVe 2022 6th Workshop on Learning in Verification, 0 | | |
Martin LangeProfessor of Computer Science, University of KasselBestätigte E-Mail-Adresse bei uni-kassel.de
