- ホーム
- > 洋書
- > 英文書
- > Computer / General
Full Description
The Person 1 Boris Abramovich Trakhtenbrot (????? ????????? ???????????) - his Hebrew given name is Boaz ( ) - is universally admired as a founding - ther and long-standing pillar of the discipline of computer science. He is the ?eld's preeminent distinguished researcher and a most illustrious trailblazer and disseminator. He is unmatched in combining farsighted vision, unfaltering c- mitment, masterful command of the ?eld, technical virtuosity, aesthetic expr- sion, eloquent clarity, and creative vigor with humility and devotion to students and colleagues. For over half a century, Trakhtenbrot has been making seminal contributions to virtually all of the central aspects of theoretical computer science, inaugur- ing numerous new areas of investigation. He has displayed an almost prophetic ability to foresee directions that are destined to take center stage, a decade or morebeforeanyoneelsetakesnotice.Hehasneverbeentempted toslowdownor limithisresearchtoareasofendeavorinwhichhehasalreadyearnedrecognition and honor. Rather, he continues to probe the limits and position himself at the vanguard of a rapidly developing ?eld, while remaining, as always, unassuming and open-minded.
Contents
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/DijkstraPebble 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.
