05079nam 22008175 450 99646559770331620230221143102.03-319-89366-110.1007/978-3-319-89366-2(CKB)4100000003359638(DE-He213)978-3-319-89366-2(MiAaPQ)EBC5579159(Au-PeEL)EBL5579159(OCoLC)1031399785(oapen)https://directory.doabooks.org/handle/20.500.12854/31640(PPN)226696510(EXLCZ)99410000000335963820180414d2018 u| 0engurnn|008mamaatxtrdacontentcrdamediacrrdacarrierFoundations of Software Science and Computation Structures[electronic resource] 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 /edited by Christel Baier, Ugo Dal Lago1st ed. 2018.Cham :Springer International Publishing :Imprint: Springer,2018.1 online resource (XV, 583 p. 75 illus.) Theoretical Computer Science and General Issues,2512-2029 ;108033-319-89365-3 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.This book is Open Access under a CC BY licence.Theoretical Computer Science and General Issues,2512-2029 ;10803Computer scienceSoftware engineeringArtificial intelligenceElectronic digital computers—EvaluationComputersProfessionsComputer science—MathematicsDiscrete mathematicsComputer Science Logic and Foundations of ProgrammingSoftware EngineeringArtificial IntelligenceSystem Performance and EvaluationThe Computing ProfessionDiscrete Mathematics in Computer ScienceComputer science.Software engineering.Artificial intelligence.Electronic digital computers—Evaluation.Computers.Professions.Computer science—Mathematics.Discrete mathematics.Computer Science Logic and Foundations of Programming.Software Engineering.Artificial Intelligence.System Performance and Evaluation.The Computing Profession.Discrete Mathematics in Computer Science.005.1015113Baier Christeledt312039Baier Christeledthttp://id.loc.gov/vocabulary/relators/edtDal Lago Ugoedthttp://id.loc.gov/vocabulary/relators/edtMiAaPQMiAaPQMiAaPQBOOK996465597703316Foundations of Software Science and Computation Structures3091270UNISA