Julien Schmaltz – författare

This undergraduate textbook first introduces basic electronic circuitry before explaining more advanced elements such as the Arithmetic Logic Unit, sequential circuits, and finally microprocessors. In keeping with this integrated and graduated approach, the authors then explain the relationship to first assembly programming, then higher-level languages, and finally computer organisation. Authors use the Raspberry Pi and ARM microprocessors for their explanationsThe material has been extensively class tested at TU Eindhoven by an experienced team of lecturers and researchers. This is a modern, holistic treatment of well-established topics, valuable for undergraduate students of computer science and electronics engineering and for self-study. The authors use the Raspberry Pi and ARM microprocessors for their explanations.

This undergraduate textbook first introduces basic electronic circuitry before explaining more advanced elements such as the Arithmetic Logic Unit, sequential circuits, and finally microprocessors. In keeping with this integrated and graduated approach, the authors then explain the relationship to first assembly programming, then higher-level languages, and finally computer organisation. Authors use the Raspberry Pi and ARM microprocessors for their explanationsThe material has been extensively class tested at TU Eindhoven by an experienced team of lecturers and researchers. This is a modern, holistic treatment of well-established topics, valuable for undergraduate students of computer science and electronics engineering and for self-study. The authors use the Raspberry Pi and ARM microprocessors for their explanations.

This book constitutes the refereed proceedings of the Second International Conference on Interactive Theorem proving, ITP 2011, held in Berg en Dal, The Netherlands, in August 2011. The 25 revised full papers presented were carefully reviewed and selected from 50 submissions. Among the topics covered are counterexample generation, verification, validation, term rewriting, theorem proving, computability theory, translations from one formalism to another, and cooperation between tools. Several verification case studies were presented, with applications to computational geometry, unification, real analysis, etc.