Logic And Software Engineering Proceedings Of The International Workshop In Honor Of Chih Sung Tang

With 14 chapters written by leading experts and educators, this book covers a wide range of topics from teaching philosophy and curriculum development to symbolic and algebraic manipulation and automated geometric reasoning, and to the design and implementation of educational software and integrated teaching and learning environments. The book may serve as a useful reference for researchers, educators, and other professionals interested in developing, using, and practising methodologies and software tools of symbolic computation for education from the secondary to the undergraduate level.

This book presents comprehensive studies on nine specification languages and their logics of reasoning. The editors and authors are authorities on these specification languages and their application. In a unique feature, the book closes with short commentaries on the specification languages written by researchers closely associated with their original development. The book contains extensive references and pointers to future developments.

A comprehensive introduction to interval logic and duration calculus for modelling, analysing and verifying real-time systems. The Duration Calculus (DC) represents a logical approach to formal design of real-time systems. In DC real numbers are used to model time and Boolean-valued (i.e. {0,1}-valued) functions over time to model states of real-time systems. The duration of a state in a time interval is the accumulated presence time of the state in the interval. DC extends interval logic to a calculus to specify and reason about properties of state durations. The text covers theory (completeness, decidability, undecidability, model-checking), results, as well as case studies (Deadline Driven Scheduler).

The latest edition of the essential text and professional reference, with substantial new material on such topics as vEB trees, multithreaded algorithms, dynamic programming, and edge-based flow. Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely combines rigor and comprehensiveness. The book covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively self-contained and can be used as a unit of study. The algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor. The first edition became a widely used text in universities worldwide as well as the standard reference for professionals. The second edition featured new chapters on the role of algorithms, probabilistic analysis and randomized algorithms, and linear programming. The third edition has been revised and updated throughout. It includes two completely new chapters, on van Emde Boas trees and multithreaded algorithms, substantial additions to the chapter on recurrence (now called “Divide-and-Conquer”), and an appendix on matrices. It features improved treatment of dynamic programming and greedy algorithms and a new notion of edge-based flow in the material on flow networks. Many exercises and problems have been added for this edition. The international paperback edition is no longer available; the hardcover is available worldwide.