|
Test Template Framework
The Test Template Framework (TTF) is a model-based testing (MBT) framework proposed by Phil Stocks and David Carrington for the purpose of software testing. Although the TTF was meant to be notation-independent, the original presentation was made using the Z notation, Z formal notation. It is one of the few MBT frameworks approaching unit testing. Introduction The TTF is a specific proposal of model-based testing (MBT). It considers models to be Z notation, Z specifications. Each operation within the specification is analyzed to derive or generate #Abstract test case, ''abstract test cases''. This analysis consists of the following steps: # Define the #Input space, ''input space'' (IS) of each operation. # Derive the #Valid input space, ''valid input space'' (VIS) from the #Input space, IS of each operation. # Apply one or more #Testing tactic, ''testing tactics'',Stocks and Carrington use the term ''testing strategies'' in . starting from each #Valid input space, VIS, to build a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
Model-based Testing
Model-based testing is an application of model-based design for designing and optionally also executing artifacts to perform software testing or system testing. Models can be used to represent the desired behavior of a system under test (SUT), or to represent testing strategies and a test environment. The picture on the right depicts the former approach. A model describing a SUT is usually an abstract, partial presentation of the SUT's desired behavior. Test cases derived from such a model are functional tests on the same level of abstraction as the model. These test cases are collectively known as an abstract test suite. An abstract test suite cannot be directly executed against an SUT because the suite is on the wrong level of abstraction. An executable test suite needs to be derived from a corresponding abstract test suite. The executable test suite can communicate directly with the system under test. This is achieved by mapping the abstract test cases to concrete test cases su ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
Morgan Kaufmann
Morgan Kaufmann Publishers is a Burlington, Massachusetts (San Francisco, California until 2008) based publisher specializing in computer science and engineering content. Since 1984, Morgan Kaufmann has been publishing contents on information technology, computer architecture, data management, computer networking, computer systems, human computer interaction, computer graphics, multimedia information and systems, artificial intelligence, computer security, and software engineering. Morgan Kaufmann's audience includes the research and development communities, information technology (IS/IT) managers, and students in professional degree programs. The company was founded in 1984 by publishers Michael B. Morgan and William Kaufmann and computer scientist Nils Nilsson. It was held privately until 1998, when it was acquired by Harcourt General and became an imprint of the Academic Press, a subsidiary of Harcourt. Harcourt was acquired by Reed Elsevier in 2001; Morgan Kaufmann is now ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
Fastest
Fastest is a model-based testing tool that works with specifications written in the Z notation. The tool implements the Test Template Framework (TTF) proposed by Phil Stocks and David Carrington. Usage Fastest presents a command-line user interface. The user first needs to load a Z specification written in LaTeX format verifying the International Organization for Standardization, ISO standard. Then, the user has to enter a list of the operations to test as well as the Test Template Framework#Testing tactic, testing tactics to apply to each of them. In a third step Fastest generates the Test Template Framework#Testing tree&, testing tree of each operation. After testing trees have been generated, users can browse them and their Test Template Framework#Test class, test classes, and, more importantly, they can Test Template Framework#Pruning testing trees, prune any test class both #Pruning testing trees in Fastest, automatically or manually. Once testing trees have been pruned, use ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
Model-based Testing
Model-based testing is an application of model-based design for designing and optionally also executing artifacts to perform software testing or system testing. Models can be used to represent the desired behavior of a system under test (SUT), or to represent testing strategies and a test environment. The picture on the right depicts the former approach. A model describing a SUT is usually an abstract, partial presentation of the SUT's desired behavior. Test cases derived from such a model are functional tests on the same level of abstraction as the model. These test cases are collectively known as an abstract test suite. An abstract test suite cannot be directly executed against an SUT because the suite is on the wrong level of abstraction. An executable test suite needs to be derived from a corresponding abstract test suite. The executable test suite can communicate directly with the system under test. This is achieved by mapping the abstract test cases to concrete test cases su ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
Tree (data Structure)
In computer science, a tree is a widely used abstract data type that represents a hierarchical tree structure with a set of connected nodes. Each node in the tree can be connected to many children (depending on the type of tree), but must be connected to exactly one parent, except for the ''root'' node, which has no parent (i.e., the root node as the top-most node in the tree hierarchy). These constraints mean there are no cycles or "loops" (no node can be its own ancestor), and also that each child can be treated like the root node of its own subtree, making recursion a useful technique for tree traversal. In contrast to linear data structures, many trees cannot be represented by relationships between neighboring nodes (parent and children nodes of a node under consideration, if they exist) in a single straight line (called edge or link between two adjacent nodes). Binary trees are a commonly used type, which constrain the number of children for each parent to at most two. Whe ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
