These are word's examples related to soundness. Click on any word to go to its word's detail page. Or, go to the definition of soundness.
The main result of this subsection follows as an immediate corollary of the soundness of the typing system.
The tool's soundness theorem is expressed in terms of the bit-level semantics of x86 programs, so its correctness depends on very few assumptions.
If the system in figure 4 is operationally correct then, because of the soundness theorem above, the system in figure 3 is operationally correct.
We show that the system enjoys properties like type uniqueness, subject reduction, soundness, confluence, and weak normalization.
Section 5 then proves soundness (but not completeness) in the general case where predicates in contracts may diverge.
The addition of recursive contracts has far-reaching implications, deeply affecting the formulation of our model and requiring different techniques for proving soundness.
The following results are required by the proof of the soundness theorem below.
We are interested in the soundness and conservativity issues these features raise: can we ensure modularity features do not lead to inconsistencies?
Our proof (sections 4 and 5) is short, but not as straightforward as those of soundness and conservativity.
In this section, we describe how this executable model has been used to check the soundness of polymorphic inference rules by calculation.
We give dynamic and static semantics for the language, and prove the soundness of the type system.
Therefore, soundness and completeness alone are insufficient for proving that the considered calculus provides an internal language of the complete models.
The following theorem shows the soundness of substitution.
We will establish that these processes are in fact bisimilar and then, by soundness, we may conclude that they are contextual observational equivalent.
We present a new soundness proof for their logic using denotational semantics.
