Foundations of Software Science and Computational Structures
Editat de Andrew D. Gordonen Limba Engleză Paperback – 14 mar 2003
Preț: 330.36 lei
Preț vechi: 412.95 lei
-20%
Puncte Express: 496
Carte tipărită la comandă
Livrare economică 18 iulie-01 august
Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit de la 400.00 lei Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
Specificații
ISBN-13: 9783540008972
ISBN-10: 3540008977
Pagini: 460
Ilustrații: XII, 444 p.
Dimensiuni: 155 x 235 x 25 mm
Greutate: 0.69 kg
Ediția:2003
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540008977
Pagini: 460
Ilustrații: XII, 444 p.
Dimensiuni: 155 x 235 x 25 mm
Greutate: 0.69 kg
Ediția:2003
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Invited Paper.- A Game Semantics for Generic Polymorphism.- Contributed Papers.- Categories of Containers.- Verification of Probabilistic Systems with Faulty Communication.- Generalized Iteration and Coiteration for Higher-Order Nested Datatypes.- Ambiguous Classes in the Games ?-Calculus Hierarchy.- Parameterized Verification by Probabilistic Abstraction.- Genericity and the ?-Calculus.- Model Checking Lossy Channels Systems Is Probably Decidable.- Verification of Cryptographic Protocols: Tagging Enforces Termination.- A Normalisation Result for Higher-Order Calculi with Explicit Substitutions.- When Ambients Cannot Be Opened.- Computability over an Arbitrary Structure. Sequential and Parallel Polynomial Time.- An Intrinsic Characterization of Approximate Probabilistic Bisimilarity.- Manipulating Trees with Hidden Labels.- The Converse of a Stochastic Relation.- Type Assignment for Intersections and Unions in Call-by-Value Languages.- Cones and Foci for Protocol Verification Revisited.- Towards a Behavioural Theory of Access and Mobility Control in Distributed Systems.- The Two-Variable Guarded Fragment with Transitive Guards Is 2EXPTIME-Hard.- A Game Semantics of Linearly Used Continuations.- Counting and Equality Constraints for Multitree Automata.- Compositional Circular Assume-Guarantee Rules Cannot Be Sound and Complete.- A Monadic Multi-stage Metalanguage.- Multi-level Meta-reasoning with Higher-Order Abstract Syntax.- Abstraction in Reasoning about Higraph-Based Systems.- Deriving Bisimulation Congruences: 2-Categories Vs Precategories.- On the Structure of Inductive Reasoning: Circular and Tree-Shaped Proofs in the ?Calculus.