Sentence examples for verifying properties from inspiring English sources

In the second part of the dissertation, we address the problem of formally verifying properties of the execution behavior of Convex-MDPs.

We prove that plan execution is indistinguishable from atomic reconfiguration and use this fact for state-space reduction for verifying properties by model checking.

Model checking is an automatic technique for verifying properties of finite concurrent systems on a structure that represents the states of the system; the crucial point of the technique is to avoid the computation of all the possible states.

Therefore, in designing and implementing such an architecture, it is important to accurately describe its structure, components, and their interactions; and we should also provide support for verifying properties that the architecture must satisfy.

The four main ingredients of the methodology are: (1) The inclusion of behaviour specifications in component interfaces, (2) a simple, high-level notation for expressing adaptor specifications, (3) a fully automated procedure to derive concrete adaptors from given high-level specifications, and (4) an effective technique for verifying properties of adaptors.

Another example is the parity games which are used for verifying properties of modal systems.

We define the NAD-border of U as the set of roots of the maximum subtrees of U verifying Property ONLY-NAD, and the AD-border of U as the set of roots of the maximum subtrees of U verifying Property ONLY-AD.

We then formally verify properties of the model expressed in PCTL.

By avoiding the need to verify properties globally, significant computational savings can be achieved.

This transformation helps the software designers to analyze and verify properties.

We automatically generate Java monitors from the concurrency controller specifications which preserve the verified properties.