Foundations of Software Science and Computation Structures
Springer Berlin (Verlag)
978-3-662-46677-3 (ISBN)
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.
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.
| Erscheint lt. Verlag | 9.4.2015 |
|---|---|
| Reihe/Serie | Lecture Notes in Computer Science | Theoretical Computer Science and General Issues |
| Zusatzinfo | XVI, 465 p. 92 illus. |
| Verlagsort | Berlin |
| Sprache | englisch |
| Maße | 155 x 235 mm |
| Gewicht | 735 g |
| Themenwelt | Mathematik / Informatik ► Informatik ► Software Entwicklung |
| Informatik ► Theorie / Studium ► Compilerbau | |
| Schlagworte | analysis tools • Applications • B Formal Language • Certification • Component-Based Software • component reuse • compositionality • Computer Science • conference proceedings • consistency checking • Evolution Rules • formal methods • Formal models • Formal Semantics • Informatics • modeling approaches • Models of Computation • program analysis • Quantitative Verification • Research • service-oriented computing • software adaptation • Software Verification and Validation • timed automata • Transformation |
| ISBN-10 | 3-662-46677-5 / 3662466775 |
| ISBN-13 | 978-3-662-46677-3 / 9783662466773 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
