Buch, Englisch, 465 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 7256 g
18th International Conference, FOSSACS 2015, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2015, London, UK, April 11-18, 2015, Proceedings
Buch, Englisch, 465 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 7256 g
Reihe: Theoretical Computer Science and General Issues
ISBN: 978-3-662-46677-3
Verlag: Springer
The 28 full papers presented in this volume were carefully reviewed and selected from 93 submissions. They are organized in topical sections named: semantics of programming languages; categorical models and logics; concurrent, probabilistic and timed systems; automata, games, verification; logical aspects of computational complexity; and type theory, proof theory and implicit computational complexity. The book also contains one full paper invited talk.
Zielgruppe
Research
Autoren/Hrsg.
Weitere Infos & Material
Invited Talk.- Polarized Substructural Session Types.- Semantics of Programming Languages I.- Synthesis of Strategies and the Hoare Logic of Angelic Nondeterminism.- An Infinitary Model of Linear Logic.- Game Semantics and Normalization by Evaluation.- Foundations of Differential Dataflow.- Categorical Models and Logics.- States of Convex Sets.- A Categorical Semantics for Linear Logical Frameworks.- A Completeness Result for Finite ?-bisimulations.- Sequent Calculus in the Topos of Trees.- Modal and Temporal Logics.- Coalgebraic Trace Semantics via Forgetful Logics.- Unifying Hyper and Epistemic Temporal Logics.- Concurrent, Probabilistic and Timed Systems On the Total Variation Distance of Semi-Markov Chains.- Decidable and Expressive Classes of Probabilistic Automata.- Knowledge = Observation + Memory + Computation.- Compositional Metric Reasoning with Probabilistic Process Calculi.- Semantics of Programming Languages II.- Fragments of ML Decidable by Nested Data Class Memory Automata.- Operational Nominal Game Semantics.- Step-Indexed Logical Relations for Probability.- Automata, Games, Verification.- Minimisation of Multiplicity Tree Automata.- Robust Multidimensional Mean-Payoff Games are Undecidable.- The Cyclic-Routing UAV Problem Is PSPACE-Complete.- Typing Weak MSOL Properties.- Logical Aspects of Computational Complexity Three Variables Suffice for Real-Time Logic.- On Presburger Arithmetic Extended with Modulo Counting Quantifiers.- Parity Games of Bounded Tree- and Clique-Width.- Type Theory, Proof Theory and Implicit Computational Complexity.- Programming and Reasoning with Guarded Recursion for Coinductive Types.- The Computational Contents of Ramified Corecurrence.- On the Dependencies of Logical Rules.- On the Mints Hierarchy in First-Order Intuitionistic Logic.
