TÃtulo : |
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 |
Tipo de documento: |
documento electrónico |
Autores: |
Kiefer, Stefan, ; Tasson, Christine, |
Mención de edición: |
1 ed. |
Editorial: |
[s.l.] : Springer |
Fecha de publicación: |
2021 |
Número de páginas: |
XV, 574 p. 52 ilustraciones |
ISBN/ISSN/DL: |
978-3-030-71995-1 |
Nota general: |
Libro disponible en la plataforma SpringerLink. Descarga y lectura en formatos PDF, HTML y ePub. Descarga completa o por capítulos. |
Idioma : |
Inglés (eng) |
Palabras clave: |
TeorÃa de las máquinas Ciencias de la Computación Procesamiento del lenguaje natural (Informática) Gestión de base de datos Programación de computadoras Lenguajes formales y teorÃa de los autómatas TeorÃa de la Computación Procesamiento del lenguaje natural (PNL) Técnicas de programación |
Clasificación: |
5.131 |
Resumen: |
Este libro de acceso abierto constituye las actas de la 24ª Conferencia Internacional sobre Fundamentos de la Ciencia del Software y Estructuras Computacionales, FOSSACS 2021, que se celebró del 27 de marzo al 1 de abril de 2021, como parte de las Conferencias Conjuntas Europeas sobre TeorÃa y Práctica del Software. ETAPS 2021. Se planeó que la conferencia se llevara a cabo en Luxemburgo y cambió a un formato en lÃnea debido a la pandemia de COVID-19. Los 28 artÃculos regulares presentados en este volumen fueron cuidadosamente revisados ​​y seleccionados entre 88 presentaciones. Se ocupan de la investigación sobre teorÃas y métodos para apoyar el análisis, integración, sÃntesis, transformación y verificación de programas y sistemas de software. . |
Nota de contenido: |
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 Büchi Arithmetic -- Parametricity for Primitive Nested Types -- The Spirit of Node Replication -- Nondeterministic and co-Nondeterministic Implies Deterministic, for Data Languages -- CertifyingInexpressibility -- 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. |
Tipo de medio : |
Computadora |
Summary : |
This 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. . |
Enlace de acceso : |
https://link-springer-com.biblioproxy.umanizales.edu.co/referencework/10.1007/97 [...] |
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 [documento electrónico] / Kiefer, Stefan, ; Tasson, Christine, . - 1 ed. . - [s.l.] : Springer, 2021 . - XV, 574 p. 52 ilustraciones. ISBN : 978-3-030-71995-1 Libro disponible en la plataforma SpringerLink. Descarga y lectura en formatos PDF, HTML y ePub. Descarga completa o por capítulos. Idioma : Inglés ( eng)
Palabras clave: |
TeorÃa de las máquinas Ciencias de la Computación Procesamiento del lenguaje natural (Informática) Gestión de base de datos Programación de computadoras Lenguajes formales y teorÃa de los autómatas TeorÃa de la Computación Procesamiento del lenguaje natural (PNL) Técnicas de programación |
Clasificación: |
5.131 |
Resumen: |
Este libro de acceso abierto constituye las actas de la 24ª Conferencia Internacional sobre Fundamentos de la Ciencia del Software y Estructuras Computacionales, FOSSACS 2021, que se celebró del 27 de marzo al 1 de abril de 2021, como parte de las Conferencias Conjuntas Europeas sobre TeorÃa y Práctica del Software. ETAPS 2021. Se planeó que la conferencia se llevara a cabo en Luxemburgo y cambió a un formato en lÃnea debido a la pandemia de COVID-19. Los 28 artÃculos regulares presentados en este volumen fueron cuidadosamente revisados ​​y seleccionados entre 88 presentaciones. Se ocupan de la investigación sobre teorÃas y métodos para apoyar el análisis, integración, sÃntesis, transformación y verificación de programas y sistemas de software. . |
Nota de contenido: |
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 Büchi Arithmetic -- Parametricity for Primitive Nested Types -- The Spirit of Node Replication -- Nondeterministic and co-Nondeterministic Implies Deterministic, for Data Languages -- CertifyingInexpressibility -- 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. |
Tipo de medio : |
Computadora |
Summary : |
This 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. . |
Enlace de acceso : |
https://link-springer-com.biblioproxy.umanizales.edu.co/referencework/10.1007/97 [...] |
|  |