Academic literature on the topic 'Verification'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Verification.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Verification"

1

Benoit, Anne, Saurabh K. Raina, and Yves Robert. "Efficient checkpoint/verification patterns." International Journal of High Performance Computing Applications 31, no. 1 (July 28, 2016): 52–65. http://dx.doi.org/10.1177/1094342015594531.

Full text
Abstract:
Errors have become a critical problem for high-performance computing. Checkpointing protocols are often used for error recovery after fail-stop failures. However, silent errors cannot be ignored, and their peculiarity is that such errors are identified only when the corrupted data is activated. To cope with silent errors, we need a verification mechanism to check whether the application state is correct. Checkpoints should be supplemented with verifications to detect silent errors. When a verification is successful, only the last checkpoint needs to be kept in memory because it is known to be correct. In this paper, we analytically determine the best balance of verifications and checkpoints so as to optimize platform throughput. We introduce a balanced algorithm using a pattern with p checkpoints and q verifications, which regularly interleaves both checkpoints and verifications across same-size computational chunks. We show how to compute the waste of an arbitrary pattern, and we prove that the balanced algorithm is optimal when the platform MTBF (mean time between failures) is large in front of the other parameters (checkpointing, verification and recovery costs). We conduct several simulations to show the gain achieved by this balanced algorithm for well-chosen values of p and q, compared with the base algorithm that always perform a verification just before taking a checkpoint ( p = q = 1), and we exhibit gains of up to 19%.
APA, Harvard, Vancouver, ISO, and other styles
2

Shaik, Bushra, Jyothi Manohar Katikireddy, Vamsidhar Kambham, and K. Sravani. "Offline Signature Verification Using Image Processing." E3S Web of Conferences 391 (2023): 01074. http://dx.doi.org/10.1051/e3sconf/202339101074.

Full text
Abstract:
A person’s signature is merely a handwritten sign that closely resembles his/her name, frequently stylized and distinctive, and that expresses the person’s identity, intent, and consent. Two types of verifications are present. They are online signature verification and offline signature verification. Generally, Offline Signature verification is less efficient and slower process compare to online verification when come to the situation having larger number of documents and files to verify with in less time. Over the years, many researchers have developed so many methods for signature verifications to help the people or organizations to find whether the signature of a particular person is forged or genuine. To overcome this problems; In this paper we introduced a simple method to improve the verification of the signature in Image Processing using Convolution Neural Networks(CNN). Signature Verification it is used to authenticate various kinds of documents, including cheques, draughts, certificates, approvals, letters, and other legal ones, such verification is crucial for preventing document forgery and falsification. Previously, to verify a signature, it was manually checked against copies of real signatures. This straightforward approach might not be sufficient given that forgery and signature fraud techniques are becoming more sophisticated as a result of improving technology.
APA, Harvard, Vancouver, ISO, and other styles
3

Deboo, Cyrus, Shubham Kshatriya, and Rajat Bhat. "Video Liveness Verification." International Journal of Trend in Scientific Research and Development Volume-2, Issue-3 (April 30, 2018): 2449–52. http://dx.doi.org/10.31142/ijtsrd12772.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Pucella, Riccardo. "Logical verification and equational verification." ACM SIGACT News 36, no. 2 (June 2005): 77–88. http://dx.doi.org/10.1145/1067309.1067326.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Regehr, John, and Nathan Cooprider. "Interrupt Verification via Thread Verification." Electronic Notes in Theoretical Computer Science 174, no. 9 (June 2007): 139–50. http://dx.doi.org/10.1016/j.entcs.2007.04.002.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Simonova, Natalia S. "An International Verifi cation Institute as an Element of the Mechanism of Ensuring for Meeting Commitments under International Treaties." Moscow Journal of International Law, no. 1 (March 30, 2014): 82–102. http://dx.doi.org/10.24833/0869-0049-2014-1-82-102.

Full text
Abstract:
The article deals with the explanation of an international verification’s nature as a specific type of international legal relationship. An author critically analyses domestic and foreign doctrines as well as the international treaties’ practice concerning the issues of international verification. An international verification institute is quite well-searched in the international law science. But the article author considers that traditional approaches to analysis of the international verification essence (investigation of subjects, matters and aims) are not sufficient. Practical value of this article flows from the new vision of the international verification as a specific international legal relationship. The legal matter, subjects and substance of the international verification are suggested to be searched in the article.
APA, Harvard, Vancouver, ISO, and other styles
7

Jiang, Long Long, and Dai Ping Li. "Using Contour Marking Bytecode Verification Algorithm on the Java Card." Applied Mechanics and Materials 556-562 (May 2014): 4120–23. http://dx.doi.org/10.4028/www.scientific.net/amm.556-562.4120.

Full text
Abstract:
Java bytecode verification could not be well performed in the smart card due to the resource usage especially in the resource-constrained devices. Currently, on the card there are several bytecode verifications which exist kinds of problems, in order to be better and be better adapt to the environment, such as a smart card platform, raised using the contour subroutine labeled bytecode verification algorithm on a card. First, through the analysis of existing card byte code verification algorithm to determine the imperfections and difficulties in the judgment and the verification of subroutine, and then propose a method for marking the subroutine in the place of the jump to it. Thus not only get the program structure and enhance the effectiveness and efficiency of the validation. The feasibility of the method is demonstrated by simulating typical examples verification.
APA, Harvard, Vancouver, ISO, and other styles
8

Phelps, Doug. "Verification." Cataloging & Classification Quarterly 9, no. 1 (December 19, 1988): 5–9. http://dx.doi.org/10.1300/j104v09n01_02.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Robb, Jonathan Peter. "Verification." AJN, American Journal of Nursing 117, no. 6 (June 2017): 72. http://dx.doi.org/10.1097/01.naj.0000520263.18448.55.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Classen, Julie. "Verification." Nursing Management (Springhouse) 40, no. 8 (August 2009): 8. http://dx.doi.org/10.1097/01.numa.0000359199.37081.f7.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Verification"

1

Wang, Xuan. "Verification of Digital Controller Verifications." BYU ScholarsArchive, 2005. https://scholarsarchive.byu.edu/etd/681.

Full text
Abstract:
This thesis presents an analysis framework to verify the stablility property of a closed-loop control system with a software controller implementation. The usual approach to verifying stability for software uses experiments which are costly and can be dangerous. More recently, mathematical models of software have been proposed which can be used to reason about the correctness of controllers. However, these mathematical models ignore computational details that may be important in verification. We propose a method to determine the instability of a closed-loop system with a software controller implementation under l^2 inputs using simulation. This method avoids the cost of experimentation and the loss of precision inherent in mathematical modeling. The method uses the small gain theorem to compute a lower bound on the 2-induced norm of the uncertainty in the software implementation; if the lower bound is greater than 1/(2-induced norm of G), where G is the feedback system consisting of the mathematical model of the plant and the mathematical model of the controller, the closed-loop system is unsafe in a certain sense. The resulting method can not determine if the closed-loop system is stable, but can only suggest instability.
APA, Harvard, Vancouver, ISO, and other styles
2

Krupp, Alfred Alexander. "A verification plan for systematic verification of mechatronic systems." Aachen Shaker, 2009. http://d-nb.info/995161909/04.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Tiikkainen, M. (Martti). "Automated functional coverage driven verification with Universal Verification Methodology." Master's thesis, University of Oulu, 2017. http://jultika.oulu.fi/Record/nbnfioulu-201711033027.

Full text
Abstract:
Abstract. In this Master’s thesis, the validity of Universal Verification Methodology in digital design verification is studied. A brief look into the methodology’s history is taken, and its unique properties and object-oriented features are presented. Important coverage topics in project planning are discussed, and the two main types of coverage, code and functional coverage, are explained and the methods how they are captured are presented. The practical section of this thesis shows the implementation of a monitoring environment and an Universal Verification Methodology environment. The monitoring environment includes class-based components that are used to collect functional coverage from an existing SystemVerilog test bench. The Universal Verification Methodology environment uses the same monitoring system, but a different driving setup to stress the design under test. Coverage and simulation performance values are extracted and from all test benches and the data is compared. The results indicate that the Universal Verification Methodology environment incorporating constrained random stimulus is capable of faster simulation run times and better code coverage values. The simulation time measured was up to 26 % faster compared to a module-based environment.Automaattinen toiminnallisen kattavuuden ohjaama verifiointi universaalilla varmennusmenetelmällä. Tiivistelmä. Tässä diplomityössä tutkitaan universaalin varmennusmenetelmän (Universal Verification Methodology) soveltuvuutta digitaalisten laitteiden verifiointiin. Työssä tehdään lyhyt katsaus menetelmän historiaan. Lisäksi menetelmän omia ainutlaatuisia ja olio-pohjaisia ominaisuuksia käydään läpi. Kattavuuteen liittyviä käsitteitä esitetään projektihallinnan näkökulmasta. Kattavuudesta käsitellään toiminnallinen ja koodikattavuus, ja tavat, miten näitä molempia kerätään simulaatioista. Työn käytännön osuudessa esitetään monitorointiympäristön ja universaalin varmennusmenetelmän pohjalta tehdyn ympäristön toteutus. Monitorointi-ympäristössä on luokkapohjaisia komponentteja, joiden avulla kerätään toiminnallista kattavuutta jo olemassa olevasta testipenkistä. Universaalin varmennusmenetelmän pohjalta tehdyssä ympäristössä on samojen monitorointikomponenttien lisäksi testattavan kohteen ohjaamiseen vaadittavia komponentteja. Eri testipenkeistä kerätään kattavuuteen ja suorituskykyyn liittyvää dataa vertaamista varten. Tulokset viittaavat siihen, että rajoitettua satunnaista herätettä hyödykseen käyttävät universaalit varmennusmenetelmäympäristöt pääsevät nopeampiin suoritusaikoihin ja parempiin koodikattavuuslukuihin. Simulaation suoritusaikaan saatiin parhaassa tapauksessa jopa 26 % parannus.
APA, Harvard, Vancouver, ISO, and other styles
4

Sandström, Krantz Alexander. "Node hardening verification." Thesis, Linköping University, Department of Electrical Engineering, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-11822.

Full text
Abstract:

Secure networks require each node to individually be as secure as possible. Transporting telecommunication data using IP based networks increases the need for security solutions due to increased exposure to threats. Ericsson currently provides a reference solution for carrying radio traffic over standardized Ethernet using IP, which in the current version relies on third party equipment. This equipment, and their recommended configuration, needs to be tested to ensure that the reference solution is as secure as possible.

The main purpose of this thesis is to provide Ericsson with a template that describes how security testing of the currently recommended equipment can be carried out.


För att ett nätverk skall vara säkert krävs att dess noder är invidivuellt säkrade. Transportering av telekommunikation över IP baserade nätverk ökar behovet av säkerhetslösningar då det ökar riskerna. Ericsson erbjuder idag en referenslösning för transport av telekommunikationstrafik över IP nätverk, som i dagsläget använder tredje-parts-utrustning. Denna utrustning och den konfiguration som rekommenderas i referenslösningen behöver säkerhetstestas för att säkerställa att den erbjudna lösningen håller en hög säkerhetsnivå.

Huvudsyftet med detta exjobb är att ta fram en praktisk metod som kan användas vid Ericsson för att säkerhetstesta den utrustning som i dagsläget rekommenderas i referenslösningen.

APA, Harvard, Vancouver, ISO, and other styles
5

Yager, Neil Gordon Computer Science &amp Engineering Faculty of Engineering UNSW. "Hierarchical fingerprint verification." Awarded by:University of New South Wales. Computer Science and Engineering, 2006. http://handle.unsw.edu.au/1959.4/27008.

Full text
Abstract:
Fingerprints have been an invaluable tool for law enforcement and forensics for over a century, motivating research into automated fingerprint based identification in the early 1960's. More recently, fingerprints have found an application in the emerging industry of biometric systems. Biometrics is the automatic identification of an individual based on physiological or behavioral characteristics. Due to its security related applications and the current world political climate, biometrics is presently the subject of intense research by private and academic institutions. Fingerprints are emerging as the most common and trusted biometric for personal identification. However, despite decades of intense research there are still significant challenges for the developers of automated fingerprint verification systems. This thesis includes an examination of all major stages of the fingerprint verification process, with contributions made at each step. The primary focus is upon fingerprint registration, which is the challenging problem of aligning two prints in order to compare their corresponding features for verification. A hierarchical approach is proposed consisting of three stages, each of which employs novel features and techniques for alignment. Experimental results show that the hierarchical approach is robust and outperforms competing state-of-the-art registration methods from the literature. However, despite its power, like most algorithms it has limitations. Therefore, a novel method of information fusion at the registration level has been developed. The technique dynamically selects registration parameters from a set of competing algorithms using a statistical framework. This allows for the relative advantages of different approaches to be exploited. The results show a significant improvement in alignment accuracy for a wide variety of fingerprint databases. Given a robust alignment of two fingerprints, it still remains to be verified whether or not they have originated from the same finger. This is a non-trivial problem, and a close examination of fingerprint features available for this task is conducted with extensive experimental results.
APA, Harvard, Vancouver, ISO, and other styles
6

Wahab, Matthew. "Object code verification." Thesis, University of Warwick, 1998. http://wrap.warwick.ac.uk/61068/.

Full text
Abstract:
Object code is a program of a processor language and can be directly executed on a machine. Program verification constructs a formal proof that a program correctly implements its specification. Verifying object code therefore ensures that the program which is to be executed on a machine is correct. However, the nature of processor languages makes it difficult to specify and reason about object code programs in a formal system of logic. Furthermore, a proof of the correctness of an object code program will often be too large to construct manually because of the size of object code programs. The presence of pointers and computed jumps in object code programs constrains the use of automated tools to simplify object code verification. This thesis develops an abstract language which is expressive enough to describe any sequential object code program. The abstract language supports the definition of program logics in which to specify and verify object code programs. This allows the object code programs of any processor language to be verified in a single system of logic. The abstract language is expressive enough that a single command is enough to describe the behaviour of any processor instruction. An object code program can therefore be translated to the abstract language by replacing each instruction with the equivalent command of the abstract language. This ensures that the use of the abstract language does not increase the difficulty of verifying an object code program. The verification of an object code program can be simplified by constructing an abstraction of the program and showing that the abstraction correctly implements the program specification. Methods for abstracting programs of the abstract language are developed which consider only the text of a program. These methods are based on describing a finite sequence of commands as a single, equivalent, command of the abstract language. This is used to define transformations which abstract a program by replacing groups of program commands with a single command. The abstraction of a program formed in this way can be verified in the same system of logic as the original program. Because the transformations consider only the program text, they are suitable for efficient mechanisation in an automated proof tool. By reducing the number of commands which must be considered, these methods can reduce the manual work needed to verify a program. The use of an abstract language allows object code programs to be specified and verified in a system of logic while the use of abstraction to simplify programs makes verification practical. As examples, object code programs for two different processors are modelled, abstracted and verified in terms of the abstract language. Features of processor languages and of object code programs which affect verification and abstraction are also summarised.
APA, Harvard, Vancouver, ISO, and other styles
7

Gonzalez, Perez Carlos Alberto. "Pragmatic model verification." Thesis, Nantes, Ecole des Mines, 2014. http://www.theses.fr/2014EMNA0189/document.

Full text
Abstract:
L’Ingénierie Dirigée par les Modèles (IDM) est une approche populaire pour le développement logiciel qui favorise l’utilisation de modèles au sein des processus de développement. Dans un processus de développement logiciel base sur l’IDM, le logiciel est développé en créant des modèles qui sont transformés successivement en d’autres modèles et éventuellement en code source. Quand l’IDM est utilisée pour le développement de logiciels complexes, la complexité des modèles et des transformations de modèles augmente, risquant d’affecter la fiabilité du processus de développement logiciel ainsi que le logiciel en résultant.Traditionnellement, la fiabilité des logiciels est assurée au moyen d’approches pour la vérification de logiciels, basées sur l’utilisation de techniques pour l’analyse formelle de systèmes et d’approches pour le test de logiciels. Pour assurer la fiabilité du processus IDM de développement logiciel, ces techniques ont en quelque sorte été adaptées pour essayer de s’assurer la correction des modèles et des transformations de modèles associées. L’objectif de cette thèse est de fournir de nouveaux mécanismes améliorant les approches existantes pour la vérification de modèles statiques, et d’analyser comment ces approches peuvent s’avérer utiles lors du test des transformations de modèles
Model-Driven Engineering (MDE) is a popular approach to the development of software which promotes the use of models as first-Class citizens in the software development process. In a MDE-Based software development process, software is developed by creating models to be successively transformed into another models and eventually into the software source code. When MDE is applied to the development of complex software systems, the complexity of models and model transformations increase, thus risking both, the reliability of the software development process and the soundness of the resulting software. Traditionally, ensuring software correctness and absence of errors has been addressed by means of software verification approaches, based on the utilization of formal analysis techniques, and software testing approaches. In order to ensure the reliability of MDE-Based software development processes, these techniques have some how been adapted to try to ensure correctness of models and model transformations. The objective of this thesis is to provide new mechanisms to improve the landscape of approaches devoted to the verification of static models, and analyze how these static model verification approaches can be of assistance at the time of testing model transformations
APA, Harvard, Vancouver, ISO, and other styles
8

Ingraham, Daniel. "Verification of a Computational Aeroacoustics Code Using External Verification Analysis (EVA)." University of Toledo / OhioLINK, 2010. http://rave.ohiolink.edu/etdc/view?acc_num=toledo1271271426.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Kenger, Patrik. "Module property verification : A method to plan and perform quality verifications in modular architectures." Doctoral thesis, Stockholm, 2006. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-3965.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Krupp, Alfred Alexander [Verfasser]. "A Verification Plan for Systematic Verification of Mechatronic Systems / Alfred Alexander Krupp." Aachen : Shaker, 2009. http://d-nb.info/1156518482/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Verification"

1

United States. Environmental Protection Agency. Office of Research and Development., ed. Environmental Technology Verification Program: Verification strategy. Washington, DC: Office of Research and Development, U.S. Environmental Protection Agency, 1997.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Canada. Dept. of External Affairs., ed. Verification research: Canada's Verification Research Program. Ottawa, Ont: External Affairs Canada, 1988.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Feng, Lu, and Dana Fisman, eds. Runtime Verification. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-88494-9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Bloem, Roderick, Rayna Dimitrova, Chuchu Fan, and Natasha Sharygina, eds. Software Verification. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-95561-8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Colombo, Christian, and Gordon J. Pace. Runtime Verification. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-09268-8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Dang, Thao, and Volker Stolz, eds. Runtime Verification. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-17196-3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Lahiri, Shuvendu, and Giles Reger, eds. Runtime Verification. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-67531-2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Bartocci, Ezio, and Rupak Majumdar, eds. Runtime Verification. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-23820-3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Barringer, Howard, Ylies Falcone, Bernd Finkbeiner, Klaus Havelund, Insup Lee, Gordon Pace, Grigore Roşu, Oleg Sokolsky, and Nikolai Tillmann, eds. Runtime Verification. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-16612-9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Colombo, Christian, and Martin Leucker, eds. Runtime Verification. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-030-03769-7.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Verification"

1

Verbeek, Eric, and Moe Wynn. "Verification." In Modern Business Process Automation, 513–39. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-03121-2_20.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Balarin, Felice, Massimiliano Chiodo, Paolo Giusto, Harry Hsieh, Attila Jurecska, Luciano Lavagno, Claudio Passerone, et al. "Verification." In Hardware-Software Co-Design of Embedded Systems, 199–246. Boston, MA: Springer US, 1997. http://dx.doi.org/10.1007/978-1-4615-6127-9_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Kunze, Matthias, and Mathias Weske. "Verification." In Behavioural Models, 231–72. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-44960-9_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Keating, Michael. "Verification." In The Simple Art of SoC Design, 71–87. New York, NY: Springer New York, 2011. http://dx.doi.org/10.1007/978-1-4419-8586-6_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

McGettrick, Andrew D., Owen Traynor, and David Duffy. "Verification." In Program Development by Specification and Transformation, 129–44. Berlin, Heidelberg: Springer Berlin Heidelberg, 1993. http://dx.doi.org/10.1007/3-540-56733-x_146.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Weik, Martin H. "verification." In Computer Science and Communications Dictionary, 1886. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_20718.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Gajski, Daniel D., Samar Abdi, Andreas Gerstlauer, and Gunar Schirner. "Verification." In Embedded System Design, 255–85. Boston, MA: Springer US, 2009. http://dx.doi.org/10.1007/978-1-4419-0504-8_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Koomen, C. J. "Verification." In The Design of Communicating Systems, 27–47. Boston, MA: Springer US, 1991. http://dx.doi.org/10.1007/978-1-4615-4020-5_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Dillenberger, Felix. "Verification." In On the anisotropic plastic behaviour of short fibre reinforced thermoplastics and its description by phenomenological material modelling, 163–84. Wiesbaden: Springer Fachmedien Wiesbaden, 2019. http://dx.doi.org/10.1007/978-3-658-28199-1_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Tabuada, Paulo. "Verification." In Verification and Control of Hybrid Systems, 43–50. Boston, MA: Springer US, 2009. http://dx.doi.org/10.1007/978-1-4419-0224-5_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Verification"

1

Silva, Nuno, and Rui Lopes. "Independent Test Verification: Consolidated Experience Report." In Simpósio Brasileiro de Qualidade de Software. Sociedade Brasileira de Computação - SBC, 2012. http://dx.doi.org/10.5753/sbqs.2012.15326.

Full text
Abstract:
Independent verification and validation (IV&V) has been a key process for decades, and is highlighted in several international certification standards. One of the activities described in the “ESA ISVV Guide” is independent test verification (stated as Integration/Unit Test Procedures and Test Data Verification). This activity is commonly overlooked since customers do not really see the added value of checking thoroughly the validation team work. This article presents the consolidated results of a large set of independent test verifications, including the main difficulties, results obtained and advantages/disadvantages for the industry of these activities. This study will support customers in opting-in or opting-out for this task in future IVV contracts since we provide factual results from some real case studies.
APA, Harvard, Vancouver, ISO, and other styles
2

Hansen, O. H., J. Stang, and V. Jaiswal. "A Trustworthy Digital Twin for Data Driven Verification." In Offshore Technology Conference. OTC, 2024. http://dx.doi.org/10.4043/35081-ms.

Full text
Abstract:
Abstract Traditionally, verification of equipment and systems has been carried out by deploying surveyors to perform physical verifications. Today, the development of digital twins, representing physical assets, provides the possibility to leverage data to enhance and replace the conventional verification and validation efforts undertaken by industry stakeholders. Digitalization, new technologies, algorithms, and artificial intelligence (AI), incorporated in digital twins, can be used to execute effective verifications. When such digital twins have proven to provide genuine and trustworthy evidence, the evidence can be used in assessments towards specified acceptance criteria, and issue, maintain, and renew certificates. Some parts of the assessment itself may even become automated through the use of algorithms and AI solutions, further increasing the importance of the rigor and intensity with which these digital twins must be qualified and assured. This paper is developed in order to support the development of trustworthy digital twins for data-driven-verification (DDV) systems and methods. Use of digital twins should be acceptable as long as they provide the same, or higher, level of assurance as the traditional methods. DDV also aims at reducing non-productive time, costs associated with surveyors attending the physical asset, redundant verification activities, and the knowledge sharing, and transfer burden imposed upon the asset organization.
APA, Harvard, Vancouver, ISO, and other styles
3

Bacchini, Francine, Robert Damiano, Bob Bentley, Kurt Baty, Kevin Normoyle, Makoto Ishii, and Einat Yogev. "Verification." In the 41st annual conference. New York, New York, USA: ACM Press, 2004. http://dx.doi.org/10.1145/996566.996648.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Ibrahim, Mohamed, Hansi Liu, Minitha Jawahar, Viet Nguyen, Marco Gruteser, Richard Howard, Bo Yu, and Fan Bai. "Verification." In MobiCom '18: The 24th Annual International Conference on Mobile Computing and Networking. New York, NY, USA: ACM, 2018. http://dx.doi.org/10.1145/3241539.3241555.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Dehbashi, Farzan, Ali Abedi, Tim Brecht, and Omid Abari. "Verification." In ACM MobiCom '21: The 27th Annual International Conference on Mobile Computing and Networking. New York, NY, USA: ACM, 2021. http://dx.doi.org/10.1145/3447993.3448622.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Chen, Lu, Fang Liu, and Kannan Srinivasan. "Verification." In MobiCom '19: The 25th Annual International Conference on Mobile Computing and Networking. New York, NY, USA: ACM, 2019. http://dx.doi.org/10.1145/3300061.3345445.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Lebrun, A., S. C. Kane, L. Bourva, S. Poirier, N. E. Loghin, and D. Langlands. "Improved verification methods for safeguards verifications at enrichment plants." In 2009 1st International Conference on Advancements in Nuclear Instrumentation, Measurement Methods and their Applications (ANIMMA). IEEE, 2009. http://dx.doi.org/10.1109/animma.2009.5503777.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Yang, Jin, and Avi Puder. "Tightly integrate dynamic verification with formal verification." In the 2005 conference. New York, New York, USA: ACM Press, 2005. http://dx.doi.org/10.1145/1120725.1120860.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Pamula, Pranuti, Durga Prasad Gorthy, Phalguni Singh Ngangbam, and Aravindhan Alagarsamy. "Verification of SoC Using Advanced Verification Methodology." In HMAM2. Basel Switzerland: MDPI, 2023. http://dx.doi.org/10.3390/hmam2-14160.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Chitti, Sridevi, P. Chandrasekhar, and M. Asha Rani. "Gigabit Ethernet verification using efficient verification methodology." In 2015 International Conference on Industrial Instrumentation and Control (ICIC). IEEE, 2015. http://dx.doi.org/10.1109/iic.2015.7150935.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Verification"

1

Ernst, Michael. Verification Games: Crowd-Sourced Formal Verification. Fort Belvoir, VA: Defense Technical Information Center, March 2016. http://dx.doi.org/10.21236/ad1006471.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Kamboj, S., C. Yu, B. M. Biwer, and T. Klett. RESRAD-BUILD verification. Office of Scientific and Technical Information (OSTI), January 2002. http://dx.doi.org/10.2172/792140.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Doebling, Scott William. Physics Verification Overview. Office of Scientific and Technical Information (OSTI), September 2017. http://dx.doi.org/10.2172/1392833.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Simpkins, A. A. Verification of AXAIRQ. Office of Scientific and Technical Information (OSTI), October 1995. http://dx.doi.org/10.2172/221022.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

McCowan, C. N., and J. D. Splett. Charpy machine verification :. Gaithersburg, MD: National Institute of Standards and Technology, 2008. http://dx.doi.org/10.6028/nist.sp.260-171.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Myers, Rodney S., and Geetha Mandava. Retention Model Verification. Fort Belvoir, VA: Defense Technical Information Center, March 2004. http://dx.doi.org/10.21236/ada421782.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Simpkins, A. A. Verification of VENTSAR. Office of Scientific and Technical Information (OSTI), January 1995. http://dx.doi.org/10.2172/105111.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Strichman, Ofer. Software Regression Verification. Fort Belvoir, VA: Defense Technical Information Center, December 2013. http://dx.doi.org/10.21236/ada594501.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Alur, Rajeev, Luca de Alfaro, Thomas A. Henzinger, and Freddy Y. Mang. Automating Modular Verification. Fort Belvoir, VA: Defense Technical Information Center, January 1999. http://dx.doi.org/10.21236/ada461302.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Raymond L. Mazza. PRODUCTION VERIFICATION TESTS. Office of Scientific and Technical Information (OSTI), September 2003. http://dx.doi.org/10.2172/822391.

Full text
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography