Some theoretical aspects of verification (with a focus on bisimilarity)
Some theoretical aspects of verification (with a focus on bisimilarity)
Some theoretical aspects of verification (with a focus on bisimilarity)
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
Undecidability, incompleteness (<str<strong>on</strong>g>of</str<strong>on</strong>g> arithmetic)<br />
Gödel in 1931 .... incompleteness<br />
(Every formal system able to express arithmetic (i.e., theory N) ...)<br />
Alan Turing (1913-1954), Al<strong>on</strong>zo Church (1903-1995)<br />
1936 ... Turing machines, λ-calculus,<br />
a stable noti<strong>on</strong> <str<strong>on</strong>g>of</str<strong>on</strong>g> computable functi<strong>on</strong>s (Church-Turing thesis)<br />
(also undecidability <str<strong>on</strong>g>of</str<strong>on</strong>g> (validity in) first order logic; thus<br />
answering negatively the questi<strong>on</strong> stated by Hilbert and<br />
Ackermann)<br />
Petr Jančar (TU Ostrava) <str<strong>on</strong>g>Some</str<strong>on</strong>g> <str<strong>on</strong>g>aspects</str<strong>on</strong>g> <str<strong>on</strong>g>of</str<strong>on</strong>g> <str<strong>on</strong>g>verificati<strong>on</strong></str<strong>on</strong>g><br />
Kolloquium Jena, 14 May 2007 21 /<br />
89
Change language