000			04074nam a2200421 i 4500
999			_c334641 _d334641 _x1
001			334641
003			ES-MaUEC
005			20230102114731.0
006			a|||| o|||| 10| 0
007			cr nn nnnaamaa
008			210322s2021 gw a o |1|| 0|eng d
020			_a9783030720193
024	7		_a10.1007/978-3-030-72019-3 _2doi
040			_aES-MaUEC _bspa _cES-MaUEC _dES-MaUEC
050		4	_aQA76.7 _b2021 EB
245	0	0	_aProgramming languages and systems : _b30th European Symposium on Programming, ESOP 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 Nobuko Yoshida
250			_aFirst edition 2021
264		1	_aCham, Switzerland _bSpringer International Publising _c2021
300			_a1 recurso en línea (XII, 693 páginas) _b177 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 _v12648
505	0		_aThe Decidability of Verification under PS 2.0 -- Data Flow Analysis of Asynchronous Systems using Infinite Abstract Domains -- Types for Complexity of Parallel Computation in Pi-Calculus -- Checking Robustness Between Weak Transactional Consistency Models -- Verified Software Units -- An Automated Deductive Verication Framework for Circuit-building Quantum Programs -- Nested Session Types -- Coupled Relational Symbolic Execution for Differential Privacy -- Graded Hoare Logic and its Categorical Semantics -- Do Judge a Test by its Cover: Combining Combinatorial and Property-Based Testing -- For a Few Dollars More - Verified Fine-Grained Algorithm Analysis Down to LLVM -- Run-time Complexity Bounds Using Squeezers -- Complete trace models of state and control -- Session Coalgebras: A Coalgebraic View on Session Types and Communication Protocols -- Correctness of Sequential Monte Carlo Inference for Probabilistic Programming Languages -- Densities of Almost Surely Terminating Probabilistic Programs are Differentiable Almost Everywhere -- Graded Modal Dependent Type Theory -- Automated Termination Analysis of Polynomial Probabilistic Programs -- Bayesian strategies: probabilistic programs as generalised graphical models -- Temporal Refinements for Guarded Recursive Types -- Query Lifting: Language-integrated query for heterogeneous nested collections -- Reverse AD at Higher Types: Pure, Principled and Denotationally Correct -- Sound and Complete Concolic Testing for Higher-order Functions -- Strong-Separation Logic. .
506	0		_aOpen Access
520	3		_aThis open access book constitutes the proceedings of the 30th European Symposium on Programming, ESOP 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 24 papers included in this volume were carefully reviewed and selected from 79 submissions. They deal with fundamental issues in the specification, design, analysis, and implementation of programming languages and systems.
988			_aSpringer_Computer_2021
650		7	_2embne _9678605 _aLenguajes de programación _vCongresos y asambleas
650		7	_2embne _aProgramación de ordenadores _vCongresos y asambleas _9139821
700	1		_aYoshida, Nobuko _eeditor literario _0(orcid)0000-0002-3925-8557 _1https://orcid.org/0000-0002-3925-8557 _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-72019-3 _zAcceso a este recurso digital (usuarios Universidad Europea de Madrid)
942			_2lcc _cLE
998			_b05/2021 _dz _eb _zSI