Model-Based Mutation Testing of an Industrial Measurement Device

Total Page:16

File Type:pdf, Size:1020Kb

Model-Based Mutation Testing of an Industrial Measurement Device Model-Based Mutation Testing of an Industrial Measurement Device Bernhard K. Aichernig1, Jakob Auer2, Elisabeth Jöbstl1, Robert Korošec2, Willibald Krenn3, Rupert Schlick3, and Birgit Vera Schmidt2 1 Institute for Software Technology, Graz University of Technology, Austria {aichernig,joebstl}@ist.tugraz.at 2 AVL List GmbH, Graz, Austria {jakob.auer,robert.korosec,birgitvera.schmidt}@avl.com 3 AIT Austrian Institute of Technology, Vienna, Austria {willibald.krenn,rupert.schlick}@ait.ac.at Abstract. MoMuT::UML is a model-based mutation testing tool for UML models. It maps UML state machines to a formal semantics and performs a conformance check between an original and a set of mutated models to automatically generate test cases. The resulting test suite is able to detect whether a system under test implements one of the faulty models instead of the correct, original model. In this work, we illus- trate the whole model-based mutation testing process by means of an industrial case study. We test the control logic of a device that counts the particles in exhaust gases. First, we model the system under test in UML. Then, MoMuT::UML is used to automatically generate three test suites from the UML test model: one mutation-based test suite, one set of random test cases, and a third test suite combining random and mutation-based test case generation. The test cases are executed on the system under test and effectively reveal several errors. Finally, we com- pare the fault detection capabilities of the three test suites on a set of faulty systems, which were created by intentionally injecting faults into the implementation. Keywords: test case generation, model-based testing, mutation testing, automotive industry, UML 1 Introduction Testing of complex systems is a challenging and labour-intensive task. Approx- imately 50% of the elapsed time and costs of a software project are spent on testing [24]. Furthermore, the later a software error is detected, the higher are the costs for fixing it [18]. Hence, tools and techniques to assist testers are de- manded by industry. In this work, we present a formal approach to software testing and demonstrate its applicability in an industrial setting. Figure 1 gives an overview of our approach, which we refer to as model-based mutation testing. Yellow parts highlight the aspects of mutation testing that we integrate into model-based testing, which is depicted in grey. Model-based test- ing (MBT) is a black-box testing technique requiring no knowledge about the 2 B.K. Aichernig et al. mutation operators 1) model creation 1a) model requirements 1) model creation 1a) model and validation mutation and validation test mutation mutated model models SUT concrete abstract 2)2) testtest casecase generationgeneration 3)3) concretionconcretion (black-box) test cases test cases byby conformanceconformance checkcheck 4)4) testtest casecase test 5)5) analysisanalysis executionexecution results Fig. 1. Overview of model-based mutation testing. source code of the system under test (SUT). Only the interface to the SUT has to be known. A test engineer creates a formal model that describes the expected be- haviour of the SUT (Step 1). Test cases are then automatically derived from this test model. A crucial matter in MBT is the choice of the test criterion. It specifies which test cases shall be generated and hence, has a great influence on the qual- ity of the resulting test suite. Exhaustive testing, i.e., using all of the test cases that can possibly be created from the test model, is impractical. Examples for commonly used test criteria are coverage criteria, random traversals, equivalence classes, or specified testing scenarios (test purposes). We follow a fault-centred approach, i.e., use mutations for test case generation (TCG). We syntactically alter the original test model producing a set of mutated models (Step 1a). We then automatically generate test cases that kill the model mutants, i.e., reveal their non-conforming behaviour. This is accomplished by a conformance check between the original and the mutated models (Step 2). As the test model is an abstraction of the SUT, also the derived test cases are abstract. Hence, they have to be concretised, i.e., mapped to the level of detail of the SUT (Step 3). Finally, the concrete test cases can be executed on the SUT (Step 4) and the test results can be analysed (Step 5). A particular feature of the generated test suites is their fault coverage. The generated tests will detect whether a faulty model has been implemented instead of the correct, original model. Hence, the generated test suite covers all of the modelled faults expressed by the model mutation operators and has a high chance of covering many additional similar faults (cf. coupling effect [14]). Tool support for our model-based mutation testing approach is provided by the MoMuT::UML test case generator. It takes a UML model of the SUT, automatically creates mutated models, and subsequently uses these models for the automatic generation of abstract test cases. For model creation, we rely on external UML modelling tools like Visual Paradigm. The concretion and execution of the abstract test cases has also not been integrated in MoMuT::UML as these tasks highly depend on the SUT. We already presented and applied the model-based mutation testing approach previously [2]. However, this earlier work relied on an enumerative TCG engine. One contribution of this work is the application of a new and more efficient Model-Based Mutation Testing of an Industrial Measurement Device 3 TCG engine based on SMT solving techniques. Underlying research has already been presented in [3–5]. However, these earlier tool versions did not yet support the full language required for the UML approach and additionally used Prolog’s constraint solver instead of the SMT solver Z3. Hence, this is the first time that we apply our SMT-based TCG tool to a UML model. The main contribution is a comprehensive case study: we demonstrate the whole model-based mutation testing process on an industrial use case from the automotive domain incl. modelling, test generation, concretion, as well as exe- cution and analysis of the test results. Moreover, we evaluate the fault detection capability of the mutation-based tests on a set of faulty SUTs and compare it with random tests and a test suite combining random and mutation-based tests. The rest of this paper is structured as follows. Section 2 presents the SUT and describes how it has been modelled in UML. Section 3 deals with test case generation with MoMuT::UML and Section 4 reports on test execution. Finally, we discuss related work in Section 5 and conclude the paper in Section 6. 2 System under Test: a Particle Counter The SUT is a measurement device for the automotive domain produced by AVL1 which is used to measure particle number concentrations of diluted exhaust gas in compliance with UNECE-83 and PMP2. The particle counter consists of a conditioning component (volatile particle remover VPR) and the actual particle number counter (PNC). The VPR consists of the first dilution step, an evaporation tube, and a secondary dilution step. In order to count non-volatile particles, a pump draws the exhaust gas into a sampling probe which eliminates all particles >2.5 µm. The sampled exhaust gas is then diluted with cleaned hot air to stabilize the particle number concentra- tion. After the hot primary dilution, the diluted exhaust gas is further heated up in the evaporation tube in order to convert all volatile particles into the gaseous phase. Afterwards, a secondary dilution is performed to prevent further conden- sation or adsorption of volatile substances and to ensure that the maximum inlet temperature of the particle number counter (PNC) is not exceeded. Within the PNC the particles are enlarged due to the condensation of butanol and detected and counted using the light-scattering method. In this paper we are concerned with testing the control logic of the particle counter, which offers several different operation modes to the user. For exam- ple, the user can choose between continuously measuring the current particle concentration or accumulating the number of particles counted over a period of time. During the measurement, the ratio by which the exhaust gas is mixed with particle-free dilution air can be adjusted. Additionally, there is a command to measure pure, particle-free air to check whether the sensors are calibrated correctly. Other commands are provided for necessary maintenance tasks like a leakage test, a response check, or for purging the sampling line. 1 https://www.avl.com/particle-counter, 18.03.2014 2 http://www.unece.org/, 14.05.2014 State Pause_0 Active entry / SetPause / set not Manual body = send SPAU_state() to testEnvironment; exit / Timed / send StatusReady Activity2 Purging_Pause_12 body = 20 entry / send StatusBusy() to testEnvironment; SetPurge [not Busy and not Manual] body = send SPUL_state() to testEnvironment; Initial_top Busy = true; SetStandby / set not Manual Leakage_11 LeakageTest [not Busy and not Manual] entry / Pause_internal body = send SLEC_state() to testEnvironment; Initial_pause Purging_Standby_12 SetPause / set not Manual entry / body = send SPUL_state() to testEnvironment; Response_14 SetStandby [not Busy] / set not Manual SetPause / set not Manual entry / body = send SEGA_state() to testEnvironment; Standby_1 entry / body = send STBY_state() to testEnvironment; Timeless exit / 20 Activity3 Integral_9 body = entry / send StatusBusy() to testEnvironment;
Recommended publications
  • ON SOFTWARE TESTING and SUBSUMING MUTANTS an Empirical Study
    ON SOFTWARE TESTING AND SUBSUMING MUTANTS An empirical study Master Degree Project in Computer Science Advanced level 15 credits Spring term 2014 András Márki Supervisor: Birgitta Lindström Examiner: Gunnar Mathiason Course: DV736A WECOA13: Web Computing Magister Summary Mutation testing is a powerful, but resource intense technique for asserting software quality. This report investigates two claims about one of the mutation operators on procedural logic, the relation operator replacement (ROR). The constrained ROR mutant operator is a type of constrained mutation, which targets to lower the number of mutants as a “do smarter” approach, making mutation testing more suitable for industrial use. The findings in the report shows that the hypothesis on subsumption is rejected if mutants are to be detected on function return values. The second hypothesis stating that a test case can only detect a single top-level mutant in a subsumption graph is also rejected. The report presents a comprehensive overview on the domain of mutation testing, displays examples of the masking behaviour previously not described in the field of mutation testing, and discusses the importance of the granularity where the mutants should be detected under execution. The contribution is based on literature survey and experiment. The empirical findings as well as the implications are discussed in this master dissertation. Keywords: Software Testing, Mutation Testing, Mutant Subsumption, Relation Operator Replacement, ROR, Empirical Study, Strong Mutation, Weak Mutation
    [Show full text]
  • Thesis Template
    Automated Testing: Requirements Propagation via Model Transformation in Embedded Software Nader Kesserwan A Thesis In The Concordia Institute For Information System Engineering Presented in Partial Fulfillment of the Requirements For the Degree of Doctor of Philosophy (Information and Systems Engineering) at Concordia University Montreal, Quebec, Canada March 2020 © Nader Kesserwan 2020 ABSTRACT Automated Testing: Requirements Propagation via Model Transformation in Embedded Software Nader Kesserwan, Ph.D. Concordia University, 2020 Testing is the most common activity to validate software systems and plays a key role in the software development process. In general, the software testing phase takes around 40-70% of the effort, time and cost. This area has been well researched over a long period of time. Unfortunately, while many researchers have found methods of reducing time and cost during the testing process, there are still a number of important related issues such as generating test cases from UCM scenarios and validate them need to be researched. As a result, ensuring that an embedded software behaves correctly is non-trivial, especially when testing with limited resources and seeking compliance with safety-critical software standard. It thus becomes imperative to adopt an approach or methodology based on tools and best engineering practices to improve the testing process. This research addresses the problem of testing embedded software with limited resources by the following. First, a reverse-engineering technique is exercised on legacy software tests aims to discover feasible transformation from test layer to test requirement layer. The feasibility of transforming the legacy test cases into an abstract model is shown, along with a forward engineering process to regenerate the test cases in selected test language.
    [Show full text]
  • Testing, Debugging & Verification
    Testing, debugging & verification Srinivas Pinisetty This course Introduction to techniques to get (some) certainty that your program does what it’s supposed to. Specification: An unambiguous description of what a function (program) should do. Bug: failure to meet specification. What is a Bug? Basic Terminology ● Defect (aka bug, fault) introduced into code by programmer (not always programmer's fault, if, e.g., requirements changed) ● Defect may cause infection of program state during execution (not all defects cause infection) ● Infected state propagates during execution (infected parts of states may be overwritten or corrected) ● Infection may cause a failure: an externally observable error (including, e.g., non-termination) Terminology ● Testing - Check for bugs ● Debugging – Relating a failure to a defect (systematically find source of failure) ● Specification - Describe what is a bug ● (Formal) Verification - Prove that there are no bugs Cost of certainty Formal Verification Property based testing Unit testing Man hours (*) Graph not based on data, only indication More certainty = more work Contract metaphor Supplier: (callee) Implementer of method Client: (caller) Implementer of calling method or user Contract: Requires (precondition): What the client must ensure Ensures (postcondition): What the supplier must ensure ● Testing ● Formal specification ○ Unit testing ○ Logic ■ Coverage criteria ■ Propositional logic ● Control-Flow based ■ Predicate Logic ● Logic Based ■ SAT ■ Extreme Testing ■ SMT ■ Mutation testing ○ Dafny ○ Input
    [Show full text]
  • Different Types of Testing
    Different Types of Testing Performance testing a. Performance testing is designed to test run time performance of software within the context of an integrated system. It is not until all systems elements are fully integrated and certified as free of defects the true performance of a system can be ascertained b. Performance tests are often coupled with stress testing and often require both hardware and software infrastructure. That is, it is necessary to measure resource utilization in an exacting fashion. External instrumentation can monitor intervals, log events. By instrument the system, the tester can uncover situations that lead to degradations and possible system failure Security testing If your site requires firewalls, encryption, user authentication, financial transactions, or access to databases with sensitive data, you may need to test these and also test your site's overall protection against unauthorized internal or external access Exploratory Testing Often taken to mean a creative, internal software test that is not based on formal test plans or test cases; testers may be learning the software as they test it Benefits Realization tests With the increased focus on the value of Business returns obtained from investments in information technology, this type of test or analysis is becoming more critical. The benefits realization test is a test or analysis conducted after an application is moved into production in order to determine whether the application is likely to deliver the original projected benefits. The analysis is usually conducted by the business user or client group who requested the project and results are reported back to executive management Mutation Testing Mutation testing is a method for determining if a set of test data or test cases is useful, by deliberately introducing various code changes ('bugs') and retesting with the original test data/cases to determine if the 'bugs' are detected.
    [Show full text]
  • Guidelines on Minimum Standards for Developer Verification of Software
    Guidelines on Minimum Standards for Developer Verification of Software Paul E. Black Barbara Guttman Vadim Okun Software and Systems Division Information Technology Laboratory July 2021 Abstract Executive Order (EO) 14028, Improving the Nation’s Cybersecurity, 12 May 2021, di- rects the National Institute of Standards and Technology (NIST) to recommend minimum standards for software testing within 60 days. This document describes eleven recommen- dations for software verification techniques as well as providing supplemental information about the techniques and references for further information. It recommends the following techniques: • Threat modeling to look for design-level security issues • Automated testing for consistency and to minimize human effort • Static code scanning to look for top bugs • Heuristic tools to look for possible hardcoded secrets • Use of built-in checks and protections • “Black box” test cases • Code-based structural test cases • Historical test cases • Fuzzing • Web app scanners, if applicable • Address included code (libraries, packages, services) The document does not address the totality of software verification, but instead recom- mends techniques that are broadly applicable and form the minimum standards. The document was developed by NIST in consultation with the National Security Agency. Additionally, we received input from numerous outside organizations through papers sub- mitted to a NIST workshop on the Executive Order held in early June, 2021 and discussion at the workshop as well as follow up with several of the submitters. Keywords software assurance; verification; testing; static analysis; fuzzing; code review; software security. Disclaimer Any mention of commercial products or reference to commercial organizations is for infor- mation only; it does not imply recommendation or endorsement by NIST, nor is it intended to imply that the products mentioned are necessarily the best available for the purpose.
    [Show full text]
  • Jia and Harman's an Analysis and Survey of the Development Of
    IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 1 An Analysis and Survey of the Development of Mutation Testing Yue Jia Student Member, IEEE, and Mark Harman Member, IEEE Abstract— Mutation Testing is a fault–based software testing Besides using Mutation Testing at the software implementation technique that has been widely studied for over three decades. level, it has also been applied at the design level to test the The literature on Mutation Testing has contributed a set of specifications or models of a program. For example, at the design approaches, tools, developments and empirical results. This paper level Mutation Testing has been applied to Finite State Machines provides a comprehensive analysis and survey of Mutation Test- ing. The paper also presents the results of several development [20], [28], [88], [111], State charts [95], [231], [260], Estelle trend analyses. These analyses provide evidence that Mutation Specifications [222], [223], Petri Nets [86], Network protocols Testing techniques and tools are reaching a state of maturity [124], [202], [216], [238], Security Policies [139], [154], [165], and applicability, while the topic of Mutation Testing itself is the [166], [201] and Web Services [140], [142], [143], [193], [245], subject of increasing interest. [259]. Index Terms— mutation testing, survey Mutation Testing has been increasingly and widely studied since it was first proposed in the 1970s. There has been much research work on the various kinds of techniques seeking to I. INTRODUCTION turn Mutation Testing into a practical testing approach. However, Mutation Testing is a fault-based testing technique which pro- there is little survey work in the literature on Mutation Testing.
    [Show full text]
  • What Are We Really Testing in Mutation Testing for Machine
    What Are We Really Testing in Mutation Testing for Machine Learning? A Critical Reflection Annibale Panichella Cynthia C. S. Liem [email protected] [email protected] Delft University of Technology Delft University of Technology Delft, The Netherlands Delft, The Netherlands Abstract—Mutation testing is a well-established technique for niques, as extensively surveyed by Ben Braiek & Khom [5], assessing a test suite’s quality by injecting artificial faults into as well as Zhang et al. [6]. While this is a useful development, production code. In recent years, mutation testing has been in this work, we argue that current testing for ML approaches extended to machine learning (ML) systems, and deep learning (DL) in particular; researchers have proposed approaches, tools, are not sufficiently explicit about what is being tested exactly. and statistically sound heuristics to determine whether mutants In particular, in this paper, we focus on mutation testing, a in DL systems are killed or not. However, as we will argue well-established white-box testing technique, which recently in this work, questions can be raised to what extent currently has been applied in the context of DL. As we will show, used mutation testing techniques in DL are actually in line with several fundaments of classical mutation testing are currently the classical interpretation of mutation testing. We observe that ML model development resembles a test-driven development unclearly or illogically mapped to the ML context. After (TDD) process, in which a training algorithm (‘programmer’) illustrating this, we will conclude this paper with several generates a model (program) that fits the data points (test concrete action points for improvement.
    [Show full text]
  • Using Mutation Testing to Measure Behavioural Test Diversity
    Using mutation testing to measure behavioural test diversity Francisco Gomes de Oliveira Neto, Felix Dobslaw, Robert Feldt Chalmers and the University of Gothenburg Dept. of Computer Science and Engineering Gothenburg, Sweden [email protected], fdobslaw,[email protected] Abstract—Diversity has been proposed as a key criterion [7], or even over the entire set of tests altogether [8]. In to improve testing effectiveness and efficiency. It can be used other words, the goal is then, to obtain a test suite able to to optimise large test repositories but also to visualise test exercise distinct parts of the SUT to increase the fault detection maintenance issues and raise practitioners’ awareness about waste in test artefacts and processes. Even though these diversity- rate [5], [8]. However, the main focus in diversity-based testing based testing techniques aim to exercise diverse behavior in the has been on calculating diversity on, typically static, artefacts system under test (SUT), the diversity has mainly been measured while there has been little focus on considering the outcomes on and between artefacts (e.g., inputs, outputs or test scripts). of existing test cases, i.e., whether similar tests fail together Here, we introduce a family of measures to capture behavioural when executed against the same SUT. Many studies report that diversity (b-div) of test cases by comparing their executions and failure outcomes. Using failure information to capture the using the outcomes of test cases has proven to be an effective SUT behaviour has been shown to improve effectiveness of criteria to prioritise tests, but there are many challenges with history-based test prioritisation approaches.
    [Show full text]
  • ISTQB Glossary of Testing Terms 2.3X
    Standard glossary of terms used in Software Testing Version 2.3 (dd. March 28th, 2014) Produced by the ‘Glossary Working Party’ International Software Testing Qualifications Board Editor : Erik van Veenendaal (Bonaire) Copyright Notice This document may be copied in its entirety, or extracts made, if the source is acknowledged. Copyright © 2014, International Software Testing Qualifications Board (hereinafter called ISTQB®). 1 Acknowledgements This document was produced by the Glossary working group of the International Software Testing Qualifications Board (ISTQB). The team thanks the national boards for their suggestions and input. At the time the Glossary version 2.3 was completed the Glossary working group had the following members (alphabetic order): Armin Beer, Armin Born, Mette Bruhn-Pedersen, Josie Crawford, Ernst Dőring, George Fialkovitz, Matthias Hamburg, Bernard Homes, Ian Howles, Ozgur Kisir, Gustavo Marquez- Soza, Judy McKay (Vice-Chair) Avi Ofer, Ana Paiva, Andres Petterson, Juha Pomppu, Meile Posthuma. Lucjan Stapp and Erik van Veenendaal (Chair) The document was formally released by the General Assembly of the ISTQB on March, 28th, 2014 2 Change History Version 2.3 d.d. 03-28-2014 This new version has been developed to support the Foundation Extention Agile Tester syllabus. In addition a number of change request have been implemented in version 2.3 of the ISTQB Glossary. New terms added: Terms changed; - build verification test - acceptance criteria - burndown chart - accuracy testing - BVT - agile manifesto - content
    [Show full text]
  • Coverage-Guided Adversarial Generative Fuzzing Testing of Deep Learning Systems
    IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, VOL. XX, NO. X, XXXX 1 CAGFuzz: Coverage-Guided Adversarial Generative Fuzzing Testing of Deep Learning Systems Pengcheng Zhang, Member, IEEE, Qiyin Dai, Patrizio Pelliccione Abstract—Deep Learning systems (DL) based on Deep Neural Networks (DNNs) are increasingly being used in various aspects of our life, including unmanned vehicles, speech processing, intelligent robotics and etc. Due to the limited dataset and the dependence on manually labeled data, DNNs always fail to detect erroneous behaviors. This may lead to serious problems. Several approaches have been proposed to enhance adversarial examples for testing DL systems. However, they have the following two limitations. First, most of them do not consider the influence of small perturbations on adversarial examples. Some approaches take into account the perturbations, however, they design and generate adversarial examples based on special DNN models. This might hamper the reusability on the examples in other DNN models, thus reducing their generalizability. Second, they only use shallow feature constraints (e.g. pixel-level constraints) to judge the difference between the generated adversarial example and the original example. The deep feature constraints, which contain high-level semantic information - such as image object category and scene semantics, are completely neglected. To address these two problems, we propose CAGFuzz, a Coverage-guided Adversarial Generative Fuzzing testing approach for Deep Learning Systems, which generates adversarial examples for DNN models to discover their potential defects. First, we train an Adversarial Case Generator (AEG) based on general data sets. AEG only considers the data characteristics, and avoids low generalization ability. Second, we extract the deep features of the original and adversarial examples, and constrain the adversarial examples by cosine similarity to ensure that the semantic information of adversarial examples remains unchanged.
    [Show full text]
  • If You Can't Kill a Supermutant, You Have a Problem
    If You Can’t Kill a Supermutant, You Have a Problem Rahul Gopinath∗, Bjorn¨ Mathis†, Andreas Zeller‡ Saarland University Email: ∗[email protected], †[email protected] , ‡[email protected] Abstract—Quality of software test suites can be effectively Detected: yes and accurately measured using mutation analysis. Traditional mutation involves seeding first and sometimes higher order faults into the program, and evaluating each for detection. yes no However, traditional mutants are often heavily redundant, and it is desirable to produce the complete matrix of test cases vs mutants detected by each. Unfortunately, even the traditional yes yes mutation analysis has a heavy computational footprint due to the requirement of independent evaluation of each mutant by the complete test suite, and consequently the cost of evaluation of complete kill matrix is exorbitant. We present a novel approach of combinatorial evaluation of Fig. 1: Evaluation of supermutants. The filled dots indicate multiple mutants at the same time that can generate the complete mutations applied within the supermutants. The non detected mutant kill matrix with lower computational requirements. mutants are indicated by doubled borders. Our approach also has the potential to reduce the cost of execution of traditional mutation analysis especially for test suites with weak oracles such as machine-generated test suites, while at mutant kill matrix2 because each mutant needs to be evaluated the same time liable to only a linear increase in the time taken for mutation analysis in the worst case. by executing it against each test case. Note that the number of mutants that can be generated from a program is typically I.
    [Show full text]
  • White Box Testing Process
    Introduction to Dynamic Analysis Reference material • Introduction to dynamic analysis • Zhu, Hong, Patrick A. V. Hall, and John H. R. May, "Software Unit Test Coverage and Adequacy," ACM Computing Surveys, vol. 29, no.4, pp. 366-427, December, 1997 Common Definitions • Failure-- result that deviates from the expected or specified intent • Fault/defect-- a flaw that could cause a failure • Error -- erroneous belief that might have led to a flaw that could result in a failure • Static Analysis -- the static examination of a product or a representation of the product for the purpose of inferring properties or characteristics • Dynamic Analysis -- the execution of a product or representation of a product for the purpose of inferring properties or characteristics • Testing -- the (systematic) selection and subsequent "execution" of sample inputs from a product's input space in order to infer information about the product's behavior. • usually trying to uncover failures • the most common form of dynamic analysis • Debugging -- the search for the cause of a failure and subsequent repair Validation and Verification: V&V • Validation -- techniques for assessing the quality of a software product • Verification -- the use of analytic inference to (formally) prove that a product is consistent with a specification of its intent • the specification could be a selected property of interest or it could be a specification of all expected behaviors and qualities e.g., all deposit transactions for an individual will be completed before any withdrawal transaction
    [Show full text]