Foundations of Software Science and Computational Structures de Andrew D. Gordon

Foundations of Software Science and Computational Structures: Lecture Notes in Computer Science

Andrew D. Gordon

en Limba Engleză Paperback – 14 mar 2003

These refereed proceedings of the 6th International Conference on Foundations of Software Science and Computation Structures, include: algebraic models; automata and language theory; behavioral equivalences; categorical models; and computation processes over discrete and continuous data.

Citește tot Restrânge

Din seria Lecture Notes in Computer Science

20%

Preț: 400^.77 lei
20%

Preț: 754^.11 lei
20%

Preț: 324^.19 lei
20%

Preț: 373^.80 lei
20%

Preț: 342^.61 lei
20%

Preț: 403^.00 lei
20%

Preț: 573^.45 lei
Preț: 395^.25 lei
20%

Preț: 487^.46 lei
20%

Preț: 355^.27 lei
20%

Preț: 731^.97 lei
20%

Preț: 293^.24 lei
20%

Preț: 669^.21 lei
20%

Preț: 984^.64 lei
20%

Preț: 620^.33 lei
20%

Preț: 336^.86 lei
20%

Preț: 330^.54 lei
20%

Preț: 313^.87 lei
20%

Preț: 679^.09 lei
20%

Preț: 373^.16 lei
20%

Preț: 782^.57 lei
20%

Preț: 434^.17 lei
20%

Preț: 489^.11 lei
20%

Preț: 904^.16 lei
20%

Preț: 375^.72 lei
20%

Preț: 400^.17 lei
20%

Preț: 432^.78 lei
20%

Preț: 631^.96 lei
20%

Preț: 432^.11 lei
20%

Preț: 1359^.66 lei
20%

Preț: 556^.96 lei
20%

Preț: 488^.90 lei
20%

Preț: 560^.93 lei
20%

Preț: 327^.36 lei
20%

Preț: 340^.04 lei
20%

Preț: 327^.36 lei
20%

Preț: 328^.94 lei
20%

Preț: 629^.71 lei
20%

Preț: 568^.70 lei
20%

Preț: 447^.31 lei
20%

Preț: 733^.68 lei
20%

Preț: 315^.26 lei
20%

Preț: 315^.62 lei
20%

Preț: 1020^.28 lei
20%

Preț: 850^.42 lei
20%

Preț: 1391^.87 lei
20%

Preț: 519^.32 lei

Cuprins

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.