default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMatt Kaufmann
Person information
- affiliation: University of Texas at Austin, USA
- award (2005): ACM Software System Award
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c37]Matt Kaufmann, J Strother Moore:
Advances in ACL2 Proof Debugging Tools. ACL2 2023: 67-81- 2020
- [j30]Matt Kaufmann, J Strother Moore
:
Limited Second-Order Functionality in a First-Order Setting. J. Autom. Reason. 64(3): 391-422 (2020) - [c36]Matt Kaufmann, J Strother Moore:
Iteration in ACL2. ACL2 2020: 16-31
2010 – 2019
- 2019
- [c35]Cuong K. Chau, Warren A. Hunt Jr., Matt Kaufmann, Marly Roncken, Ivan E. Sutherland:
A Hierarchical Approach to Self-Timed Circuit Verification. ASYNC 2019: 105-113 - 2018
- [j29]Ali Enayat, Matt Kaufmann, Zachiri McKenzie:
Largest initial segments pointwise fixed by automorphisms of models of set theory. Arch. Math. Log. 57(1-2): 91-139 (2018) - [j28]Ali Enayat, Matt Kaufmann, Zachiri McKenzie:
Iterated ultrapowers for the masses. Arch. Math. Log. 57(5-6): 557-576 (2018) - [c34]Cuong K. Chau, Warren A. Hunt Jr., Matt Kaufmann, Marly Roncken, Ivan E. Sutherland:
Data-Loop-Free Self-Timed Circuit Verification. ASYNC 2018: 51-58 - [c33]Matt Kaufmann:
DefunT: A Tool for Automating Termination Proofs by Using the Community Books (Extended Abstract). ACL2 2018: 161-163 - [e3]Shilpi Goel, Matt Kaufmann:
Proceedings of the 15th International Workshop on the ACL2 Theorem Prover and Its Applications, Austin, Texas, USA, November 5-6, 2018. EPTCS 280, 2018 [contents] - 2017
- [c32]Luís Cruz-Filipe, Marijn J. H. Heule, Warren A. Hunt Jr., Matt Kaufmann, Peter Schneider-Kamp:
Efficient Certified RAT Verification. CADE 2017: 220-236 - [c31]Marijn Heule, Warren A. Hunt Jr., Matt Kaufmann, Nathan Wetzler:
Efficient, Verified Checking of Propositional Proofs. ITP 2017: 269-284 - [c30]Matt Kaufmann, Sol Swords:
Meta-extract: Using Existing Facts in Meta-reasoning. ACL2 2017: 47-60 - [c29]Alessandro Coglio, Matt Kaufmann, Eric Whitman Smith:
A Versatile, Sound Tool for Simplifying Definitions. ACL2 2017: 61-77 - [p2]Shilpi Goel, Warren A. Hunt Jr., Matt Kaufmann:
Engineering a Formal, Executable x86 ISA Simulator for Software Verification. Provably Correct Systems 2017: 173-209 - 2016
- [i1]Luís Cruz-Filipe, Marijn Heule, Warren A. Hunt Jr., Matt Kaufmann, Peter Schneider-Kamp:
Efficient Certified RAT Verification. CoRR abs/1612.02353 (2016) - 2015
- [c28]Cuong K. Chau, Matt Kaufmann, Warren A. Hunt Jr.:
Fourier Series Formalization in ACL2(r). ACL2 2015: 35-51 - [e2]Matt Kaufmann, David L. Rager:
Proceedings Thirteenth International Workshop on the ACL2 Theorem Prover and Its Applications, Austin, Texas, USA, 1-2 October 2015. EPTCS 192, 2015 [contents] - 2014
- [c27]Shilpi Goel, Warren A. Hunt Jr., Matt Kaufmann, Soumava Ghosh:
Simulation and formal verification of x86 machine-code programs that make system calls. FMCAD 2014: 91-98 - [c26]Matt Kaufmann, J Strother Moore:
Rough Diamond: An Extension of Equivalence-Based Rewriting. ITP 2014: 537-542 - [c25]Matt Kaufmann, J Strother Moore:
Enhancements to ACL2 in Versions 6.2, 6.3, and 6.4. ACL2 2014: 1-7 - [c24]Jared Davis, Matt Kaufmann:
Industrial-Strength Documentation for ACL2. ACL2 2014: 9-25 - 2013
- [c23]David L. Rager, Warren A. Hunt Jr., Matt Kaufmann:
A Parallelized Theorem Prover for a Logic with Parallel Execution. ITP 2013: 435-450 - [c22]Matt Kaufmann, J Strother Moore:
Enhancements to ACL2 in Versions 5.0, 6.0, and 6.1. ACL2 2013: 5-12 - [c21]Shilpi Goel, Warren A. Hunt Jr., Matt Kaufmann:
Abstract Stobjs and Their Application to ISA Modeling. ACL2 2013: 54-69 - 2012
- [c20]Warren A. Hunt Jr., Matt Kaufmann:
A formal model of a large memory that supports efficient execution. FMCAD 2012: 60-67 - 2011
- [j27]Michael J. C. Gordon, Matt Kaufmann, Sandip Ray:
The Right Tools for the Job: Correctness of Cone of Influence Reduction Proved Using ACL2 and HOL4. J. Autom. Reason. 47(1): 1-16 (2011) - [c19]David L. Rager, Warren A. Hunt Jr., Matt Kaufmann:
A Futures Library and Parallelism Abstractions for a Functional Subset of Lisp. ELS 2011: 13-16 - [c18]Harsh Raju Chamarthi, Peter C. Dillinger, Matt Kaufmann, Panagiotis Manolios:
Integrating Testing and Interactive Theorem Proving. ACL2 2011: 4-19 - [c17]Matt Kaufmann, J Strother Moore:
How Can I Do That with ACL2? Recent Enhancements to ACL2. ACL2 2011: 46-60 - 2010
- [p1]Matt Kaufmann, J Strother Moore:
ACL2 and Its Applications to Digital System Verification. Design and Verification of Microprocessor Systems for High-Assurance Applications 2010: 1-21 - [e1]Matt Kaufmann, Lawrence C. Paulson:
Interactive Theorem Proving, First International Conference, ITP 2010, Edinburgh, UK, July 11-14, 2010. Proceedings. Lecture Notes in Computer Science 6172, Springer 2010, ISBN 978-3-642-14051-8 [contents]
2000 – 2009
- 2009
- [j26]Matt Kaufmann, J Strother Moore, Sandip Ray, Erik Reeber:
Integrating external deduction tools with ACL2. J. Appl. Log. 7(1): 3-25 (2009) - 2008
- [j25]Bishop Brock, Matt Kaufmann, J Strother Moore:
Rewriting with Equivalence Relations in ACL2. J. Autom. Reason. 40(4): 293-306 (2008) - [j24]David A. Greve, Matt Kaufmann, Panagiotis Manolios, J Strother Moore, Sandip Ray, José-Luis Ruiz-Reina, Rob Sumners, Daron Vroon, Matthew Wilding:
Efficient execution in an automated reasoning environment. J. Funct. Program. 18(1): 15-46 (2008) - [c16]Matt Kaufmann, J Strother Moore:
An ACL2 Tutorial. TPHOLs 2008: 17-21 - 2007
- [c15]Matt Kaufmann, Konrad Slind:
Proof Pearl: Wellfounded Induction on the Ordinals Up to epsilon 0. TPHOLs 2007: 294-301 - 2006
- [c14]Michael J. C. Gordon, Warren A. Hunt Jr., Matt Kaufmann, James Reynolds:
An embedding of the ACL2 logic in HOL. ACL2 2006: 40-46 - [c13]Matt Kaufmann, J Strother Moore:
Double rewriting for equivalential reasoning in ACL2. ACL2 2006: 103-106 - [c12]Michael J. C. Gordon, James Reynolds, Warren A. Hunt Jr., Matt Kaufmann:
An Integration of HOL and ACL2. FMCAD 2006: 153-160 - 2005
- [c11]Warren A. Hunt Jr., Matt Kaufmann, Robert Bellarmine Krug, J Strother Moore, Eric Whitman Smith:
Meta Reasoning in ACL2. TPHOLs 2005: 163-178 - 2001
- [j23]Matt Kaufmann, J Strother Moore:
Structured Theory Development for a Mechanized Logic. J. Autom. Reason. 26(2): 161-203 (2001) - [j22]Ruben Gamboa, Matt Kaufmann:
Nonstandard Analysis in ACL2. J. Autom. Reason. 27(4): 323-351 (2001) - 2000
- [j21]Matt Kaufmann:
Verification of Year 2000 conversion rules using the ACL2 theorem prover. Int. J. Softw. Tools Technol. Transf. 3(1): 13-19 (2000)
1990 – 1999
- 1998
- [j20]J Strother Moore, Thomas W. Lynch, Matt Kaufmann:
A Mechanically Checked Proof of the AMD5K86TM Floating Point Division Program. IEEE Trans. Computers 47(9): 913-926 (1998) - [c10]Matt Kaufmann:
ACL2 Support for Verification Projects (Invited Talk). CADE 1998: 220-238 - [c9]Matt Kaufmann, Andrew Martin, Carl Pixley:
Design Constraints in Symbolic Model Checking. CAV 1998: 477-487 - 1997
- [j19]Matt Kaufmann, J Strother Moore:
An Industrial Strength Theorem Prover for a Logic Based on Common Lisp. IEEE Trans. Software Eng. 23(4): 203-213 (1997) - [c8]Jae-Young Jang, Shaz Qadeer, Matt Kaufmann, Carl Pixley:
Formal Verification of FIRE: A Case Study. DAC 1997: 173-177 - [c7]Matt Kaufmann, Carl Pixley:
Intertwined Development and Formal Verification of a 60x Bus Model. ICCD 1997: 25-30 - 1996
- [j18]Matt Kaufmann, Paolo Pecchiari:
Interaction with the Boyer-Moore Theorem Prover: A Tutorial Study Using the Arithmetic-Geometric Mean Theorem. J. Autom. Reason. 16(1-2): 181-222 (1996) - [c6]Bishop Brock, Matt Kaufmann, J Strother Moore:
ACL2 Theorems About Commercial Microprocessors. FMCAD 1996: 275-293 - [c5]Carl Pixley, Noel R. Strader, William C. Bruce, Jaehong Park, Matt Kaufmann, Kurt Shultz, Michael Burns, Jainendra Kumar, Jun Yuan, Janet Nguyen:
Commercial Design Verification: Methodology and Tools. ITC 1996: 839-848 - 1992
- [j17]Matt Kaufmann:
An Extension of the Boyer-Moore Theorem Prover to Support First-Order Quantification. J. Autom. Reason. 9(3): 355-372 (1992) - 1991
- [j16]Matt Kaufmann:
Generalization in the Presence of Free Variables: A Mechanically-Checked Correctness Proof for one Algorithm. J. Autom. Reason. 7(1): 109-158 (1991) - [c4]Robert S. Boyer, David M. Goldschlag, Matt Kaufmann, J Strother Moore:
Functional Instantiation in First-Order Logic. Artificial and Mathematical Theory of Computation 1991: 7-26 - [c3]Matt Kaufmann:
An Informal Discussion of Issues in Mechanically-Assisted Reasoning. TPHOLs 1991: 318-337 - 1990
- [c2]Matt Kaufmann:
RCL: A Lisp Verification System. CADE 1990: 659-660
1980 – 1989
- 1988
- [c1]Matt Kaufmann:
An Interactive Enhancement to the Boyer-Moore Theorem Prover. CADE 1988: 735-736 - 1987
- [j15]Matt Kaufmann, James H. Schmerl:
Remarks on Weak Notions of Saturation in Models of Peano Arithmetic. J. Symb. Log. 52(1): 129-148 (1987) - 1986
- [j14]Matt Kaufmann, Saharon Shelah:
The Hanf number of stationary logic. Notre Dame J. Formal Log. 27(1): 111-123 (1986) - 1985
- [j13]Matt Kaufmann, Saharon Shelah:
On random models of finite power and monadic logic. Discret. Math. 54(3): 285-293 (1985) - [j12]John T. Baldwin, Matt Kaufmann, Julia F. Knight:
Meeting of the Association for Symbolic Logic: Notre Dame, Indiana, 1984. J. Symb. Log. 50(1): 284-286 (1985) - [j11]Matt Kaufmann:
A note on the Hanf number of second-order logic. Notre Dame J. Formal Log. 26(4): 305-308 (1985) - [j10]Robert S. Boyer, Matt Kaufmann:
A prototype theorem-prover for a higher-order functional language. ACM SIGSOFT Softw. Eng. Notes 10(4): 72-74 (1985) - 1984
- [j9]Matt Kaufmann, James H. Schmerl:
Saturation and simple extensions of models of peano arithmetic. Ann. Pure Appl. Log. 27(2): 109-136 (1984) - [j8]Matt Kaufmann, Saharon Shelah:
A nonconservativity result on global choice. Ann. Pure Appl. Log. 27(3): 209-214 (1984) - [j7]Matt Kaufmann:
Filter Logics on omega. J. Symb. Log. 49(1): 241-256 (1984) - [j6]C. Ward Henson, Matt Kaufmann, H. Jerome Keisler:
The Strength of Nonstandard Methods in Arithmetic. J. Symb. Log. 49(4): 1039-1058 (1984) - [j5]Matt Kaufmann, Evangelos Kranakis:
Definable Ultrapowers and Ultrafilters over Admissible Ordinals. Math. Log. Q. 30(7-8): 97-118 (1984) - [j4]Matt Kaufmann:
Some remarks on equivalence in infinitary and stationary logic. Notre Dame J. Formal Log. 25(4): 383-389 (1984) - 1983
- [j3]Matt Kaufmann:
Set Theory With a Filter Quantifier. J. Symb. Log. 48(2): 263-287 (1983) - [j2]Matt Kaufmann:
Blunt and Topless End Extensions of Models of Set Theory. J. Symb. Log. 48(4): 1053-1073 (1983)
1970 – 1979
- 1979
- [j1]Matt Kaufmann:
A New Omitting Types Theorem for L(Q). J. Symb. Log. 44(4): 507-521 (1979)
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 2024-04-24 23:11 CEST 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:
