... if (B1) { S1; } if (B1) { S1; } if (B2) { S2; } - - ...exp... int x = 1; if (x == 1) { std::cout << "Okay" << std::endl; } else { std::cout << "Error" << std::endl; } -- ґ int strlen(const char* p) { int len = 0; do { ++len; } while (*p++); return len; } ??, ?bbb? -- , : Ї ґ , , Ї ґ , , Ї ґ , Ї ґ . ... 1977 ґ LTL, Ї , 1981 ґ (CTL), Ї , , 1981 , , 1982 ґ model checking ( ), Ї , 1986 ґ model checking ( ), Ї , 1989 ґ SPIN. ... The Spin Model Checker: Primer and Reference Manual, Addison Wesley, 2003. ...

Еще в разделе: (Показать все результаты (>4) - savenkov.lvk.cs.msu.su/ )

The beamer class Manual for version 3.06. \begin{frame} \frametitle{There Is No Largest Prime Number} \framesubtitle{The proof uses \textit{reductio ad absurdum}.} \begin{theorem} There is no largest prime number. \end{theorem} \begin{proof} \begin{enumerate} \item<1-| alert@1> Suppose $p$ were the largest prime number. \item<2-> Let $q$ be the product of the first $p$ numbers. \item<3-> Then $q+1$ is not divisible by any of them. \item<1-> Thus $q+1$ is also prime and greater than $p$.\qedhere

364. Index of /tomilin