Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,206,877 papers from all fields of science
Search
Sign In
Create Free Account
Theorem Proving System
Known as:
TPS
, TPS (Theorem Proving System)
The Theorem Proving System (TPS) is an automated theorem proving system for first-order and higher-order logic. TPS has been developed at Carnegie…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
2 relations
Automated theorem proving
First-order logic
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
ProofPeer - A Cloud-based Interactive Theorem Proving System
Steven Obua
arXiv.org
2012
Corpus ID: 15735278
ProofPeer strives to be a system for cloud-based interactive theorem proving. After illustrating why such a system is needed, the…
Expand
2006
2006
Maintaining the ACL2 theorem proving system
Matt Kaufmann
,
J. S. Moore
2006
Corpus ID: 15019304
Introduction Topic of this talk: What sorts of challenges do we face in making our theorem prover useful in practice? Automated…
Expand
2000
2000
Axiomatic Semantics for Java^light in Isabelle/HOL
David von Oheimb
2000
Corpus ID: 10279930
We introduce a Hoare-style calculus for a nearly full subset of sequential Java, which we call Java. In particular, we present…
Expand
1998
1998
An ACL2 Proof of Write Invalidate Cache Coherence
J. S. Moore
International Conference on Computer Aided…
1998
Corpus ID: 6537500
As a pedagogical exercise in ACL2, we formalize and prove the correctness of a write invalidate cache scheme. In our…
Expand
1993
1993
A method of program refinement
J. Grundy
1993
Corpus ID: 43507727
1992
1992
Abstract Theories in HOL
P. Windley
International Conference on Theorem Proving in…
1992
Corpus ID: 5564680
1992
1992
Implementation and Use of Annotations in HOL
Sara Kalvala
,
M. Archer
,
K. Levitt
International Conference on Theorem Proving in…
1992
Corpus ID: 6518174
1991
1991
The MVL theorem proving system
M. Ginsberg
SGAR
1991
Corpus ID: 19052804
The MVL theorem-proving system is an implementation of theoretical work currently under way at Stanford University. Theoretical…
Expand
1991
1991
Grammar Rewriting
David A. McAllester
CADE
1991
Corpus ID: 5647599
We present a term rewriting procedure based on congruence closure that can be used with arbitrary equational theories. This…
Expand
1974
1974
A non-clausal theorem proving system
D. Wilkins
1974
Corpus ID: 63841455
There are reasons to suspect that non-clausal first-order logic expressions will provide a better base for a theorem prover than…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE