000 04212nam a2200433 i 4500
999 _c334701
_d334701
_x1
001 334701
003 ES-MaUEC
005 20230102114737.0
006 a|||| o|||| 10| 0
007 cr nn nnnaamaa
008 210322s2021 gw a o |1|| 0|eng d
020 _a9783030719951
024 7 _a10.1007/978-3-030-71995-1
_2doi
040 _aES-MaUEC
_bspa
_cES-MaUEC
_dES-MaUEC
050 4 _aQA76.754
_b2021 EB
245 0 0 _aFoundations of Software Science and Computation Structures :
_b24th 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
_cedited by Stefan Kiefer, Christine Tasson
250 _aFirst edition 2021
264 1 _aCham, Switzerland
_bSpringer International Publising
_c2021
300 _a1 recurso en línea (XV, 574 páginas)
_b52 ilustraciones
336 _2rdacontent
_aTexto
_btxt
337 _2rdamedia
_aelectrónico
_bc
338 _2rdacarrier
_arecurso electrónico
_bcr
347 _atext file
_bPDF
_2rda
490 0 _aTheoretical Computer Science and General Issues
_v12650
505 0 _aConstructing 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 Büchi 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.
506 0 _aOpen Access
520 3 _aThis open access book constitutes the proceedings of the 24th International Conference on Foundations of Software Science and Computational Structures, FOSSACS 2021, which was held during March 27 until April 1, 2021, as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2021. The conference was planned to take place in Luxembourg and changed to an online format due to the COVID-19 pandemic. The 28 regular papers presented in this volume were carefully reviewed and selected from 88 submissions. They deal with research on theories and methods to support the analysis, integration, synthesis, transformation, and verification of programs and software systems.
988 _aSpringer_Computer_2021
650 7 _2embne
_aSoftware
_vCongresos y asambleas
_9143838
650 7 _2embne
_aIngeniería del software
_vCongresos y asambleas
_9152630
700 1 _aKiefer, Stefan
_eeditor literario
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aTasson, Christine
_eeditor literario
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink
856 4 0 _uhttps://go.openathens.net/redirector/universidadeuropea.es?url=https://doi.org/10.1007/978-3-030-71995-1
_zAcceso a este recurso digital (usuarios Universidad Europea de Madrid)
942 _2lcc
_cLE
998 _b05/2021
_dz
_eb
_zSI