KI-Beratung Beta
Vor Ort
Merkzettel Warenkorb
Produktbild: Foundations of Software Science and Computation Structures
Band 9634

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

Aus der Reihe Lecture Notes in Computer Science

49,99 €

inkl. gesetzl. MwSt., Versandkostenfrei

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

23.03.2016

Abbildungen

XI, 550 p. 78 illus.

Herausgeber

Bart Jacobs + weitere

Verlag

Springer Berlin

Seitenzahl

550

Maße (L/B/H)

23,5/15,5/3,1 cm

Gewicht

844 g

Auflage

1st ed. 2016

Sprache

Englisch

ISBN

978-3-662-49629-9

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

23.03.2016

Abbildungen

XI, 550 p. 78 illus.

Herausgeber

Verlag

Springer Berlin

Seitenzahl

550

Maße (L/B/H)

23,5/15,5/3,1 cm

Gewicht

844 g

Auflage

1st ed. 2016

Sprache

Englisch

ISBN

978-3-662-49629-9

Herstelleradresse

Springer-Verlag KG
Sachsenplatz 4-6
1201 Wien
AT

Email: ProductSafety@springernature.com

Noch keine Bewertungen vorhanden

Verfassen Sie die erste Bewertung zu diesem Artikel

Helfen Sie anderen Kundinnen und Kunden durch Ihre Meinung.

Kundinnen und Kunden meinen

Bewertungen (0)
  • Produktbild: Foundations of Software Science and Computation Structures

  • 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.