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 Ésiken Limba Engleză Paperback – 20 sep 2006
Din seria Lecture Notes in Computer Science
- 20% Preț: 1061.55 lei
- 20% Preț: 307.71 lei
- 20% Preț: 438.69 lei
- 20% Preț: 579.30 lei
- Preț: 410.88 lei
- 17% Preț: 427.22 lei
- 20% Preț: 596.46 lei
- 15% Preț: 448.04 lei
- 20% Preț: 353.50 lei
- Preț: 389.49 lei
- 20% Preț: 309.90 lei
- 20% Preț: 645.28 lei
- 20% Preț: 763.23 lei
- 15% Preț: 580.46 lei
- 20% Preț: 310.28 lei
- 20% Preț: 655.02 lei
- 20% Preț: 1183.14 lei
- 20% Preț: 340.32 lei
- Preț: 449.57 lei
- 20% Preț: 591.51 lei
- 18% Preț: 938.83 lei
- 20% Preț: 337.00 lei
- 20% Preț: 649.50 lei
- 20% Preț: 607.40 lei
- 20% Preț: 1414.79 lei
- 20% Preț: 1024.44 lei
- 20% Preț: 583.40 lei
- 20% Preț: 453.32 lei
- 20% Preț: 575.49 lei
- 20% Preț: 1075.26 lei
- 20% Preț: 585.88 lei
- 20% Preț: 825.93 lei
- 17% Preț: 360.20 lei
- 20% Preț: 763.23 lei
- 20% Preț: 340.32 lei
- 20% Preț: 504.58 lei
- 20% Preț: 369.13 lei
- 20% Preț: 580.93 lei
- 20% Preț: 343.62 lei
- 20% Preț: 350.21 lei
- 20% Preț: 583.40 lei
- 20% Preț: 583.40 lei
- 15% Preț: 438.59 lei
- 20% Preț: 341.95 lei
- 20% Preț: 238.01 lei
- 20% Preț: 538.30 lei
Preț: 663.29 lei
Preț vechi: 829.10 lei
-20% Nou
Puncte Express: 995
Preț estimativ în valută:
126.94€ • 137.83$ • 106.63£
126.94€ • 137.83$ • 106.63£
Carte tipărită la comandă
Livrare economică 22 aprilie-06 mai
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
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ă
ResearchCuprins
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.