Pillars of Computer Science Essays Dedicated to Boris (Boaz) Trakhtenbrot on the Occasion of His 85th Birthday
by
 
Avron, Arnon. editor.

Title
Pillars of Computer Science Essays Dedicated to Boris (Boaz) Trakhtenbrot on the Occasion of His 85th Birthday

Author
Avron, Arnon. editor.

ISBN
9783540781271

Physical Description
online resource.

Series
Lecture Notes in Computer Science, 4800

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/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.

Subject Term
Computer science.
 
Information theory.
 
Computer software.
 
Electronic data processing.
 
Algorithms.
 
Theory of Computation.
 
Mathematical Logic and Formal Languages.
 
Algorithm Analysis and Problem Complexity.
 
Mathematics of Computing.
 
Computing Methodologies.

Added Author
Avron, Arnon.
 
Dershowitz, Nachum.
 
Rabinovich, Alexander.

Added Corporate Author
SpringerLink (Online service)

Electronic Access
http://dx.doi.org/10.1007/978-3-540-78127-1


LibraryMaterial TypeItem BarcodeShelf NumberStatus
IYTE LibraryE-Book503326-1001QA75.5 -76.95Online Springer