Cantitate/Preț
Produs

Computer Science Logic: 20th International Workshop, CSL 2006, 15th Annual Conference of the EACSL, Szeged, Hungary, September 25-29, 2006, Proceedings: Lecture Notes in Computer Science, cartea 4207

Editat de Zoltán Ésik
en Limba Engleză Paperback – 20 sep 2006

Din seria Lecture Notes in Computer Science

Preț: 63818 lei

Preț vechi: 79773 lei
-20% Nou

Puncte Express: 957

Preț estimativ în valută:
12212 12902$ 10210£

Carte tipărită la comandă

Livrare economică 01-15 ianuarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540454588
ISBN-10: 3540454586
Pagini: 644
Ilustrații: XII, 627 p.
Dimensiuni: 155 x 235 x 34 mm
Greutate: 0.91 kg
Ediția:2006
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

Invited Presentations.- Functorial Boxes in String Diagrams.- Some Results on a Game-Semantic Approach to Verifying Finitely-Presentable Infinite Structures (Extended Abstract).- Automata and Logics for Words and Trees over an Infinite Alphabet.- Nonmonotonic Logics and Their Algebraic Foundations.- Contributions.- Semi-continuous Sized Types and Termination.- Visibly Pushdown Automata: From Language Equivalence to Simulation and Bisimulation.- A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata.- The Power of Linear Functions.- Logical Omniscience Via Proof Complexity.- Verification of Ptime Reducibility for System F Terms Via Dual Light Affine Logic.- MSO Queries on Tree Decomposable Structures Are Computable with Linear Delay.- Abstracting Allocation.- Collapsibility in Infinite-Domain Quantified Constraint Satisfaction.- Towards an Implicit Characterization of NC k .- On Rational Trees.- Reasoning About States of Probabilistic Sequential Programs.- Concurrent Games with Tail Objectives.- Nash Equilibrium for Upward-Closed Objectives.- Algorithms for Omega-Regular Games with Imperfect Information.- Relating Two Standard Notions of Secrecy.- Jump from Parallel to Sequential Proofs: Multiplicatives.- First-Order Queries over One Unary Function.- Infinite State Model-Checking of Propositional Dynamic Logics.- Weak Bisimulation Approximants.- Complete Problems for Higher Order Logics.- Solving Games Without Determinization.- Game Quantification on Automatic Structures and Hierarchical Model Checking Games.- An Algebraic Point of View on the Crane Beach Property.- A Sequent Calculus for Type Theory.- Universality Results for Models in Locally Boolean Domains.- Universal Structures and the Logic of Forbidden Patterns.- On the Expressive Power ofGraph Logic.- Hoare Logic in the Abstract.- Normalization of IZF with Replacement.- Acyclicity and Coherence in Multiplicative Exponential Linear Logic.- Church Synthesis Problem with Parameters.- Decidable Theories of the Ordering of Natural Numbers with Unary Predicates.- Separation Logic for Higher-Order Store.- Satisfiability and Finite Model Property for the Alternating-Time ?-Calculus.- Space-Efficient Computation by Interaction.- The Ackermann Award 2006.