Nqthm

Known as: Boyer-Moore theorem prover, Boyer–Moore, Boyer–Moore theorem prover

Nqthm is a theorem prover sometimes referred to as the Boyer–Moore theorem prover. It was a precursor to ACL2.

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2013

ion levels. Rather than allow ACL2 to “simplify” instances of bitlist-append to append, we explicitly lift the needed theorems…

2009

2002

The powerlists data structure, created by Misra in the early 90s, is well suited to express recursive, data-parallel algorithms…

1998

In [10], Misra introduced the powerlist data structure, which is well suited to express recursive, data-parallel algorithms. In…

1994

This paper addresses the problem of formally verifying VlIDL descriptiotrs. More I)ri:cisc:ly, wc cheek the correctness of a VHDL…

1992

The application of formal methods to the analysis of computing systems promises to provide higher and higher levels of assurance…

1990

This note contains a brief summary of an integer library that has been created for nqthm. This discussion is far 2 from thorough…

1989

Since the beginning of time, the semantics of choice for synchronous circuits has been the finite state machine (FSM). Years of…

1988

1985

Metamathematics is a source of many interesting theorems and difficult proofs. This paper reports the results of an experiment to…