Results 1  10
of
514,374
Verification Results
"... Neural network models Simulation systems of neural networks ParkerSochacki numerical integration method CUDA GPU architecture Implementation: software architecture, computation phases ..."
Abstract
 Add to MetaCart
Neural network models Simulation systems of neural networks ParkerSochacki numerical integration method CUDA GPU architecture Implementation: software architecture, computation phases
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 822 (39 self)
 Add to MetaCart
with probability 1 (i.e., for every choice of its random string). For strings not in the language, the verifier rejects every provided “proof " with probability at least 1/2. Our result builds upon and improves a recent result of Arora and Safra [6] whose verifiers examine a nonconstant number of bits
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 654 (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
TEMPERATURE AND PRECIPITATION VERIFICATION RESULTS
, 2007
"... UNITED STATES National Oceanic and National Weather Service DEPARTMENT OF COMMERCE Atmospheric Administration David L. Johnson, Assistant ..."
Abstract
 Add to MetaCart
UNITED STATES National Oceanic and National Weather Service DEPARTMENT OF COMMERCE Atmospheric Administration David L. Johnson, Assistant
Optimal contracts and competitive markets with costly state verification
 Journal of Economic Theory
, 1979
"... The insight of Arrow [4] and Debreu [7] that uncertainty is easily incorporated into general equilibrium models is doubleedged. It is true that one need only index commodities by the state of nature, and classical results on the existence and optimality of competitive equilibria can be made to ..."
Abstract

Cited by 856 (9 self)
 Add to MetaCart
The insight of Arrow [4] and Debreu [7] that uncertainty is easily incorporated into general equilibrium models is doubleedged. It is true that one need only index commodities by the state of nature, and classical results on the existence and optimality of competitive equilibria can be made to
THEORETICAL DEVELOPMENTS AND VERIFICATION RESULTS by
, 1995
"... The contents of this report are not to be used for advertising, publication, or promotional purposes. Citation of trade names does not constitute an official endorsement or approval of the use of such commercial products. ® PRINTED ON RECYCLED PAPER ..."
Abstract
 Add to MetaCart
The contents of this report are not to be used for advertising, publication, or promotional purposes. Citation of trade names does not constitute an official endorsement or approval of the use of such commercial products. ® PRINTED ON RECYCLED PAPER
Fast probabilistic algorithms for verification of polynomial identities
 J. ACM
, 1980
"... ABSTRACT The starthng success of the RabmStrassenSolovay pnmahty algorithm, together with the intriguing foundattonal posstbthty that axtoms of randomness may constttute a useful fundamental source of mathemaucal truth independent of the standard axmmaUc structure of mathemaUcs, suggests a wgorous ..."
Abstract

Cited by 533 (1 self)
 Add to MetaCart
wgorous search for probabdisuc algonthms In dlustratmn of this observaUon, vanous fast probabdlsttc algonthms, with probability of correctness guaranteed a prion, are presented for testing polynomial ldentmes and propemes of systems of polynomials. Ancdlary fast algorithms for calculating resultants
Automatic verification of finitestate concurrent systems using temporal logic specifications
 ACM Transactions on Programming Languages and Systems
, 1986
"... We give an efficient procedure for verifying that a finitestate concurrent system meets a specification expressed in a (propositional, branchingtime) 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 1384 (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 finitestate concurrent systems. Experimental results show that state machines
Bandera: Extracting Finitestate Models from Java Source Code
 IN PROCEEDINGS OF THE 22ND INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING
, 2000
"... Finitestate verification techniques, such as model checking, have shown promise as a costeffective means for finding defects in hardware designs. To date, the application of these techniques to software has been hindered by several obstacles. Chief among these is the problem of constructing a fini ..."
Abstract

Cited by 653 (35 self)
 Add to MetaCart
finitestate model that approximates the executable behavior of the software system of interest. Current bestpractice involves handconstruction of models which is expensive (prohibitive for all but the smallest systems), prone to errors (which can result in misleading verification results
KodairaSpencer theory of gravity and exact results for quantum string amplitudes
 Commun. Math. Phys
, 1994
"... We develop techniques to compute higher loop string amplitudes for twisted N = 2 theories with ĉ = 3 (i.e. the critical case). An important ingredient is the discovery of an anomaly at every genus in decoupling of BRST trivial states, captured to all orders by a master anomaly equation. In a particu ..."
Abstract

Cited by 545 (60 self)
 Add to MetaCart
particular realization of the N = 2 theories, the resulting string field theory is equivalent to a topological theory in six dimensions, the Kodaira– Spencer theory, which may be viewed as the closed string analog of the Chern–Simon theory. Using the mirror map this leads to computation of the ‘number
Results 1  10
of
514,374