MOOSE System Requirements and Traceability Matrix

Introduction

error:Missing Template Item "minimum_requirements"help_outline

  1. The software requirements shall include technical requirements including operating system, function, interfaces, performance, and security requirements, installation considerations, design inputs, and any design constraints.

  2. Identify applicable reference drawings, specifications, codes, standards, regulations, procedures, or instructions that establish software requirement test, inspection, and acceptance criteria.

  3. Software requirements shall be traceable throughout the life cycle.

  4. Security requirements shall be specified commensurate with the risk from unauthorized access or use.

The software test plan as part of the requirements traceability matrix document must include, as applicable:

  1. Required tests and test sequence.

  2. Required ranges of input parameters.

  3. Identification of stages when testing is required.

  4. Criteria for establishing test cases.

  5. Requirements for testing logic branches.

  6. Requirements for hardware integration.

  7. Expected results.

  8. Acceptance criteria.

  9. Reports, records, standard formatting, and conventions.

  10. Disposition unexpected results. Performance of system test is by personnel other than the development staff.

note

Software test records shall include:

  1. Computer program tested and support software used

  2. Computer hardware used

  3. Test equipment and calibrations, where applicable

  4. Date of test

  5. Tester or data recorder

  6. Simulation models used, where applicable

  7. Test problems. Results and applicability

  8. Action taken in connection with any deviations

  9. Person evaluating the test results 11. Customer approval.

System Purpose

error:Missing Template Item "system-purpose"help_outline

Summarize the reason(s) for the system being developed or modified.

System Scope

error:Missing Template Item "system-scope"help_outline

Delineate the following:

  1. Identify the product(s) to be produced by name (Network Infrastructure, Host DBMS, Report Generator, HPC Server, etc.)

  2. Explain what the product(s) will, and, if necessary, will not do

  3. Describe the application of the product being specified, including relevant benefits, objectives, and goals.

note

Be consistent with similar statements in higher level specifications (e.g., business requirements specification).

Assumptions and Dependencies

error:Missing Template Item "assumptions-and-dependencies"help_outline

List each of the factors that affect the requirements and should be taken into consideration for derivation of lower level requirements and design. These factors should include design inputs, design constraints, and installation considerations. Changes to these can affect the requirements in the specification. For example, an assumption may be that a specific operating system will be available on the hardware designated for the product. If, in fact, the operating system is not available, the specification would then have to change accordingly.

Pre-test Instructions/Environment/Setup

error:Missing Template Item "pre-test"help_outline

Provide a clear description of the test environment and any required instructions for setup. This includes:

  • Pre-test environment and setup requirements including computer hardware and system software used

  • How the test data is created and required ranges for input parameters

  • How the test case is executed (i.e., manual/automated tool)

  • The steps to validate the test result including any acceptance criteria.

System Requirements

Requirements Traceability Matrix

  • Geomsearch
  • F15.1

    The PenetrationAux object shall compute the distance between two overlapping boundaries using a constant monomial auxiliary variable.

    Specification: geomsearch/quadrature_penetration_locator:qpl

    Design: PenetrationAux

  • F15.2

    The PenetrationAux object shall compute the distance between two overlapping boundaries using a constant monomial auxiliary variable in 1D.

    Specification: geomsearch/quadrature_penetration_locator:1d_qpl

    Design: PenetrationAux

  • F15.3

    The PenetrationAux object shall be capable of computing the distance, tangential distance, normal, closest point, side id, and element id between two parallel, disjoint surfaces of a moving interface in 2D.

    Specification: geomsearch/2d_moving_penetration:pl_test1

    Design: PenetrationAux

  • F15.4

    The PenetrationAux object shall be capable of computing the distance, tangential distance, normal, closest point, side id, and element id between two parallel, disjoint surfaces of a moving interface in 2D using second order elements.

    Specification: geomsearch/2d_moving_penetration:pl_test1q

    Design: PenetrationAux

  • F15.5

    The PenetrationAux object shall be capable of computing the distance, tangential distance, normal, closest point, side id, and element id between two parallel, disjoint surfaces of a moving interface in 2D using a tangential tolerance of for the distance.

    Specification: geomsearch/2d_moving_penetration:pl_test1tt

    Design: PenetrationAux

  • F15.6

    The PenetrationAux object shall be capable of computing the distance, tangential distance, normal, closest point, side id, and element id between two parallel, disjoint surfaces of a moving interface in 2D using a tangential tolerance of for the distance and second order elements.

    Specification: geomsearch/2d_moving_penetration:pl_test1qtt

    Design: PenetrationAux

  • F15.7

    The PenetrationAux object shall be capable of computing the distance, tangential distance, normal, closest point, side id, and element id between two parallel, overlapping surfaces of a moving interface in 2D.

    Specification: geomsearch/2d_moving_penetration:pl_test2

    Design: PenetrationAux

  • F15.8

    The PenetrationAux object shall be capable of computing the distance, tangential distance, normal, closest point, side id, and element id between two parallel, overlapping surfaces of a moving interface in 2D with second order elements.

    Specification: geomsearch/2d_moving_penetration:pl_test2q

    Design: PenetrationAux

  • F15.9

    The PenetrationAux object shall be capable of computing the distance, tangential distance, normal, closest point, side id, and element id between two parallel, overlapping surfaces of a moving interface in 2D using a tangential tolerance for the distance.

    Specification: geomsearch/2d_moving_penetration:pl_test2tt

    Design: PenetrationAux

  • F15.10

    The PenetrationAux object shall be capable of computing the distance, tangential distance, normal, closest point, side id, and element id between two parallel, overlapping surfaces of a moving interface in 2D using a tangential tolerance for the distance and second order elements.

    Specification: geomsearch/2d_moving_penetration:pl_test2qtt

    Design: PenetrationAux

  • F15.11

    The PenetrationAux object shall be capable of computing the distance, tangential distance, normal, closest point, side id, and element id between a flat and convex disjoint surfaces of a moving interface in 2D.

    Specification: geomsearch/2d_moving_penetration:pl_test3

    Design: PenetrationAux

  • F15.12

    The PenetrationAux object shall be capable of computing the distance, tangential distance, normal, closest point, side id, and element id between a flat and convex disjoint surfaces of a moving interface in 2D and second order elements.

    Specification: geomsearch/2d_moving_penetration:pl_test3q

    Design: PenetrationAux

  • F15.13

    The PenetrationAux object shall be capable of computing the distance, tangential distance, normal, closest point, side id, and element id between a flat and convex disjoint surfaces of a moving interface in 2D using a tangential tolerance of for the distance.

    Specification: geomsearch/2d_moving_penetration:pl_test3tt

    Design: PenetrationAux

  • F15.14

    The PenetrationAux object shall be capable of computing the distance, tangential distance, normal, closest point, side id, and element id between a flat and convex disjoint surfaces of a moving interface in 2D using a tangential tolerance of for the distance and second order elements.

    Specification: geomsearch/2d_moving_penetration:pl_test3qtt

    Design: PenetrationAux

  • F15.15

    The PenetrationAux object shall be capable of computing the distance, tangential distance, normal, closest point, side id, and element id between a flat and convex disjoint surfaces of a moving interface in 2D using normal smoothing for the distance.

    Specification: geomsearch/2d_moving_penetration:pl_test3ns

    Design: PenetrationAux

  • F15.16

    The PenetrationAux object shall be capable of computing the distance, tangential distance, normal, closest point, side id, and element id between a flat and convex disjoint surfaces of a moving interface in 2D using normal smoothing for the distance and second order elements.

    Specification: geomsearch/2d_moving_penetration:pl_test3qns

    Design: PenetrationAux

  • F15.17

    The PenetrationAux object shall be capable of computing the distance, tangential distance, normal, closest point, side id, and element id between a flat and convex disjoint surfaces of a moving interface in 2D using nodal normal based smoothing for the distance.

    Specification: geomsearch/2d_moving_penetration:pl_test3nns

    Design: PenetrationAux

  • F15.18

    The PenetrationAux object shall be capable of computing the distance, tangential distance, normal, closest point, side id, and element id between a flat and convex disjoint surfaces of a moving interface in 2D using nodal normal based smoothing for the distance and second order elements.

    Specification: geomsearch/2d_moving_penetration:pl_test3qnns

    Design: PenetrationAux

  • F15.19

    The PenetrationAux object shall be capable of computing the distance, tangential distance, normal, closest point, side id, and element id between a flat and concave disjoint surfaces of a moving interface in 2D.

    Specification: geomsearch/2d_moving_penetration:pl_test4

    Design: PenetrationAux

  • F15.20

    The PenetrationAux object shall be capable of computing the distance, tangential distance, normal, closest point, side id, and element id between a flat and concave disjoint surfaces of a moving interface in 2D using second order elements.

    Specification: geomsearch/2d_moving_penetration:pl_test4q

    Design: PenetrationAux

  • F15.21

    The PenetrationAux object shall be capable of computing the distance, tangential distance, normal, closest point, side id, and element id between a flat and concave disjoint surfaces of a moving interface in 2D using a tangential tolerance of for the distance.

    Specification: geomsearch/2d_moving_penetration:pl_test4tt

    Design: PenetrationAux

  • F15.22

    The PenetrationAux object shall be capable of computing the distance, tangential distance, normal, closest point, side id, and element id between a flat and concave disjoint surfaces of a moving interface in 2D using a tangential tolerance of for the distance and second order elements.

    Specification: geomsearch/2d_moving_penetration:pl_test4qtt

    Design: PenetrationAux

  • F15.23

    The PenetrationAux object shall be capable of computing the distance, tangential distance, normal, closest point, side id, and element id between a flat and concave disjoint surfaces of a moving interface in 2D using normal smoothing for the distance.

    Specification: geomsearch/2d_moving_penetration:pl_test4ns

    Design: PenetrationAux

  • F15.24

    The PenetrationAux object shall be capable of computing the distance, tangential distance, normal, closest point, side id, and element id between a flat and concave disjoint surfaces of a moving interface in 2D using normal smoothing for the distance and second order elements.

    Specification: geomsearch/2d_moving_penetration:pl_test4qns

    Design: PenetrationAux

  • F15.25

    The PenetrationAux object shall be capable of computing the distance, tangential distance, normal, closest point, side id, and element id between a flat and concave disjoint surfaces of a moving interface in 2D using nodal normal based smoothing.

    Specification: geomsearch/2d_moving_penetration:pl_test4nns

    Design: PenetrationAux

  • F15.26

    The PenetrationAux object shall be capable of computing the distance, tangential distance, normal, closest point, side id, and element id between a flat and concave disjoint surfaces of a moving interface in 2D using nodal normal based smoothing and second order elements.

    Specification: geomsearch/2d_moving_penetration:pl_test4qnns

    Design: PenetrationAux

  • F15.27

    The 'geomsearch/2d_moving_penetration/restart' shall create the necessary files for testing restart of the PenetrationAux object.

    Specification: geomsearch/2d_moving_penetration:restart

    Design: PenetrationAux

  • F15.28

    The PenetrationAux object shall be capable of restarting from a previous simulation.

    Specification: geomsearch/2d_moving_penetration:restart2

    Design: PenetrationAux

    Prerequisites: F15.27

  • F15.29

    The PenetrationAux object shall compute the distance between two boundaries in 3D that overlap.

    Specification: geomsearch/penetration_locator:test

    Design: PenetrationAux

  • F15.30

    The PenetrationAux object shall compute, in parallel, the distance between two boundaries in 3D that overlap.

    Specification: geomsearch/penetration_locator:parallel_test

    Design: PenetrationAux

    Prerequisites: F15.29 F15.31 F15.38 F15.40 F15.56 F15.57 F15.59

  • F15.31

    The PenetrationAux object shall be capable of computing the distance, tangential distance, normal, closest point, side id, and element id between two parallel, overlapping surfaces in 3D.

    Specification: geomsearch/3d_penetration_locator:test

    Design: PenetrationAux

  • F15.32

    The PenetrationAux object shall be capable of computing the distance, tangential distance, normal, closest point, side id, and element id between two parallel, disjoint surfaces in 2D with tetrahedron elements.

    Specification: geomsearch/3d_penetration_locator:3d_tet

    Design: PenetrationAux

  • F15.33

    MOOSE shall support a means for updating the geometric search patch dynamically that may be disabled.

    Specification: geomsearch/patch_update_strategy:never

    Design: GapValueAuxMesh System

    Issues: #3901

  • F15.34

    MOOSE shall support a means for updating the geometric search patch dynamically that automatically determines when an update to the patch shall occur.

    Specification: geomsearch/patch_update_strategy:auto

    Design: GapValueAuxMesh System

    Issues: #3901

  • F15.35

    MOOSE shall support a means for updating the geometric search patch dynamically that updates the patch prior to each solve.

    Specification: geomsearch/patch_update_strategy:always

    Design: GapValueAuxMesh System

    Issues: #3901

  • F15.36

    MOOSE shall support a means for updating the geometric search patch dynamically that updates the patch prior to each iteration.

    Specification: geomsearch/patch_update_strategy:nonlinear_iter

    Design: GapValueAuxMesh System

    Issues: #3901

    Prerequisites: F15.35

  • F15.37

    The MOOSE penetration locator system shall error if penetration is not detected.

    Specification: geomsearch/patch_update_strategy:never_warning

    Design: GapValueAuxMesh System

    Issues: #3901

    Prerequisites: F15.33

  • F15.38

    The PenetrationAux object shall be capable of computing the distance, tangential distance, normal, closest point, side id, and element id between two parallel, overlapping surfaces in 2D.

    Specification: geomsearch/2d_penetration_locator:test

    Design: PenetrationAux

  • F15.39

    The PenetrationAux object shall be capable of computing the distance, tangential distance, normal, closest point, side id, and element id between two parallel, disjoint surfaces in 2D with triangular elements.

    Specification: geomsearch/2d_penetration_locator:2d_triangle

    Design: PenetrationAux

  • F15.40

    MOOSE shall be capable of computing the distance between two disjoint boundaries on a 1D domain.

    Specification: geomsearch/1d_penetration_locator:test

    Design: PenetrationAux

    Issues: #1693

  • F15.41

    The NearestNodeDistanceAux object shall compute the shortest distance between nodes on two overlapping boundaries using a constant monomial auxiliary variable.

    Specification: geomsearch/quadrature_nearest_node_locator:qnnl

    Design: NearestNodeDistanceAux

  • F15.42

    The PenetrationAux object shall be capable of computing the distance, tangential distance, normal, closest point, side id, and element id between two parallel, disjoint surfaces of a moving interface in 3D.

    Specification: geomsearch/3d_moving_penetration:pl_test1

    Design: PenetrationAux

  • F15.43

    The PenetrationAux object shall be capable of computing the distance, tangential distance, normal, closest point, side id, and element id between two parallel, disjoint surfaces of a moving interface in 3D using second order elements.

    Specification: geomsearch/3d_moving_penetration:pl_test1q

    Design: PenetrationAux

  • F15.44

    The PenetrationAux object shall be capable of computing the distance, tangential distance, normal, closest point, side id, and element id between two parallel, disjoint surfaces of a moving interface in 3D using a tangential tolerance of for the distance.

    Specification: geomsearch/3d_moving_penetration:pl_test1tt

    Design: PenetrationAux

  • F15.45

    The PenetrationAux object shall be capable of computing the distance, tangential distance, normal, closest point, side id, and element id between two parallel, disjoint surfaces of a moving interface in 3D using a tangential tolerance of for the distance and second order elements.

    Specification: geomsearch/3d_moving_penetration:pl_test1qtt

    Design: PenetrationAux

  • F15.46

    The PenetrationAux object shall be capable of computing the distance, tangential distance, normal, closest point, side id, and element id between two parallel, overlapping surfaces of a moving interface in 3D.

    Specification: geomsearch/3d_moving_penetration:pl_test2

    Design: PenetrationAux

  • F15.47

    The PenetrationAux object shall be capable of computing the distance, tangential distance, normal, closest point, side id, and element id between two parallel, overlapping surfaces of a moving interface in 3D with second order elements.

    Specification: geomsearch/3d_moving_penetration:pl_test2q

    Design: PenetrationAux

  • F15.48

    The PenetrationAux object shall be capable of computing the distance, tangential distance, normal, closest point, side id, and element id between two parallel, overlapping surfaces of a moving interface in 3D using a tangential tolerance for the distance.

    Specification: geomsearch/3d_moving_penetration:pl_test2tt

    Design: PenetrationAux

  • F15.49

    The PenetrationAux object shall be capable of computing the distance, tangential distance, normal, closest point, side id, and element id between two parallel, overlapping surfaces of a moving interface in 3D using a tangential tolerance for the distance and second order elements.

    Specification: geomsearch/3d_moving_penetration:pl_test2qtt

    Design: PenetrationAux

  • F15.50

    The PenetrationAux object shall be capable of computing the distance, tangential distance, normal, closest point, side id, and element id between a flat and convex disjoint surfaces of a moving interface in 3D.

    Specification: geomsearch/3d_moving_penetration:pl_test3

    Design: PenetrationAux

  • F15.51

    The PenetrationAux object shall be capable of computing the distance, tangential distance, normal, closest point, side id, and element id between a flat and convex disjoint surfaces of a moving interface in 3D and second order elements.

    Specification: geomsearch/3d_moving_penetration:pl_test3q

    Design: PenetrationAux

  • F15.52

    The PenetrationAux object shall be capable of computing the distance, tangential distance, normal, closest point, side id, and element id between a flat and convex disjoint surfaces of a moving interface in 3D using a tangential tolerance of for the distance and second order elements.

    Specification: geomsearch/3d_moving_penetration:pl_test3tt

    Design: PenetrationAux

  • F15.53

    The PenetrationAux object shall be capable of computing the distance, tangential distance, normal, closest point, side id, and element id between a flat and concave disjoint surfaces of a moving interface in 3D.

    Specification: geomsearch/3d_moving_penetration:pl_test4

    Design: PenetrationAux

  • F15.54

    The PenetrationAux object shall be capable of computing the distance, tangential distance, normal, closest point, side id, and element id between a flat and concave disjoint surfaces of a moving interface in 3D using second order elements.

    Specification: geomsearch/3d_moving_penetration:pl_test4q

    Design: PenetrationAux

  • F15.55

    The PenetrationAux object shall be capable of computing the distance, tangential distance, normal, closest point, side id, and element id between a flat and concave disjoint surfaces of a moving interface in 3D using a tangential tolerance of for the distance.

    Specification: geomsearch/3d_moving_penetration:pl_test4tt

    Design: PenetrationAux

  • F15.56

    MOOSE shall be capable of computing the distance as well as transfer data between interior boundaries on a 2D domain.

    Specification: geomsearch/2d_interior_boundary_penetration_locator:test

    Design: PenetrationAuxGapValueAux

  • F15.57

    The NearestNodeDistanceAux shall be capable of computing the shortest distance between two boundaries.

    Specification: geomsearch/nearest_node_locator:test

    Design: NearestNodeDistanceAux

    Issues: #1570

  • F15.58

    The NearestNodeDistanceAux shall be capable of computing the shortest distance between two boundaries with adaptivity.

    Specification: geomsearch/nearest_node_locator:adapt

    Design: NearestNodeDistanceAux

    Issues: #1570

  • F15.59

    The NearestNodeDistanceAux object shall be capable of computing the shortest distance between a boundary and subdomain.

    Specification: geomsearch/fake_block_to_boundary:test

    Design: NearestNodeDistanceAux

    Issues: #3964