Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
3,767
Proof verification and hardness of approximation problems
- IN PROC. 33RD ANN. IEEE SYMP. ON FOUND. OF COMP. SCI
, 1992
"... We show that every language in NP has a probablistic verifier that checks membership proofs for it using logarithmic number of random bits and by examining a constant number of bits in the proof. If a string is in the language, then there exists a proof such that the verifier accepts with probabilit ..."
Abstract
-
Cited by 797 (39 self)
- Add to MetaCart
We show that every language in NP has a probablistic verifier that checks membership proofs for it using logarithmic number of random bits and by examining a constant number of bits in the proof. If a string is in the language, then there exists a proof such that the verifier accepts
Proof verification
, 2009
"... David Stanovsk´y (Prague) Automated theorem proving in algebra 1 / 18Automated reasoning Automated theorem proving INPUT: a finite set of first order formulas ..."
Abstract
- Add to MetaCart
David Stanovsk´y (Prague) Automated theorem proving in algebra 1 / 18Automated reasoning Automated theorem proving INPUT: a finite set of first order formulas
PVS: A Prototype Verification System
- CADE
, 1992
"... PVS is a prototype system for writing specifications and constructing proofs. Its development has been shaped by our experiences studying or using several other systems and performing a number of rather substantial formal verifications (e.g., [5,6,8]). PVS is fully implemented and freely available. ..."
Abstract
-
Cited by 655 (16 self)
- Add to MetaCart
PVS is a prototype system for writing specifications and constructing proofs. Its development has been shaped by our experiences studying or using several other systems and performing a number of rather substantial formal verifications (e.g., [5,6,8]). PVS is fully implemented and freely available
Automatic verification of finite-state concurrent systems using temporal logic specifications
- ACM Transactions on Programming Languages and Systems
, 1986
"... We give an efficient procedure for verifying that a finite-state concurrent system meets a specification expressed in a (propositional, branching-time) temporal logic. Our algorithm has complexity linear in both the size of the specification and the size of the global state graph for the concurrent ..."
Abstract
-
Cited by 1388 (62 self)
- Add to MetaCart
system. We also show how this approach can be adapted to handle fairness. We argue that our technique can provide a practical alternative to manual proof construction or use of a mechanical theorem prover for verifying many finite-state concurrent systems. Experimental results show that state machines
Construction of abstract state graphs with PVS
, 1997
"... We describe in this paper a method based on abstract interpretation which, from a theoretical point of view, is similar to the splitting methods proposed in [DGG93, Dam96] but the weaker abstract transition relation we use, allows us to construct automatically abstract state graphs paying a reasonab ..."
Abstract
-
Cited by 742 (10 self)
- Add to MetaCart
. This successor m 0 can be determined exactly if for each predicate ' i it can be determined if ' i or :' i is a postcondition of m for ø . In order to do this, we use the Pvs theorem prover [SOR93] and our Pvs-interface defined in [GS96]. If the tactic used for the proof of the verification
Model Checking Programs
, 2003
"... The majority of work carried out in the formal methods community throughout the last three decades has (for good reasons) been devoted to special languages designed to make it easier to experiment with mechanized formal methods such as theorem provers, proof checkers and model checkers. In this pape ..."
Abstract
-
Cited by 592 (63 self)
- Add to MetaCart
The majority of work carried out in the formal methods community throughout the last three decades has (for good reasons) been devoted to special languages designed to make it easier to experiment with mechanized formal methods such as theorem provers, proof checkers and model checkers
System for Automated Deduction (SAD): A Tool for Proof Verification
- Proceedings of the 21st International Conference on Automated Deduction, number 4603 in Lecture Notes in Artificial Intelligence
, 2007
"... Abstract. In this paper, a proof assistant, called SAD, is presented. SAD deals with mathematical texts that are formalized in the ForTheL language (brief description of which is also given) and checks their correctness. We give a short description of SAD and a series of examples that show what can ..."
Abstract
-
Cited by 7 (3 self)
- Add to MetaCart
Abstract. In this paper, a proof assistant, called SAD, is presented. SAD deals with mathematical texts that are formalized in the ForTheL language (brief description of which is also given) and checks their correctness. We give a short description of SAD and a series of examples that show what can
8/15/2003 AUTOMATION OF EQUATIONAL PROOF VERIFICATION USING HASKELL
"... Mistakes in a proof are strictly intolerable, because proofs are meant to assure the correctness of a theorem. Many proofs are still derived by humans today; consequently, they are error-prone. In order to minimize human errors, many rigorous proof styles have been developed, and equational logic is ..."
Abstract
- Add to MetaCart
Mistakes in a proof are strictly intolerable, because proofs are meant to assure the correctness of a theorem. Many proofs are still derived by humans today; consequently, they are error-prone. In order to minimize human errors, many rigorous proof styles have been developed, and equational logic
The synchronous approach to reactive and real-time systems
- Proceedings of the IEEE
, 1991
"... This special issue is devoted to the synchronous approach to reactive and real-time programming. This introductory paper presents and discusses the application fields and the principles of synchronous programming. The major concern of the synchronous approach is to base synchronous programming langu ..."
Abstract
-
Cited by 436 (15 self)
- Add to MetaCart
languages on math-ematical models. This makes it possible to handle compilation, logical correctness proofs, and verifications of real-time programs in a formal way, leading to a clean and precise methodology for design and programming. 1. INTRODUCTION: REAL-TIME AND REACTIVE SYSTEMS It is commonly accepted
Non-Deterministic Exponential Time has Two-Prover Interactive Protocols
"... We determine the exact power of two-prover inter-active proof systems introduced by Ben-Or, Goldwasser, Kilian, and Wigderson (1988). In this system, two all-powerful non-communicating provers convince a randomizing polynomial time verifier in polynomial time that the input z belongs to the language ..."
Abstract
-
Cited by 416 (37 self)
- Add to MetaCart
verification scheme for multilinearity of an n-variable function held by an oracle and can be viewed as an independent result on program verification. Its proof rests on combinatorial techniques including the estimation of the expansion rate of a graph.
Results 1 - 10
of
3,767
