Foundations of software science and ...
FOSSACS (Conference) (2021 :)

Linked to FindBook      Google Book      Amazon      博客來     
  • Foundations of software science and computation structures = 24th International Conference, FOSSACS 2021, held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2021, Luxembourg City, Luxembourg, March 27 - April 1, 2021 : proceedings /
  • Record Type: Electronic resources : Monograph/item
    Title/Author: Foundations of software science and computation structures/ edited by Stefan Kiefer, Christine Tasson.
    Reminder of title: 24th International Conference, FOSSACS 2021, held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2021, Luxembourg City, Luxembourg, March 27 - April 1, 2021 : proceedings /
    remainder title: FOSSACS 2021
    other author: Kiefer, Stefan.
    corporate name: FOSSACS (Conference)
    Published: Cham :Springer International Publishing : : 2021.,
    Description: xv, 574 p. :ill., digital ;24 cm.
    [NT 15003449]: Constructing a universe for the setoid model -- Nominal Equational Problems -- Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy -- Fixpoint Theory - Upside Down -- "Most of"' leads to undecidability: Failure of adding frequencies to LTL -- Combining Semilattices and Semimodules -- One-way Resynchronizability of Word Transducers -- Fair Refinement for Asynchronous Session Types -- Running Time Analysis of Broadcast Consensus Protocols -- Leafy automata for higher-order concurrency -- Factorization in Call-by-Name and Call-by-Value Calculi via Linear Logic -- Generalized Bounded Linear Logic and its Categorical Semantics -- Focused Proof-search in the Logic of Bunched Implications -- Interpolation and Amalgamation for Arrays with MaxDi -- Adjoint Reactive GUI Programming -- On the Expressiveness of Buchi Arithmetic -- Parametricity for Primitive Nested Types -- The Spirit of Node Replication -- Nondeterministic and co-Nondeterministic Implies Deterministic, for Data Languages -- Certifying Inexpressibility -- A General Semantic Construction of Dependent Re nement Type Systems, Categorically -- Simple Stochastic Games with Almost-Sure Energy-Parity Objectives are in NP and coNP -- Nondeterministic Syntactic Complexity -- A String Diagrammatic Axiomatisation of Finite-State Automata -- Work-sensitive Dynamic Complexity of Formal Languages -- Learning Pomset Automata -- The Structure of Sum-Over-Paths, its Consequences, and Completeness for Clifford -- A Quantified Coalgebraic van Benthem Theorem.
    Contained By: Springer Nature eBook
    Subject: Computer software - Congresses. -
    Online resource: https://doi.org/10.1007/978-3-030-71995-1
    ISBN: 9783030719951
Location:  Year:  Volume Number: 
Items
  • 1 records • Pages 1 •
 
W9400795 電子資源 11.線上閱覽_V 電子書 EB QA76.751 .F67 2021 一般使用(Normal) On shelf 0
  • 1 records • Pages 1 •
Multimedia
Reviews
Export
pickup library
 
 
Change password
Login