Searching for "Interactive Proof Checking." – sorted by Relevance.
-
Interactive and probabilistic proof-checking
- Interactive and Probabilistic Proof-Checking Luca Trevisan # January 18, 2000 Abstract
- Add To MetaCart
-
Third-Order Matching in the Presence of Type Constructors
- there are various ways to use type theory for proof checking, they all exploit the fact that type theory provides a
- Cited by 3 (1 self) – Add To MetaCart
-
An Algorithm for Type-Checking Dependent Types
- to the problem of (interactive) proof-checking. Instead of introducing, like in LCF [10], an abstract data type
- Cited by 29 (0 self) – Add To MetaCart
-
The complexity of decision versus search
- to interactive proofs and program checking. Under similar assumptions we present languages in NP for which
- Cited by 28 (1 self) – Add To MetaCart
-
Formal verification for fault-tolerant architectures: Prolegomena to the design of PVS
- -checker is not interactive; it is guided by proof descriptions prepared by the user and included as part of the specification
- Cited by 284 (40 self) – Add To MetaCart
-
Theorem Proving for Verification
- -guided theorem proving (i.e., interactive proof checking) can, in principle, verify any correct design, but doing
- Cited by 7 (0 self) – Add To MetaCart
-
Proof Planning: A Practical Approach To Mechanized Reasoning In Mathematics
- et al., 1994), p.210 Interactive proof checking and proof development systems have been built
- Cited by 5 (2 self) – Add To MetaCart
-
An integration of mechanised reasoning and computer algebra that respects explicit proofs
- logic is in a class that is generally considered intractable). Interactive proof checking and proof
- Cited by 2 (1 self) – Add To MetaCart
-
An Integration of Mechanised Reasoning Computer Algebra that Respects Explicit Proofs
- that is generally considered intractable). Interactive proof checking and proof development systems have been built
- Add To MetaCart
-
Automating Type Soundness Proofs via Decision Procedures and Guided Reductions
- interactive proof checking. Techniques where no human interaction is required are just called decision
- Cited by 2 (0 self) – Add To MetaCart

