Else. 6.1. Get the outgoing followed by relation (where the Current Node is the source of it)
Else. 7.2.1. Add the Current Node to beginning of “nodes to be parsed”
Else. In case the force majeure or its influence continue more than 90 days, and the resumption of this Agreement is possible, both parties shall be entitled to relevant reviewing rights under preceding paragraph.
Else. 12. Give verdict fail when InF(σ), and pass otherwise.
Else. 20. Give verdict fail when InF(σ), and pass otherwise. The above algorithm shares the base case (1) with the algorithm of Def. 8: it can terminate at any moment and give the verdict pass. Differently from the algorithm of Def. 8, before sending an input to the SUT (in case (2)), first a set of input constraints for C is computed (line 02). This is a set of first order formulas specifying under which conditions certain data can be sent over one of the input gates. The input constraints in fact represent a subset of the possibly infinite set of inputs. The input constraint and the stimulus that are subsequently chosen in line 03 serve to identify an appropriate input w, which is sent over gate λ in line 04. The algorithm then proceeds with the calculation of a new set of instantiated locations (line 05), sets the new suspension trace, and continues with these new parameters, line 06. When observing quiescence of the SUT (case (3), line 07), we first check whether this is actually specified behaviour (lines 08 – 10) or not (lines 11 – 12). In the first case, the algorithm continues with the newly obtained set of instantiated locations and suspension trace. In the latter case, we assign the verdict fail when the executed trace was an element of F, and pass otherwise. If the SUT actually produces an output (case (3), line 14), we receive a data value w over an output gate λ. To facilitate reasoning about this data value, we first find a corresponding mapping to ground terms η (line 15). Note that this η represents the actual, concrete values that are passed over the gate λ. Next, in line 16, the new set of instantiated locations found after observing reaction (λ, η), is computed. Note that since η represents the concrete values for the interaction variables, and due to the restrictions we pose on STSs, this new set of instantiated locations is finite. In line 17, it is tested whether the observed output was allowed, and if so, testing is continued with the new set in line 18. When the observed output is not allowed (line 19), we assign the verdict fail or pass, dependent on whether the trace we executed thus far was part of F. Note that the meaning of pass in lines 12 and 20 corresponds more to an inconclusive verdict (see also [7]). However, this verdict is currently not part of our test case definition. Next we state the correctness and completeness of the algorithm above. That means that we have not lost any detection power compared to the (infeasible) algor...
Else. End If oAddressMap = Nothing Return 1 ' Domain add failed! Return 0 Else End If ' Domain already exists! Return 0 End If End Function Removing: Public Function RemoveDomain() As Integer Dim oDomain As New MailEnable.Administration.Domain Dim sPostoffice As String = "MailEnable" Dim sDomainName As String = "TestDomain" oDomain.AccountName = sPostoffice oDomain.DomainName = sDomainName oDomain.Status = -1 oDomain.DomainRedirectionHosts = "" oDomain.DomainRedirectionStatus = -1 If oDomain.RemoveDomain() = 1 Then ' Domain removed successfully Return 1 Else ' Domain removal failed Return 0 End If End Function
