Pillars of Computer Science
Springer Berlin (Verlag)
978-3-540-78126-4 (ISBN)
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, æsthetic 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.
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.
From the reviews:
"This festschrift is dedicated to Boris Trakhtenbrot on the occasion of his 85th birthday. ... The volume covers a wide variety of papers on logic and the foundations of theoretical computer science, written by top people in the field. It is certainly worth acquiring for a library." (K. Lodaya, ACM Computing Reviews, January, 2009)
| Erscheint lt. Verlag | 8.2.2008 |
|---|---|
| Reihe/Serie | Lecture Notes in Computer Science | Theoretical Computer Science and General Issues |
| Zusatzinfo | XXI, 683 p. |
| Verlagsort | Berlin |
| Sprache | englisch |
| Maße | 155 x 235 mm |
| Gewicht | 1074 g |
| Themenwelt | Informatik ► Theorie / Studium ► Algorithmen |
| Informatik ► Theorie / Studium ► Künstliche Intelligenz / Robotik | |
| Mathematik / Informatik ► Mathematik ► Analysis | |
| Schlagworte | adaptive process modeling • Algorithm analysis and problem complexity • arithmetic • Automat • Automata • Automata Theory • Compiler • Computational Logic • Computer • Computer Science • Concurrency Models • cumulative logics • Distributed Systems • event correlation • event filtering • event notification • Finite model theory • formal language • Formal Languages • formal methods • Intuitionistic Logic • Logic • logic of proofs • Mathematical Logic • Multi-agent Systems • Petri Nets • probabilistic automata • programming • Programming language • provability predicate • publish-subscribe systems • reactive programming • real-time analysis • set theory • system specifications • transformation languages • Tree automata • verification |
| ISBN-10 | 3-540-78126-9 / 3540781269 |
| ISBN-13 | 978-3-540-78126-4 / 9783540781264 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
