Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 236,833,793 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. 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
2002
2002
A Mechanized Theory for Microprocessor Correctness Statements
N. Day
,
M. Aagaard
,
Meng Lou
2002
Corpus ID: 6284705
Microprocessor verification has become increasingly challenging with the use of optimizations such as out-of-order execution…
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
Supporting organization and use of problem-solving methods libraries by a formal approach
C. Golbreich
Int. J. Hum. Comput. Stud.
1998
Corpus ID: 5166509
Different libraries of problem-solving methods have been described in the past few years. But they have mostly been defined at an…
Expand
1997
1997
Evaluation of a semi-automated theorem prover
H. Lowe
1997
Corpus ID: 18872656
So little evaluation has been carried out on user interfaces to theorem provers that even the question of what should be…
Expand
1996
1996
USING WEAKEST PRECONDITIONS TO EVALUATE CRYPTOGRAPHIC PROTOCOLS
Alec Yasinsac
,
W. Wulf
1996
Corpus ID: 59804145
Because Cryptographic Protocols (CPs) are similar to computer programs, techniques for program verification are applicable to…
Expand
1996
1996
Real-Time Systems Symposium : Work in Progress
Sessions Archer
1996
Corpus ID: 21104838
A real time implementation for allocating slack to aperiodic processes in MetaH is nearing comple tion The slack scheduling…
Expand
1995
1995
Termination Analysis for Functional Programs Using Term Orderings ?
J. Urgen Giesl
1995
Corpus ID: 14741789
To prove the termination of a functional program there has to be a well-founded ordering such that the arguments in each…
Expand
1993
1993
A method of program refinement
J. Grundy
1993
Corpus ID: 43507727