Matthew L. Daggitt

Orcid: 0000-0002-2552-3671

Affiliations:
  • The University of Western Australia, Perth, Australia


According to our database1, Matthew L. Daggitt authored at least 24 papers between 2015 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
NLP Verification: Towards a General Methodology for Certifying Robustness.
CoRR, 2024

Efficient compilation of expressive problem space specifications to neural network solvers.
CoRR, 2024

Marabou 2.0: A Versatile Formal Analyzer of Neural Networks.
CoRR, 2024

Vehicle: Bridging the Embedding Gap in the Verification of Neuro-Symbolic Programs.
CoRR, 2024

2023
ANTONIO: Towards a Systematic Method of Generating NLP Benchmarks for Verification.
CoRR, 2023

Logic of Differentiable Logics: Towards a Uniform Semantics of DL.
Proceedings of the LPAR 2023: Proceedings of 24th International Conference on Logic for Programming, 2023

Compiling Higher-Order Specifications to SMT Solvers: How to Deal with Rejection Constructively.
Proceedings of the 12th ACM SIGPLAN International Conference on Certified Programs and Proofs, 2023

2022
Dynamic asynchronous iterations.
J. Parallel Distributed Comput., 2022

AnalyZr: A Python application for zircon grain image segmentation and shape analysis.
Comput. Geosci., 2022

A new approach to SHRIMP II zircon U-Th disequilibrium dating.
Comput. Geosci., 2022

CheckINN: Wide Range Neural Network Verification in Imandra (Extended).
CoRR, 2022

Why Robust Natural Language Understanding is a Challenge.
CoRR, 2022

Vehicle: Interfacing Neural Network Verifiers with Interactive Theorem Provers.
CoRR, 2022

CheckINN: Wide Range Neural Network Verification in Imandra.
Proceedings of the PPDP 2022: 24th International Symposium on Principles and Practice of Declarative Programming, Tbilisi, Georgia, September 20, 2022

Differentiable Logics for Neural Network Training and Verification.
Proceedings of the Software Verification and Formal Methods for ML-Enabled Autonomous Systems, 2022

Neural Network Robustness as a Verification Property: A Principled Case Study.
Proceedings of the Computer Aided Verification - 34th International Conference, 2022

2021
Formally Verified Convergence of Policy-Rich DBF Routing Protocols.
CoRR, 2021

Property-driven Training: All You (N)Ever Wanted to Know About.
CoRR, 2021

Actions you can handle: dependent types for AI plans.
Proceedings of the TyDe 2021: Proceedings of the 6th ACM SIGPLAN International Workshop on Type-Driven Development, 2021

2020
A Relaxation of Üresin and Dubois' Asynchronous Fixed-Point Theory in Agda.
J. Autom. Reason., 2020

2018
Asynchronous convergence of policy-rich distributed bellman-ford routing protocols.
Proceedings of the 2018 Conference of the ACM Special Interest Group on Data Communication, 2018

An Agda Formalization of Üresin and Dubois' Asynchronous Fixed-Point Theory.
Proceedings of the Interactive Theorem Proving - 9th International Conference, 2018

Rate of Convergence of Increasing Path-Vector Routing Protocols.
Proceedings of the 2018 IEEE 26th International Conference on Network Protocols, 2018

2015
Tracking Urban Activity Growth Globally with Big Location Data.
CoRR, 2015


  Loading...