Results 1 - 10
of
395,558
Verification and Testing
"... Design verification determines whether your design correctly implements a specification …and hopefully that the specification was correct Manufacturing tests determine whether the fabrication process successfully reproduced an instance of your design with acceptable quality – Quality measures includ ..."
Abstract
- Add to MetaCart
Design verification determines whether your design correctly implements a specification …and hopefully that the specification was correct Manufacturing tests determine whether the fabrication process successfully reproduced an instance of your design with acceptable quality – Quality measures
Verification, and Testing
"... The National Bureau of Standards ' was established by an act of Congress on March 3, 1901. The Bureau's overall goal is to strengthen and advance the Nation's science and technology and facilitate their effective application for public benefit. To this end, the Bureau conducts researc ..."
Abstract
- Add to MetaCart
The National Bureau of Standards ' was established by an act of Congress on March 3, 1901. The Bureau's overall goal is to strengthen and advance the Nation's science and technology and facilitate their effective application for public benefit. To this end, the Bureau conducts research and provides: (1) a basis for the Nation's physical measurement system, (2) scientific and technological services for industry and government, (3) a technical basis for equity in trade, and (4) technical services to promote public safety. The Bureau's technical work is per-
VERIFICATION AND TESTING OF BIOLOGICAL MODELS
"... Simulation modeling in systems biology embarks on discrete event simulation only for cases of small cardinalities of entities and uses continuous simulation otherwise. Modern modeling environments like Bio-PEPA support both types of simulation within a single modeling formalism. Developing models fo ..."
Abstract
- Add to MetaCart
for complex dynamic phenomena is not trivial in practice and requires careful verification and testing. In this paper, we describe relevant steps in the verification and testing of a TNFα-mediated NF-κB signal transduction pathway model and discuss to what extent automated techniques help a practitioner
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
Speaker verification using Adapted Gaussian mixture models
- Digital Signal Processing
, 2000
"... In this paper we describe the major elements of MIT Lincoln Laboratory’s Gaussian mixture model (GMM)-based speaker verification system used successfully in several NIST Speaker Recognition Evaluations (SREs). The system is built around the likelihood ratio test for verification, using simple but ef ..."
Abstract
-
Cited by 976 (42 self)
- Add to MetaCart
In this paper we describe the major elements of MIT Lincoln Laboratory’s Gaussian mixture model (GMM)-based speaker verification system used successfully in several NIST Speaker Recognition Evaluations (SREs). The system is built around the likelihood ratio test for verification, using simple
Fast probabilistic algorithms for verification of polynomial identities
- J. ACM
, 1980
"... ABSTRACT The starthng success of the Rabm-Strassen-Solovay 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
Verification and testing automation of UML projects
"... Abstract – This paper presents an integrated approach to verification and testing automation of UML projects. It consists of automatic model creation from UML specifications in the formal language of basic protocols, model’s verification by the means of VRS technology and automatic tests generation ..."
Abstract
- Add to MetaCart
Abstract – This paper presents an integrated approach to verification and testing automation of UML projects. It consists of automatic model creation from UML specifications in the formal language of basic protocols, model’s verification by the means of VRS technology and automatic tests generation
(\in., VALIDATION, VERIFICATION, AND TESTING FOR
"... Guidelines are given for program testing and verification to ensure quality software for the programmer working alone in a computing environment with limited resources. The emphasis is on verification as an integral part of the software development.. Guidance includes developing and planning testing ..."
Abstract
- Add to MetaCart
Guidelines are given for program testing and verification to ensure quality software for the programmer working alone in a computing environment with limited resources. The emphasis is on verification as an integral part of the software development.. Guidance includes developing and planning
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 1384 (62 self)
- Add to MetaCart
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 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 with several hundred states can be checked in a matter of seconds.
Verification and Testing Report
"... Introduction. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 2. Verification of Navigation System using the CRL Toolset. . . . . . . . . . . . . . . 4 2.1. Description of the CRL. . . . . . . . . . . . . . . . . . . . . . . . ..."
Abstract
- Add to MetaCart
Introduction. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 2. Verification of Navigation System using the CRL Toolset. . . . . . . . . . . . . . . 4 2.1. Description of the CRL
Results 1 - 10
of
395,558