Matt Kaufmann

Affiliations:
  • University of Texas at Austin, USA


According to our database1, Matt Kaufmann authored at least 69 papers between 1979 and 2023.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Advances in ACL2 Proof Debugging Tools.
Proceedings of the 18th International Workshop on the ACL2 Theorem Prover and Its Applications, 2023

2020
Limited Second-Order Functionality in a First-Order Setting.
J. Autom. Reason., 2020

Iteration in ACL2.
Proceedings of the Sixteenth International Workshop on the ACL2 Theorem Prover and its Applications, 2020

2019
A Hierarchical Approach to Self-Timed Circuit Verification.
Proceedings of the 25th IEEE International Symposium on Asynchronous Circuits and Systems, 2019

2018
DefunT: A Tool for Automating Termination Proofs by Using the Community Books (Extended Abstract).
Proceedings of the 15th International Workshop on the ACL2 Theorem Prover and Its Applications, 2018

Iterated ultrapowers for the masses.
Arch. Math. Log., 2018

Largest initial segments pointwise fixed by automorphisms of models of set theory.
Arch. Math. Log., 2018

Data-Loop-Free Self-Timed Circuit Verification.
Proceedings of the 24th IEEE International Symposium on Asynchronous Circuits and Systems, 2018

2017
Meta-extract: Using Existing Facts in Meta-reasoning.
Proceedings of the Proceedings 14th International Workshop on the ACL2 Theorem Prover and its Applications, 2017

A Versatile, Sound Tool for Simplifying Definitions.
Proceedings of the Proceedings 14th International Workshop on the ACL2 Theorem Prover and its Applications, 2017

Efficient, Verified Checking of Propositional Proofs.
Proceedings of the Interactive Theorem Proving - 8th International Conference, 2017

Efficient Certified RAT Verification.
Proceedings of the Automated Deduction - CADE 26, 2017

Engineering a Formal, Executable x86 ISA Simulator for Software Verification.
Proceedings of the Provably Correct Systems, 2017

2015
Fourier Series Formalization in ACL2(r).
Proceedings of the Proceedings Thirteenth International Workshop on the ACL2 Theorem Prover and Its Applications, 2015

2014
Enhancements to ACL2 in Versions 6.2, 6.3, and 6.4.
Proceedings of the Proceedings Twelfth International Workshop on the ACL2 Theorem Prover and its Applications, 2014

Industrial-Strength Documentation for ACL2.
Proceedings of the Proceedings Twelfth International Workshop on the ACL2 Theorem Prover and its Applications, 2014

Rough Diamond: An Extension of Equivalence-Based Rewriting.
Proceedings of the Interactive Theorem Proving - 5th International Conference, 2014

Simulation and formal verification of x86 machine-code programs that make system calls.
Proceedings of the Formal Methods in Computer-Aided Design, 2014

2013
Abstract Stobjs and Their Application to ISA Modeling
Proceedings of the Proceedings International Workshop on the ACL2 Theorem Prover and its Applications, 2013

Enhancements to ACL2 in Versions 5.0, 6.0, and 6.1
Proceedings of the Proceedings International Workshop on the ACL2 Theorem Prover and its Applications, 2013

A Parallelized Theorem Prover for a Logic with Parallel Execution.
Proceedings of the Interactive Theorem Proving - 4th International Conference, 2013

2012
A formal model of a large memory that supports efficient execution.
Proceedings of the Formal Methods in Computer-Aided Design, 2012

2011
The Right Tools for the Job: Correctness of Cone of Influence Reduction Proved Using ACL2 and HOL4.
J. Autom. Reason., 2011

How Can I Do That with ACL2? Recent Enhancements to ACL2
Proceedings of the Proceedings 10th International Workshop on the ACL2 Theorem Prover and its Applications, 2011

Integrating Testing and Interactive Theorem Proving
Proceedings of the Proceedings 10th International Workshop on the ACL2 Theorem Prover and its Applications, 2011

A Futures Library and Parallelism Abstractions for a Functional Subset of Lisp.
Proceedings of ELS 2011 - 4th European Lisp Symposium, Hamburg, Germany, March 31, 2011

2010
ACL2 and Its Applications to Digital System Verification.
Proceedings of the Design and Verification of Microprocessor Systems for High-Assurance Applications., 2010

2009
Integrating external deduction tools with ACL2.
J. Appl. Log., 2009

2008
Efficient execution in an automated reasoning environment.
J. Funct. Program., 2008

Rewriting with Equivalence Relations in ACL2.
J. Autom. Reason., 2008

An ACL2 Tutorial.
Proceedings of the Theorem Proving in Higher Order Logics, 21st International Conference, 2008

2007
Proof Pearl: Wellfounded Induction on the Ordinals Up to <i>epsilon</i> <sub>0</sub>.
Proceedings of the Theorem Proving in Higher Order Logics, 20th International Conference, 2007

2006
An Integration of HOL and ACL2.
Proceedings of the Formal Methods in Computer-Aided Design, 6th International Conference, 2006

Double rewriting for equivalential reasoning in ACL2.
Proceedings of the Sixth International Workshop on the ACL2 Theorem Prover and its Applications, 2006

An embedding of the ACL2 logic in HOL.
Proceedings of the Sixth International Workshop on the ACL2 Theorem Prover and its Applications, 2006

2005
Meta Reasoning in ACL2.
Proceedings of the Theorem Proving in Higher Order Logics, 18th International Conference, 2005

2001
Structured Theory Development for a Mechanized Logic.
J. Autom. Reason., 2001

Nonstandard Analysis in ACL2.
J. Autom. Reason., 2001

2000
Verification of Year 2000 conversion rules using the ACL2 theorem prover.
Int. J. Softw. Tools Technol. Transf., 2000

1998
A Mechanically Checked Proof of the AMD5<sub>K</sub>86<sup>TM</sup> Floating Point Division Program.
IEEE Trans. Computers, 1998

Design Constraints in Symbolic Model Checking.
Proceedings of the Computer Aided Verification, 10th International Conference, 1998

ACL2 Support for Verification Projects (Invited Talk).
Proceedings of the Automated Deduction, 1998

1997
An Industrial Strength Theorem Prover for a Logic Based on Common Lisp.
IEEE Trans. Software Eng., 1997

Intertwined Development and Formal Verification of a 60x Bus Model.
Proceedings of the Proceedings 1997 International Conference on Computer Design: VLSI in Computers & Processors, 1997

Formal Verification of FIRE: A Case Study.
Proceedings of the 34st Conference on Design Automation, 1997

1996
Interaction with the Boyer-Moore Theorem Prover: A Tutorial Study Using the Arithmetic-Geometric Mean Theorem.
J. Autom. Reason., 1996

Commercial Design Verification: Methodology and Tools.
Proceedings of the Proceedings IEEE International Test Conference 1996, 1996

ACL2 Theorems About Commercial Microprocessors.
Proceedings of the Formal Methods in Computer-Aided Design, First International Conference, 1996

1992
An Extension of the Boyer-Moore Theorem Prover to Support First-Order Quantification.
J. Autom. Reason., 1992

1991
Generalization in the Presence of Free Variables: A Mechanically-Checked Correctness Proof for one Algorithm.
J. Autom. Reason., 1991

An Informal Discussion of Issues in Mechanically-Assisted Reasoning.
Proceedings of the 1991 International Workshop on the HOL Theorem Proving System and its Applications, 1991

Functional Instantiation in First-Order Logic.
Proceedings of the Artificial and Mathematical Theory of Computation, 1991

1990
RCL: A Lisp Verification System.
Proceedings of the 10th International Conference on Automated Deduction, 1990

1988
An Interactive Enhancement to the Boyer-Moore Theorem Prover.
Proceedings of the 9th International Conference on Automated Deduction, 1988

1987
Remarks on Weak Notions of Saturation in Models of Peano Arithmetic.
J. Symb. Log., 1987

1986
The Hanf number of stationary logic.
Notre Dame J. Formal Log., 1986

1985
A prototype theorem-prover for a higher-order functional language.
ACM SIGSOFT Softw. Eng. Notes, 1985

A note on the Hanf number of second-order logic.
Notre Dame J. Formal Log., 1985

Meeting of the Association for Symbolic Logic: Notre Dame, Indiana, 1984.
J. Symb. Log., 1985

On random models of finite power and monadic logic.
Discret. Math., 1985

1984
Some remarks on equivalence in infinitary and stationary logic.
Notre Dame J. Formal Log., 1984

Definable Ultrapowers and Ultrafilters over Admissible Ordinals.
Math. Log. Q., 1984

Filter Logics on omega.
J. Symb. Log., 1984

The Strength of Nonstandard Methods in Arithmetic.
J. Symb. Log., 1984

A nonconservativity result on global choice.
Ann. Pure Appl. Log., 1984

Saturation and simple extensions of models of peano arithmetic.
Ann. Pure Appl. Log., 1984

1983
Blunt and Topless End Extensions of Models of Set Theory.
J. Symb. Log., 1983

Set Theory With a Filter Quantifier.
J. Symb. Log., 1983

1979
A New Omitting Types Theorem for L(Q).
J. Symb. Log., 1979


  Loading...