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 /: 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. (2018)

• Record Type: Book
• Other Titles: FOSSACS 2018; ETAPS 2018
• Further Information: Note: Christel Baier, Ugo Dal Lago (eds.).
• Editors: Baier, Christel; (Computer scientist), Dal Lago, Ugo
• Other Names: FOSSACS (Conference), 21st; ETAPS (Conference), 21st
• Contents: 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.
• Publisher Details: Cham, Switzerland : Springer
• Publication Date: 2018
• Extent: 1 online resource (xv, 583 pages), illustrations
• Subjects: 005.1; Computer science; Computer software -- Congresses; Software engineering -- Congresses; Computer software; Software engineering; Computers -- Software Development & Engineering -- General; Computers -- Intelligence (AI) & Semantics; Computers -- Hardware -- Handheld Devices; Computers -- General; Computers -- Data Processing; Software Engineering; Artificial intelligence; Systems analysis & design; Information technology: general issues; Discrete mathematics; Logic design; Software engineering; Artificial intelligence; Computer system performance; Computer industry; Computational complexity; Computers -- Programming -- General; Computer programming / software development; Electronic books; Conference papers and proceedings
• Languages: English
• ISBNs: 9783319893662; 3319893661; 3319893653; 9783319893655
• Related ISBNs: 9783319893655
• Notes: Note: Online resource; title from PDF title page (SpringerLink, viewed April 16, 2018).
• Access Rights: Legal Deposit; Only available on premises controlled by the deposit library and to one user at any one time; The Legal Deposit Libraries (Non-Print Works) Regulations (UK).
• Access Usage: Restricted: Printing from this resource is governed by The Legal Deposit Libraries (Non-Print Works) Regulations (UK) and UK copyright law currently in force.