Luís Caires
Proceedings of the 28th European Symposium on Programming
ESOP, 2019.

@proceedings{ESOP-2019,
	doi           = "10.1007/978-3-030-17184-1",
	editor        = "Luís Caires",
	isbn          = "['978-3-030-17183-4', '978-3-030-17184-1']",
	publisher     = "{Springer}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the 28th European Symposium on Programming}",
	volume        = 11423,
	year          = 2019,
}

Contents (28 items)

ESOP-2019-MevelJP

Time Credits and Time Receipts in Iris (GM, JHJ, FP), pp. 3–29.

ESOP-2019-MartinezADGHHNP #automation #metaprogramming #proving #smt

Meta-F* : Proof Automation with SMT, Tactics, and Metaprograms (GM, DA, VD, NG, CH, CH, MN, ZP, CPC, JP, TR, AR, NS), pp. 30–59.

ESOP-2019-FruminGK #automation #c #nondeterminism #reasoning

Semi-automated Reasoning About Non-determinism in C Expressions (DF, LG, RK), pp. 60–87.

ESOP-2019-KuruG #memory management

Safe Deferred Memory Reclamation with Types (IK0, CSG), pp. 88–116.

ESOP-2019-DownenSAJ

Codata in Action (PD, ZS, ZMA, SPJ), pp. 119–146.

ESOP-2019-XiaOW #bidirectional #source code

Composing Bidirectional Programs Monadically (LyX, DO, MW0), pp. 147–175.

ESOP-2019-BoutillierCF #semantics #simulation #static analysis

Counters in Kappa: Semantics, Simulation, and Static Analysis (PB, IC, JF), pp. 176–204.

ESOP-2019-VeselyF #functional

One Step at a Time - A Functional Derivation of Small-Step Evaluators from Big-Step Counterparts (FV, KF), pp. 205–231.

ESOP-2019-McDermottM #call-by #evaluation #order #reasoning #source code

Extended Call-by-Push-Value: Reasoning About Effectful Programs and Evaluation Order (DM, AM), pp. 235–262.

ESOP-2019-LagoG #bisimulation #normalisation

Effectful Normal Form Bisimulation (UDL, FG), pp. 263–292.

ESOP-2019-BuroM #multi #on the

On the Multi-Language Construction (SB, IM), pp. 293–321.

ESOP-2019-CastellanP #probability #programming #semantics

Probabilistic Programming Inference via Intensional Semantics (SC, HP), pp. 322–349.

ESOP-2019-SekiyamaI #algebra #polymorphism

Handling Polymorphic Algebraic Effects (TS, AI), pp. 353–380.

ESOP-2019-BiXOS #composition #morphism #polymorphism #programming

Distributive Disjoint Polymorphism for Compositional Programming (XB, NX, BCdSO, TS), pp. 381–409.

ESOP-2019-AccattoliGL

Types by Need (BA, GG, ML), pp. 410–439.

ESOP-2019-Gilbert #type system

Verifiable Certificates for Predicate Subtyping (FG0), pp. 440–466.

ESOP-2019-PatrignaniG #compilation #robust

Robustly Safe Compilation (MP, DG0), pp. 469–498.

ESOP-2019-BessonBDJW #compilation #fault

Compiling Sandboxes: Formally Verified Software Fault Isolation (FB, SB, AD, TPJ, PW), pp. 499–524.

ESOP-2019-Alvarez-Picallo #datalog #fixpoint #incremental #recursion #semantics

Fixing Incremental Computation - Derivatives of Fixpoints, and the Recursive Semantics of Datalog (MAP, AET, MPJ, CHLO), pp. 525–552.

ESOP-2019-GiarrussoRS #incremental #program transformation #λ-calculus

Incremental λ-Calculus in Cache-Transfer Style - Static Memoization by Program Transformation (PGG, YRG, PS), pp. 553–580.

ESOP-2019-BocchiMVY #process

Asynchronous Timed Session Types - From Duality to Time-Sensitive Processes (LB, MM, VTV, NY), pp. 583–610.

ESOP-2019-BalzerTP

Manifest Deadlock-Freedom for Shared Session Types (SB, BT, FP), pp. 611–639.

ESOP-2019-SakayoriT #category theory #π-calculus

A Categorical Model of an i/o-typed π-calculus (KS, TT), pp. 640–667.

ESOP-2019-GlabbeekHM #algebra #process #protocol

A Process Algebra for Link Layer Protocols (RvG, PH, MM), pp. 668–693.

ESOP-2019-ChopraPD #kernel #static analysis

Data Races and Static Analysis for Interrupt-Driven Kernels (NC, RP, DD), pp. 697–723.

ESOP-2019-JournaultMO #abstract domain

An Abstract Domain for Trees with Numeric Relations (MJ, AM, AO), pp. 724–751.

ESOP-2019-FuhsK #dependence #framework #higher-order

A Static Higher-Order Dependency Pair Framework (CF, CK), pp. 752–782.

ESOP-2019-BasoldKL #horn clause #induction #proving #recursion

Coinduction in Uniform: Foundations for Corecursive Proof Search with Horn Clauses (HB, EK, YL), pp. 783–813.