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 /  [electronic resource] : 
edited by Christel Baier, Ugo Dal Lago. 
 - 1st ed. 2018. 
 - XV, 583 p. 75 illus.  online resource. 
 - Theoretical Computer Science and General Issues ;  10803 .
 - Theoretical Computer Science and General Issues ;  10803 .
<br/><br/>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. 
<br/><br/> Open Access 
<br/><br/> This book is Open Access under a CC BY licence. 
<br/><br/><label>ISBN: </label>9783319893662 
<br/><br/><label>Standard No.: </label>10.1007/978-3-319-89366-2  doi 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Computer logic.<br/>Software engineering.<br/>Artificial intelligence.<br/>Computer system failures.<br/>Computers.<br/>Computer science—Mathematics.<br/>Logics and Meanings of Programs.<br/>Software Engineering/Programming and Operating Systems.<br/>Artificial Intelligence.<br/>System Performance and Evaluation.<br/>The Computing Profession.<br/>Discrete Mathematics in Computer Science.
<br/><br/><label>LC Class. No.: </label>QA76.9.L63 QA76.5913 
<br/><br/><label>Dewey Class. No.: </label>005.1015113