This book constitutes the proceedings of the 19th International Conference on Foundations of Software Science and Computation Structures, FOSSACS 2016, which took place in Eindhoven, The Netherlands, in April 2016, held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2016. The 31 full papers presented in this volume were carefully reviewed and selected from 85 submissions. They were organized in topical sections named: types; recursion and fixed-points; verification and program analysis; automata, logic, games; probabilistic and timed systems; proof theory and lambda calculus; algorithms for infinite systems; and monads.
Les mer
Types.- Comprehensive parametric polymorphism: categorical models and type theory.- Guarded Dependent Type Theory with Coinductive Types.- Dependent Types and Fibred Computational Effects.- Game Semantics for Bounded Polymorphism.- Recursion and Fixed-Points Join Inverse Categories as Models of Reversible Recursion.- A Coalgebraic View of Bar Recursion and Bar Induction.- A New Foundation for Finitary Corecursion.- Fixed-point elimination in the Intuitionistic Propositional Calculus.- Verification and Program Analysis. A Theory of Monitors.- Contextual approximation and higher-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 Alternation for Infinite Words.-Synchronizing automata over nested words.- On Freeze LTL with Ordered Attributes.- Regular transformations of data words through origin information.- Probabilistic and Timed Systems - Trace Refinement in Labelled Markov Decision Processes.- Qualitative Analysis of VASS-Induced MDPs.- Metric Temporal Logic with Counting.- Distributed Synthesis in Continuous Time.- Proof Theory and Lambda Calculus Unary Resolution: Characterizing Ptime.- Focused and Synthetic Nested Sequents.- Strong Normalizability as a Finiteness Structure via the Taylor Expansion of lambda-terms.- Reasoning about call-by-need by means of types.- Algorithms for Infinite Systems Coverability Trees for Petri Nets with Unordered Data.- Shortest paths in one-counter systems.- The Invariance Problem for Matrix Semigroups.- Order-Sorted Rewriting and Congruence Closure.- Monads.- Towards a formal theory of graded monads.- Profinite Monads, Profinite Equations, and Reiterman’s Theorem.
Les mer
Includes supplementary material: sn.pub/extras
GPSR Compliance The European Union's (EU) General Product Safety Regulation (GPSR) is a set of rules that requires consumer products to be safe and our obligations to ensure this. If you have any concerns about our products you can contact us on ProductSafety@springernature.com. In case Publisher is established outside the EU, the EU authorized representative is: Springer Nature Customer Service Center GmbH Europaplatz 3 69115 Heidelberg, Germany ProductSafety@springernature.com
Les mer

Produktdetaljer

ISBN
9783662496299
Publisert
2016-03-23
Utgiver
Vendor
Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Høyde
235 mm
Bredde
155 mm
Aldersnivå
Research, P, 06
Språk
Product language
Engelsk
Format
Product format
Heftet