Muutke küpsiste eelistusi

Programming Languages and Systems: 30th 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 1st ed. 2021 [Pehme köide]

Edited by
  • Formaat: Paperback / softback, 693 pages, kõrgus x laius: 235x155 mm, kaal: 1068 g, 177 Illustrations, black and white; XII, 693 p. 177 illus., 1 Paperback / softback
  • Sari: Lecture Notes in Computer Science 12648
  • Ilmumisaeg: 23-Mar-2021
  • Kirjastus: Springer Nature Switzerland AG
  • ISBN-10: 3030720187
  • ISBN-13: 9783030720186
  • Pehme köide
  • Hind: 39,43 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Tavahind: 46,39 €
  • Säästad 15%
  • Raamatu kohalejõudmiseks kirjastusest kulub orienteeruvalt 2-4 nädalat
  • Kogus:
  • Lisa ostukorvi
  • Tasuta tarne
  • Tellimisaeg 2-4 nädalat
  • Lisa soovinimekirja
  • Formaat: Paperback / softback, 693 pages, kõrgus x laius: 235x155 mm, kaal: 1068 g, 177 Illustrations, black and white; XII, 693 p. 177 illus., 1 Paperback / softback
  • Sari: Lecture Notes in Computer Science 12648
  • Ilmumisaeg: 23-Mar-2021
  • Kirjastus: Springer Nature Switzerland AG
  • ISBN-10: 3030720187
  • ISBN-13: 9783030720186

This 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.



The 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 areDifferentiable 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.