Author of the publication

Fundamental Limits in Formal Verification of Message-Passing Neural Networks.

, and . ICLR, OpenReview.net, (2023)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Local higher-order fixpoint iteration., , , and . Inf. Comput., 289 (Part): 104963 (2022)Local Higher-Order Fixpoint Iteration., , , and . GandALF, volume 326 of EPTCS, page 97-113. (2020)Fundamental Limits in Formal Verification of Message-Passing Neural Networks., and . ICLR, OpenReview.net, (2023)Time-aware Robustness of Temporal Graph Neural Networks for Link Prediction, and . International Symposium on Temporal Representation and Reasoning (TIME), page 19:1--19:3. (2023)Finite Convergence of μ-Calculus Fixpoints on Genuinely Infinite Structures., , and . MFCS, volume 202 of LIPIcs, page 24:1-24:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Reachability In Simple Neural Networks., and . CoRR, (2022)Verifying And Interpreting Neural Networks using Finite Automata., , , and . CoRR, (2022)Time-Aware Robustness of Temporal Graph Neural Networks for Link Prediction (Extended Abstract)., and . TIME, volume 278 of LIPIcs, page 19:1-19:3. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Reachability is NP-Complete Even for the Simplest Neural Networks., and . RP, volume 13035 of Lecture Notes in Computer Science, page 149-164. Springer, (2021)On Challenges and Opportunities in the Translation of Deep Neural Networks into Finite Automata., , and . OVERLAY@AI*IA, volume 3629 of CEUR Workshop Proceedings, page 7-11. CEUR-WS.org, (2023)