From Logic to Theoretical Computer Science – An Update -- Reminiscences -- Boris A. Trakhtenbrot: Academic Genealogy and Publications -- Symmetric Logic of Proofs -- Synthesis of Monitors for Real-Time Analysis of Reactive Systems -- A Framework for Formalizing Set Theories Based on the Use of Static Set Terms -- Effective Finite-Valued Approximations of General Propositional Logics -- Model Transformation Languages and Their Implementation by Bootstrapping Method -- Modal Fixed-Point Logic and Changing Models -- Fields, Meadows and Abstract Data Types -- Why Sets? -- The Church-Turing Thesis over Arbitrary Domains -- Generalized Categorial Dependency Grammars -- Temporal Verification of Probabilistic Multi-Agent Systems -- Linear Recurrence Relations for Graph Polynomials -- Artin’s Conjecture and Size of Finite Probabilistic Automata -- Introducing Reactive Kripke Semantics and Arc Accessibility -- On Partially Wellfounded Generic Ultrapowers -- Some Results on the Expressive Power and Complexity of LSCs -- Finite Dimensional Vector Spaces Are Complete for Traced Symmetric Monoidal Categories -- Tree Automata over Infinite Alphabets -- Connectives in Cumulative Logics -- Reasoning in Dynamic Logic about Program Termination -- The Grace of Quadratic Norms: Some Examples -- Nested Petri Nets for Adaptive Process Modeling -- Checking Temporal Properties of Discrete, Timed and Continuous Behaviors -- Token-Free Petri Nets -- Proof Search Tree and Cut Elimination -- Symbolic Verification Method for Definite Iterations over Tuples of Altered Data Structures and Its Application to Pointer Programs -- Categories of Elementary Sets over Algebras and Categories of Elementary Algebraic Knowledge -- Selection and Uniformization Problems in the Monadic Theory of Ordinals: A Survey -- The Scholten/Dijkstra Pebble Game Played Straightly, Distributedly, Online and Reversed -- The Reaction Algebra: A Formal Language for Event Correlation -- On Natural Non-dcpo Domains -- Church’s Problem and a Tour through Automata Theory -- From Monadic Logic to PSL.

This festschrift volume is dedicated to Boris (Boaz) Trakhtenbrot on the occasion of his 85th birthday. For over half a century, Trakhtenbrot has been making seminal contributions to virtually all of the central areas of theoretical computer science. He is universally admired as a founding father and long-standing pillar of the discipline of computer science. On Friday, 28 April 2006, the School of Computer Science at Tel Aviv University held a “Computation Day Celebrating Boaz (Boris) Trakhtenbrot's Eighty-Fifth Birthday”. As a follow-up to that event, his students and colleagues were asked to contribute to a volume in his honor and in recognition of his grand contributions to the field. The book opens with two historical overviews and a bibliography. These are followed by 33 thoroughly reviewed technical contributions. The broad range of topics covered include mathematical logic, logics for computer science, mathematics for computer science, automata and formal languages, asynchronous computation, semantics of programming languages, verification, and software engineering. This tapestry of subjects stands as testimony to the vast scope of Trakhtenbrot's achievements and the profound influence he has had on the field.