Angielski
Interactive theorem proving is the modern way of formalizingmathematics using a computer as a proof assistant, helping solvesimple tasks and keeping an order on the proofs. Still, it is atedious task, as such mechanical proofs contain detail that humansdo not want to see. When it comes to the verification of real worldapplications in software engineering, as required for the assuranceof safety and security properties of embedded systems, the level ofdetail becomes even more annoying. In fact, it is a gargantuan taskto prove a program correct or prove that an implementation conformsto its UML-specification. The sheer mass of proof obligations alone- apart from the hidden subtlety of such challenges - obstructsquality assurance of software artifacts with interactive theoremprovers. This book draws a line to show up how far current cuttingedge research has succeeded in tackling this long standing quest.Using examples from algorithm development, Java bytecodeverification and UML state machine analysis the author introducescurrent trends in interactive theorem proving technology using Coq,Isabelle, and model checking.
