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…

2002

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

1999

This paper presents in detail how the Unity logic for reasoning about concurrent programs was formalized within the mechanized…

1998

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

1998

This article is concerned with interactive support for \declarative theorem proving". After introducing declarative theorem…

1997

There is a trend away from monolithic automated theorem provers towards using automation as a tool in support of interactive…

1992

We present here a proof of Ramsey's Theorem for exponent 2 using the Boyer-Moore theorem prover. The presentation is intended to…

1985

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

Review

1982

Review

1982

1 ABSTRACT A methodology for the formal specification and deductive verification of protocols is presented. Protocol modules are…

1982