Foundations of Software Science and Computation Structures: 19th International Conference, FOSSACS 2016, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2016, Eindhoven, The Netherlands, April 2-8, 2016, Proceedings: Lecture Notes in Computer Science, cartea 9634
Editat de Bart Jacobs, Christof Lödingen Limba Engleză Paperback – 23 mar 2016
The 31 full papers presented in this volume werecarefully reviewed and selected from 85 submissions. They were organized intopical sections named: types; recursion and fixed-points; verification andprogram analysis; automata, logic, games; probabilistic and timed systems;proof theory and lambda calculus; algorithms for infinite systems; and monads.
Din seria Lecture Notes in Computer Science
- 20% Preț: 297.45 lei
- 20% Preț: 297.45 lei
- 20% Preț: 517.29 lei
- 5% Preț: 343.06 lei
- 20% Preț: 241.52 lei
- 20% Preț: 303.27 lei
- 20% Preț: 624.06 lei
- 20% Preț: 296.89 lei
- Preț: 346.79 lei
- Preț: 340.83 lei
- 20% Preț: 379.02 lei
- 20% Preț: 221.75 lei
- 20% Preț: 275.91 lei
- Preț: 262.38 lei
- 20% Preț: 298.57 lei
- 20% Preț: 266.97 lei
- 20% Preț: 360.10 lei
- 20% Preț: 310.09 lei
- 20% Preț: 284.43 lei
- 20% Preț: 308.00 lei
- 20% Preț: 202.42 lei
- 20% Preț: 283.35 lei
- 20% Preț: 315.25 lei
- 20% Preț: 572.84 lei
- 20% Preț: 475.27 lei
- 20% Preț: 291.91 lei
- 20% Preț: 289.52 lei
- 20% Preț: 290.45 lei
- 20% Preț: 698.69 lei
- 20% Preț: 347.90 lei
- 20% Preț: 413.13 lei
- 17% Preț: 338.16 lei
- 20% Preț: 771.51 lei
- 20% Preț: 447.62 lei
- 20% Preț: 298.57 lei
- 20% Preț: 287.43 lei
- 20% Preț: 414.27 lei
- 20% Preț: 413.75 lei
- 20% Preț: 639.35 lei
- 20% Preț: 267.73 lei
- 20% Preț: 322.75 lei
- 20% Preț: 297.58 lei
- 20% Preț: 367.40 lei
- 20% Preț: 607.93 lei
- 20% Preț: 297.58 lei
- 20% Preț: 377.31 lei
- 20% Preț: 289.95 lei
- 20% Preț: 418.32 lei
- 20% Preț: 345.69 lei
Preț: 791.81 lei
Preț vechi: 989.75 lei
-20%
Puncte Express: 1188
Preț estimativ în valută:
151.69€ • 164.69$ • 130.09£
151.69€ • 164.69$ • 130.09£
Carte tipărită la comandă
Livrare economică 06-11 mai
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783662496299
ISBN-10: 3662496291
Pagini: 550
Ilustrații: XI, 550 p. 78 illus.
Dimensiuni: 155 x 235 x 29 mm
Greutate: 8.42 kg
Ediția:1st ed. 2016
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: 3662496291
Pagini: 550
Ilustrații: XI, 550 p. 78 illus.
Dimensiuni: 155 x 235 x 29 mm
Greutate: 8.42 kg
Ediția:1st ed. 2016
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
Cuprins
Types.- Comprehensive parametric polymorphism:categorical models and type theory.- Guarded Dependent Type Theory withCoinductive Types.- Dependent Types and Fibred Computational Effects.- GameSemantics for Bounded Polymorphism.- Recursion and Fixed-Points Join InverseCategories as Models of Reversible Recursion.- A Coalgebraic View of BarRecursion and Bar Induction.- A New Foundation for Finitary Corecursion.-Fixed-point elimination in the Intuitionistic Propositional Calculus.- Verificationand Program Analysis. A Theory of Monitors.- Contextual approximation andhigher-order procedures.- A Theory of Slicing for Probabilistic Control Flow Graphs.-Verification of parameterized communicating automata via split-width.- Automata,Logic, Games - Robust Equilibria in Mean-Payoff Games.- Quantifier Alternationfor Infinite Words.-Synchronizing automata over nested words.- On Freeze LTLwith Ordered Attributes.- Regular transformations of data words through origininformation.- Probabilistic and Timed Systems - Trace Refinement in LabelledMarkov Decision Processes.- Qualitative Analysis of VASS-Induced MDPs.- MetricTemporal Logic with Counting.- Distributed Synthesis in Continuous Time.- ProofTheory and Lambda Calculus Unary Resolution: Characterizing Ptime.- Focused andSynthetic Nested Sequents.- Strong Normalizability as a Finiteness Structurevia the Taylor Expansion of lambda-terms.- Reasoning about call-by-need bymeans of types.- Algorithms for Infinite Systems Coverability Trees for PetriNets with Unordered Data.- Shortest paths in one-counter systems.- TheInvariance Problem for Matrix Semigroups.- Order-Sorted Rewriting andCongruence Closure.- Monads.- Towards a formal theory of graded monads.- ProfiniteMonads, Profinite Equations, and Reiterman’s Theorem.
Caracteristici
Includes supplementary material: sn.pub/extras