Foundations of Software Science and Computation Structures

21st International Conference, FOSSACS 2018, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2018, Thessaloniki, Greece, April 14–20, 2018. Proceedings

AvChristel Baier,Ugo Dal Lago

Häftad, Engelska, 2018

Del 10803 i serien Lecture Notes in Computer Science

549 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

This book constitutes the proceedings of the 21st International Conference on Foundations of Software Science and Computational Structures, FOSSACS 2018, which took place in Thessaloniki, Greece, in April 2018, held as part of the European Joint Conference on Theory and Practice of Software, ETAPS 2018.The 31 papers presented in this volume were carefully reviewed and selected from 103 submissions. The papers are organized in topical sections named: semantics; linearity; concurrency; lambda-calculi and types; category theory and quantum control; quantitative models; logics and equational theories; and graphs and automata.

Produktinformation

Utgivningsdatum:2018-04-14
Mått:155 x 235 x 33 mm
Vikt:896 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:583
Förlag:Springer International Publishing AG
ISBN:9783319893655

Utforska kategorier

Systemvetenskap och AI inom Data och IT
Programvaruutveckling inom Data och IT
Artificiell intelligens inom Data och IT

Innehållsförteckning

Semantics.- Non-angelic Concurrent Game Semantics.- A Trace Semantics for System F Parametric Polymorphism.- Categorical Combinatorics for Non Deterministic Strategies on Simple Games.- A Syntactic View of Computational Adequacy.- Linearity.- A New Linear Logic for Deadlock-Free Session-Typed Processes.- A Double Category Theoretic Analysis of Graded Linear Exponential Comonads.- Depending on Session-Typed Processes.- FabULous Interoperability for ML and a Linear Language.- Concurrency.- Automata for True Concurrency Properties.- A Theory of Encodings and Expressiveness.- A Framework for Parameterized Monitorability.- Logics for Bisimulation and Divergence.- Lambda-Calculi and Types.- Call-by-need, Neededness and All That.- Fitch-Style Modal Lambda Calculi.- Realizability Interpretation and Normalization of Typed Call-by-Need.- Quotient Inductive-Inductive Types.- Category Theory and Quantum Control.- Guarded Traced Categories.- Proper Semirings and Proper Convex Functors.- From Symmetric Pattern-Matching to Quantum Control.- Quantitative Models.- The Complexity of Graph-Based Reductions for Reachability in Markov Decision Processes.- A Hierarchy of Scheduler Classes for Stochastic Automata.- Symbolically Quantifying Response Time in Stochastic Models using Moments and Semirings.- Comparator Automata in Quantitative Verification.- Logics and Equational Theories.- Modular Tableaux Calculi for Separation Theories.- Differential Calculus with Imprecise Input and its Logical Framework.- The Effects of Adding Reachability Predicates in Propositional Separation Logic.- The Equational Theory of the Natural Join and of Inner Union is Decidable.- Graphs and Automata.- Minimization of Graph Weighted Models over Circular Strings.- Games on Graphs with a Public Signal Monitoring.- WQO Dichotomy for 3-Graphs.- Verifying Higher-Order Functions with Tree Automata.