&gt; If the machine is two&#x27;s complement (which is the vast majority of them), then you&#x27;d expect that behaviour. If it&#x27;s sign-magnitude or one&#x27;s complement or saturating, then the behaviour would be different but still consistent.<p>How is this different in practice from undefined behavior, other than the compiler can&#x27;t take advantage of it for optimizations?