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

AvNobuko Yoshida

Häftad, Engelska, 2021

Del 12648 i serien Lecture Notes in Computer Science

443 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

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.

Produktinformation

Utgivningsdatum:2021-03-23
Mått:155 x 235 x 38 mm
Vikt:1 054 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:693
Förlag:Springer Nature Switzerland AG
ISBN:9783030720186

Utforska kategorier

Innehållsförteckning

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.