default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGrant Olney Passmore
Person information
- affiliation: University of Cambridge, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i10]Remi Desmartin, Omri Isac, Ekaterina Komendantskaya, Kathrin Stark, Grant O. Passmore, Guy Katz:
A Certified Proof Checker for Deep Neural Network Verification. CoRR abs/2405.10611 (2024)- 2023
- [c16]Remi Desmartin, Omri Isac, Grant O. Passmore, Kathrin Stark, Ekaterina Komendantskaya, Guy Katz:
Towards a Certified Proof Checker for Deep Neural Network Verification. LOPSTR 2023: 198-209 - [c15]John Hester, Briland Hitaj
, Grant O. Passmore, Sam Owre, Natarajan Shankar, Eric Yeh:
An Augmented MetiTarski Dataset for Real Quantifier Elimination Using Machine Learning. CICM 2023: 297-302 - [c14]Grant O. Passmore:
ACL2 Proofs of Nonlinear Inequalities with Imandra. ACL2 2023: 151-160 - [i9]John Hester, Briland Hitaj, Grant O. Passmore, Sam Owre, Natarajan Shankar, Eric Yeh:
Revisiting Variable Ordering for Real Quantifier Elimination using Machine Learning. CoRR abs/2302.14038 (2023) - [i8]Remi Desmartin, Omri Isac, Grant O. Passmore, Kathrin Stark, Guy Katz, Ekaterina Komendantskaya:
Towards a Certified Proof Checker for Deep Neural Network Verification. CoRR abs/2307.06299 (2023) - 2022
- [c13]Remi Desmartin, Grant O. Passmore, Ekaterina Komendantskaya:
Neural Networks in Imandra: Matrix Representation as a Verification Choice. NSV/FoMLAS@CAV 2022: 78-95 - [c12]Remi Desmartin, Grant O. Passmore, Ekaterina Komendantskaya, Matthew L. Daggitt:
CheckINN: Wide Range Neural Network Verification in Imandra. PPDP 2022: 3:1-3:14 - [i7]Remi Desmartin, Grant O. Passmore, Ekaterina Komendantskaya:
Neural Networks in Imandra: Matrix Representation as a Verification Choice. CoRR abs/2205.09556 (2022) - [i6]Remi Desmartin, Grant O. Passmore, Ekaterina Komendantskaya, Matthew L. Daggitt:
CheckINN: Wide Range Neural Network Verification in Imandra (Extended). CoRR abs/2207.10562 (2022) - 2021
- [c11]Grant Olney Passmore:
Some Lessons Learned in the Industrialization of Formal Methods for Financial Algorithms. FM 2021: 717-721 - 2020
- [c10]Grant O. Passmore, Simon Cruanes, Denis Ignatovich, Dave Aitken, Matt Bray, Elijah Kagan, Kostya Kanishev, Ewen Maclean, Nicola Mometto:
The Imandra Automated Reasoning System (System Description). IJCAR (2) 2020: 464-471 - [e3]Grant O. Passmore, Ruben Gamboa:
Proceedings of the Sixteenth International Workshop on the ACL2 Theorem Prover and its Applications, Worldwide, Planet Earth, May 28-29, 2020. EPTCS 327, 2020 [contents] - [i5]Grant Olney Passmore, Simon Cruanes, Denis Ignatovich, Dave Aitken, Matt Bray, Elijah Kagan, Kostya Kanishev, Ewen Maclean, Nicola Mometto:
The Imandra Automated Reasoning System (system description). CoRR abs/2004.10263 (2020)
2010 – 2019
- 2019
- [j4]Wenda Li, Grant Olney Passmore, Lawrence C. Paulson:
Deciding Univariate Polynomial Problems Using Untrusted Certificates in Isabelle/HOL. J. Autom. Reason. 62(1): 69-91 (2019) - [e2]Osman Hasan, Abdou Youssef, Adam Naumowicz, William M. Farmer, Cezary Kaliszyk, Diane Gallois-Wong, Florian Rabe, Gabriel Dos Reis, Grant O. Passmore, James H. Davenport, Markus Pfeiffer, Michael Kohlhase, Serge Autexier, Sofiène Tahar, Thomas Koprucki, Umair Siddique, Walther Neuper, Wolfgang Windsteiger, Wolfgang Schreiner, Wolfram Sperber, Zoltán Kovács:
Joint Proceedings of the CME-EI, FMM, CAAT, FVPS, M3SRD, OpenMath Workshops, Doctoral Program and Work in Progress at the Conference on Intelligent Computer Mathematics 2018 co-located with the 11th Conference on Intelligent Computer Mathematics (CICM 2018), Hagenberg, Austria, August 13-17, 2018. CEUR Workshop Proceedings 2307, CEUR-WS.org 2019 [contents] - 2018
- [c9]Kristjan Liiva, Paul B. Jackson, Grant O. Passmore, Christoph M. Wintersteiger:
Compositional Taylor Model Based Validated Integration. SYNASC 2018: 45-52 - [e1]Florian Rabe, William M. Farmer, Grant O. Passmore, Abdou Youssef:
Intelligent Computer Mathematics - 11th International Conference, CICM 2018, Hagenberg, Austria, August 13-17, 2018, Proceedings. Lecture Notes in Computer Science 11006, Springer 2018, ISBN 978-3-319-96811-7 [contents] - 2017
- [c8]Grant Olney Passmore, Denis Ignatovich:
Formal Verification of Financial Algorithms. CADE 2017: 26-41 - 2015
- [c7]Grant Olney Passmore:
Decidability of Univariate Real Algebra with Predicates for Rational and Integer Powers. CADE 2015: 181-196 - [i4]Grant Olney Passmore:
Decidability of Univariate Real Algebra with Predicates for Rational and Integer Powers. CoRR abs/1506.04863 (2015) - [i3]Wenda Li, Grant Olney Passmore, Lawrence C. Paulson:
A Complete Decision Procedure for Univariate Polynomial Problems in Isabelle/HOL. CoRR abs/1506.08238 (2015) - 2014
- [j3]Stefan Mitsch, Grant Olney Passmore, André Platzer:
Collaborative Verification-Driven Engineering of Hybrid Systems. Math. Comput. Sci. 8(1): 71-97 (2014) - [i2]Stefan Mitsch, Grant Olney Passmore, André Platzer:
Collaborative Verification-Driven Engineering of Hybrid Systems. CoRR abs/1403.6085 (2014) - 2013
- [c6]Leonardo Mendonça de Moura, Grant Olney Passmore:
The Strategy Challenge in SMT Solving. Automated Reasoning and Mathematics 2013: 15-44 - [c5]Leonardo Mendonça de Moura, Grant Olney Passmore:
Computation in Real Closed Infinitesimal and Transcendental Extensions of the Rationals. CADE 2013: 178-192 - 2012
- [j2]Yuri Gurevich, Grant Olney Passmore:
Impugning Randomness, Convincingly. Stud Logica 100(1-2): 193-222 (2012) - [c4]Grant Olney Passmore, Lawrence C. Paulson, Leonardo Mendonça de Moura:
Real Algebraic Strategies for MetiTarski Proofs. AISC/MKM/Calculemus 2012: 358-370 - [c3]Grant Olney Passmore, Paul B. Jackson:
Abstract Partial Cylindrical Algebraic Decomposition I: The Lifting Phase. CiE 2012: 560-570 - 2011
- [j1]Yuri Gurevich, Grant Olney Passmore:
Impugning Randomness, Convincingly. Bull. EATCS 104: 112-137 (2011) - 2010
- [i1]Grant Olney Passmore, Leonardo Mendonça de Moura, Paul B. Jackson:
Gröbner Basis Construction Algorithms Based on Theorem Proving Saturation Loops. Decision Procedures in Software, Hardware and Bioware 2010
2000 – 2009
- 2009
- [c2]Grant Olney Passmore, Paul B. Jackson:
Combined Decision Techniques for the Existential Theory of the Reals. Calculemus/MKM 2009: 122-137 - [c1]Grant Olney Passmore, Leonardo Mendonça de Moura:
Superfluous S-polynomials in Strategy-Independent Groebner Bases. SYNASC 2009: 45-53
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-02-07 23:52 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
