Mordechai Ben-Ari – författare

Mathematical Logic for Computer Science is a mathematics textbook with theorems and proofs, but the choice of topics has been guided by the needs of computer science students. The method of semantic tableaux provides an elegant way to teach logic that is both theoretically sound and yet sufficiently elementary for undergraduates. To provide a balanced treatment of logic, tableaux are related to deductive proof systems.The logical systems presented are:- Propositional calculus (including binary decision diagrams);- Predicate calculus;- Resolution;- Hoare logic;- Z;- Temporal logic.Answers to exercises (for instructors only) as well as Prolog source code for algorithms may be found via the Springer London web site: http://www.springer.com/978-1-85233-319-5  

Mordechai Ben-Ari is an associate professor in the Department of Science Teaching of the Weizmann Institute of Science. He is the author of numerous textbooks on concurrency,programming languages and logic, and has developed software tools for teaching concurrency. In 2004, Ben-Ari received the ACM/SIGCSE Award for Outstanding Contributions to Computer Science Education.

Mathematical Logic for Computer Science is a mathematics textbook with theorems and proofs, but the choice of topics has been guided by the needs of students of computer science. The method of semantic tableaux provides an elegant way to teach logic that is both theoretically sound and easy to understand. The uniform use of tableaux-based techniques facilitates learning advanced logical systems based on what the student has learned from elementary systems.

The logical systems presented are: propositional logic, first-order logic, resolution and its application to logic programming, Hoare logic for the verification of sequential programs, and linear temporal logicfor the verification of concurrent programs.

The third edition has been entirely rewritten and includes new chapters on central topics of modern computer science: SAT solvers and model checking.

Principles of Spin is an introductory book, the only requirement is a background in programming. Spin models are written in the Promela language which is easily learned by students and programmers. Spin is easy to install and use.

The Spin model checker is not only a widely used professional tool but it is also a superb tool for teaching important concepts of computer science such as verification, concurrency and nondeterminism. The book introduces Spin-based software that the author has developed for teaching: jSpin - an integrated development environment for Spin; SpinSpider - uses output from Spin to automatically construct state diagrams of concurrent programs; VN is a tool for visualizing nondeterminism.

Complete programs will demonstrate each construct and concept and these programs will be available on a companion website.

Ada is the programming language of choice for high integrity software systems and is used extensively in industries such as transportation and aerospace. Special features of the book include: Object-oriented programming, concurrency, and embedded and real-time systems are emphasized. Ada for Software Engineers explains the language concepts and the terminology of the standards document, the Ada Reference Manual (ARM). Extracts from the ARM are used throughtout and there are extensive cross references to the ARM. A comprehensive glossary and technical quizzes assist the reader in developing the ability to use the ARM as a practical reference. Comparisons with familiar languages like C and Java are given to facilitate the transition to Ada. The features of Ada 2005 are used routinely, but they are carefully identified, so that programmers using Ada 95 will also find the textbook useful. The companion website contains the full source code of nearly 100 case studies and 100 technical quizzes.