default search action
J Strother Moore
Person information
- affiliation: University of Texas at Austin, USA
- award (2005): ACM Software System Award
- award (1999): Herbrand Award
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c47]Matt Kaufmann, J Strother Moore:
Advances in ACL2 Proof Debugging Tools. ACL2 2023: 67-81 - 2022
- [c46]Warren A. Hunt Jr., Vivek Ramanathan, J Strother Moore:
VWSIM: A Circuit Simulator. ACL2 2022: 61-75 - 2020
- [j31]Matt Kaufmann, J Strother Moore
:
Limited Second-Order Functionality in a First-Order Setting. J. Autom. Reason. 64(3): 391-422 (2020) - [c45]Matt Kaufmann, J Strother Moore:
Iteration in ACL2. ACL2 2020: 16-31
2010 – 2019
- 2019
- [j30]J Strother Moore
Milestones from the Pure Lisp theorem prover to ACL2. Formal Aspects Comput. 31(6): 699-732 (2019) - 2017
- [j29]J Strother Moore, Claus-Peter Wirth:
Automation of Mathematical Induction as part of the History of Logic. FLAP 4(5) (2017) - [c44]J Strother Moore, Marijn J. H. Heule:
Industrial Use of ACL2: Applications, Achievements, Challenges, and Directions. ARCADE@CADE 2017: 42-45 - [p2]J Strother Moore:
Computing Verified Machine Address Bounds During Symbolic Exploration of Code. Provably Correct Systems 2017: 151-172 - 2015
- [c43]J Strother Moore:
Machines Reasoning About Machines: 2015. ATVA 2015: 4-13 - [c42]J Strother Moore:
Stateman: Using Metafunctions to Manage Large Terms Representing Machine States. ACL2 2015: 93-109 - 2014
- [c41]J Strother Moore:
Proof Pearl: Proving a Simple Von Neumann Machine Turing Complete. ITP 2014: 406-420 - [c40]Matt Kaufmann, J Strother Moore:
Rough Diamond: An Extension of Equivalence-Based Rewriting. ITP 2014: 537-542 - [c39]Matt Kaufmann, J Strother Moore:
Enhancements to ACL2 in Versions 6.2, 6.3, and 6.4. ACL2 2014: 1-7 - 2013
- [c38]Matt Kaufmann, J Strother Moore:
Enhancements to ACL2 in Versions 5.0, 6.0, and 6.1. ACL2 2013: 5-12 - [i2]J Strother Moore, Claus-Peter Wirth:
Automation of Mathematical Induction as part of the History of Logic. CoRR abs/1309.6226 (2013) - 2012
- [c37]J Strother Moore:
Meta-level features in an industrial-strength theorem prover. POPL 2012: 425-426 - [i1]Alan Bundy, Dieter Hutter, Cliff B. Jones
AI meets Formal Software Development (Dagstuhl Seminar 12271). Dagstuhl Reports 2(7): 1-29 (2012) - 2011
- [c36]J Strother Moore:
The role of human creativity in mechanized verification: invited talk. FMCAD 2011: 18 - [c35]J Strother Moore:
Reasoning about digital artifacts with ACL2. PLPV 2011: 1-2 - [c34]Matt Kaufmann, J Strother Moore:
How Can I Do That with ACL2? Recent Enhancements to ACL2. ACL2 2011: 46-60 - 2010
- [c33]J Strother Moore:
Theorem Proving for Verification: The Early Days. LICS 2010: 283 - [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
2000 – 2009
- 2009
- [j28]Matt Kaufmann, J Strother Moore, Sandip Ray, Erik Reeber:
Integrating external deduction tools with ACL2. J. Appl. Log. 7(1): 3-25 (2009) - 2008
- [j27]Sandip Ray, Warren A. Hunt Jr., John Matthews, J Strother Moore:
A Mechanical Analysis of Program Verification Strategies. J. Autom. Reason. 40(4): 245-269 (2008) - [j26]Bishop Brock, Matt Kaufmann, J Strother Moore:
Rewriting with Equivalence Relations in ACL2. J. Autom. Reason. 40(4): 293-306 (2008) - [j25]David A. Greve, Matt Kaufmann, Panagiotis Manolios
Efficient execution in an automated reasoning environment. J. Funct. Program. 18(1): 15-46 (2008) - [c32]Robert B. Schnabel, Duncan A. Buell
An open dialogue concerning the state of education policy in computer science. SIGCSE 2008: 114-115 - [c31]Matt Kaufmann, J Strother Moore:
An ACL2 Tutorial. TPHOLs 2008: 17-21 - 2007
- [c30]Peter C. Dillinger, Panagiotis Manolios
ACL2s: "The ACL2 Sedan". ICSE Companion 2007: 59-60 - 2006
- [j24]J Strother Moore:
Inductive assertions and operational semantics. Int. J. Softw. Tools Technol. Transf. 8(4-5): 359-371 (2006) - [c29]Matt Kaufmann, J Strother Moore:
Double rewriting for equivalential reasoning in ACL2. ACL2 2006: 103-106 - [c28]John Matthews, J Strother Moore, Sandip Ray, Daron Vroon:
Verification Condition Generation Via Theorem Proving. LPAR 2006: 362-376 - [c27]Peter C. Dillinger, Panagiotis Manolios
ACL2s: "The ACL2 Sedan". UITP@FLoC 2006: 3-18 - 2005
- [j23]Hanbing Liu, J Strother Moore:
Executable JVM model for analytical reasoning: A study. Sci. Comput. Program. 57(3): 253-274 (2005) - [c26]Warren A. Hunt Jr., Matt Kaufmann, Robert Bellarmine Krug, J Strother Moore, Eric Whitman Smith:
Meta Reasoning in ACL2. TPHOLs 2005: 163-178 - [c25]J Strother Moore, Qiang Zhang:
Proof Pearl: Dijkstra's Shortest Path Algorithm Verified with ACL2. TPHOLs 2005: 373-384 - [c24]J Strother Moore:
A Mechanized Program Verifier. VSTTE 2005: 268-276 - 2004
- [c23]Sandip Ray, J Strother Moore:
Proof Styles in Operational Semantics. FMCAD 2004: 67-81 - [c22]J Strother Moore:
On the Adoption of Formal Methods by Industry: The ACL2 Experience. ICFEM 2004: 13 - [c21]Hanbing Liu, J Strother Moore:
Java Program Verification via a JVM Deep Embedding in ACL2. TPHOLs 2004: 184-200 - 2003
- [j22]Panagiotis Manolios
Partial Functions in ACL2. J. Autom. Reason. 31(2): 107-127 (2003) - [c20]J Strother Moore:
Inductive Assertions and Operational Semantics. CHARME 2003: 289-303 - [c19]Warren A. Hunt Jr., Robert Bellarmine Krug, J Strother Moore:
Linear and Nonlinear Arithmetic in ACL2. CHARME 2003: 319-333 - [c18]Hanbing Liu, J Strother Moore:
Executable JVM model for analytical reasoning: a study. IVME 2003: 15-23 - 2002
- [j21]J Strother Moore, George Porter:
The apprentice challenge. ACM Trans. Program. Lang. Syst. 24(3): 193-216 (2002) - [c17]J Strother Moore:
Functional formal methods. ICFP 2002: 123 - [c16]Robert S. Boyer, J Strother Moore:
Single-Threaded Objects in ACL2. PADL 2002: 9-27 - [c15]J Strother Moore:
A Grand Challenge Proposal for Formal Methods: A Verified Stack. 10th Anniversary Colloquium of UNU/IIST 2002: 161-172 - 2001
- [j20]Panagiotis Manolios
On the desirability of mechanizing calculational proofs. Inf. Process. Lett. 77(2-4): 173-179 (2001) - [j19]Matt Kaufmann, J Strother Moore:
Structured Theory Development for a Mechanized Logic. J. Autom. Reason. 26(2): 161-203 (2001) - [c14]J Strother Moore:
Rewriting for Symbolic Execution of State Machine Models. CAV 2001: 411-422 - [c13]J Strother Moore, George Porter:
An Executable Formal Java Virtual Machine Thread Model. Java Virtual Machine Research and Technology Symposium 2001: 91-104 - [c12]J Strother Moore:
Finite Set Theory in ACL2. TPHOLs 2001: 313-328
1990 – 1999
- 1999
- [j18]J Strother Moore:
A Mechanically Checked Proof of a Multiprocessor Result via a Uniprocessor View. Formal Methods Syst. Des. 14(2): 213-228 (1999) - [c11]J Strother Moore:
Proving Theorems About Java-Like Byte Code. Correct System Design 1999: 139-162 - 1998
- [b4]Robert S. Boyer, J Strother Moore:
A computational logic handbook, Second Edition. Academic Press international series in formal methods, Academic Press 1998, ISBN 978-0-12-122955-9, pp. I-XXV, 1-518 - [j17]J Strother Moore, Thomas W. Lynch
A Mechanically Checked Proof of the AMD5K86TM Floating Point Division Program. IEEE Trans. Computers 47(9): 913-926 (1998) - [c10]J Strother Moore:
An ACL2 Proof of Write Invalidate Cache Coherence. CAV 1998: 29-38 - [c9]J Strother Moore:
Symbolic Simulation: An ACL2 Approach. FMCAD 1998: 334-350 - 1997
- [j16]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) - 1996
- [c8]Bishop Brock, Matt Kaufmann, J Strother Moore:
ACL2 Theorems About Commercial Microprocessors. FMCAD 1996: 275-293 - 1994
- [j15]J Strother Moore:
A Formal Model of Asynchronous Communication and its Use in Mechanically Verifying a Biphase Mark Protocol. Formal Aspects Comput. 6(1): 60-91 (1994) - [j14]J Strother Moore:
Introduction to the OBDD Algorithm for the ATP Community. J. Autom. Reason. 12(1): 33-46 (1994) - 1991
- [c7]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 - [c6]Robert S. Boyer, J Strother Moore:
MJRTY: A Fast Majority Vote Algorithm. Automated Reasoning: Essays in Honor of Woody Bledsoe 1991: 105-118 - 1990
- [c5]Robert S. Boyer, J Strother Moore:
A Theorem Prover for a Computational Logic. CADE 1990: 1-15
1980 – 1989
- 1989
- [j13]William R. Bevier, Warren A. Hunt Jr., J Strother Moore, William D. Young:
An Approach to Systems Verification. J. Autom. Reason. 5(4): 411-428 (1989) - [j12]J Strother Moore:
A Mechanically Verified Language Implementation. J. Autom. Reason. 5(4): 461-492 (1989) - 1988
- [j11]Robert S. Boyer, J Strother Moore:
The Addition of Bounded Quantification and Partial Functions to A Computational Logic and Its Theorem Prover. J. Autom. Reason. 4(2): 117-172 (1988) - 1986
- [j10]Robert S. Boyer, J Strother Moore, Warren A. Hunt, Richard M. Cohen, Richard C. Holt:
Abstracts in software engineering - reports. ACM SIGSOFT Softw. Eng. Notes 11(5): 92-94 (1986) - [c4]Robert S. Boyer, J Strother Moore:
Overview of a Theorem-Prover for A Computational Logic. CADE 1986: 675-678 - 1985
- [j9]Robert S. Boyer, J Strother Moore:
Program Verification. J. Autom. Reason. 1(1): 17-23 (1985) - [j8]Donald I. Good, Robert S. Boyer, J Strother Moore:
A second generation verification environment. ACM SIGSOFT Softw. Eng. Notes 10(4): 48 (1985) - 1984
- [j7]Robert S. Boyer, J Strother Moore:
A Mechanical Proof of the Unsolvability of the Halting Problem. J. ACM 31(3): 441-458 (1984) - 1983
- [j6]Robert S. Boyer, J Strother Moore:
Program verification prize. ACM SIGSOFT Softw. Eng. Notes 8(3): 64 (1983) - 1980
- [b3]Robert S. Boyer, J Strother Moore:
A computational logic. ACM monograph series, Academic Press 1980, ISBN 978-0-12-122950-4, pp. I-XIV, 1-397
1970 – 1979
- 1979
- [b2]Robert S. Boyer, J Strother Moore:
A computational logic handbook. Perspectives in computing 23, Academic Press 1979, ISBN 978-0-12-122952-8, pp. I-XVI, 1-408 - [j5]J Strother Moore:
A Mechanical Proof of the Termination of Takeuchi's Function. Inf. Process. Lett. 9(4): 176-181 (1979) - 1977
- [j4]Robert S. Boyer, J Strother Moore:
A Fast String Searching Algorithm. Commun. ACM 20(10): 762-772 (1977) - [c3]Robert S. Boyer, J Strother Moore:
A Lemma Driven Automatic Theorem Prover for Recursive Function Theory. IJCAI 1977: 511-519 - 1976
- [c2]Robert S. Boyer, J Strother Moore, Robert E. Shostak:
Primitive Recursive Program Transformations. POPL 1976: 171-174 - 1975
- [j3]Robert S. Boyer, J Strother Moore:
Proving Theorems about LISP Functions. J. ACM 22(1): 129-144 (1975) - [j2]J Strother Moore:
Automatic proof of correctness of a binary addition algorithm. SIGART Newsl. 52: 13-14 (1975) - [j1]J Strother Moore:
Introducing Iteration into the Pure Lisp Theorem Prover. IEEE Trans. Software Eng. 1(3): 328-338 (1975) - 1973
- [b1]J Strother Moore:
Computational logic : structure sharing and proof of program properties. University of Edinburgh, UK, 1973 - [c1]Robert S. Boyer, J Strother Moore:
Proving Theorems about LISP Functions. IJCAI 1973: 486-493
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-05-02 21:46 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: