Zachary Eisbach

dblp:390/3339 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2024
0009-0005-3028-7211ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Software engineering, system software, and programming languages
1 paper
Programming languages and type systems · 91% Program verification · 9%

Topics — the 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Programming languages and type systems › language semantics
formal semantics
0.812024
Realistic Realizability: Specifying ABIs You Can Count On · Proc. ACM Program. Lang. 2024
Programming languages and type systems › type theory
realizability model
0.812024
Realistic Realizability: Specifying ABIs You Can Count On · Proc. ACM Program. Lang. 2024
Program verification › program logic
separation logic
0.212024
Realistic Realizability: Specifying ABIs You Can Count On · Proc. ACM Program. Lang. 2024

Methods — techniques the papers use, named apart from their topics

separation logic · 0.8realizability model · 0.8hybrid logic · 0.8
YearPublicationVenuePosition
2024 Realistic Realizability: Specifying ABIs You Can Count On
abstract
The Application Binary Interface (ABI) for a language defines the interoperability rules for its target platforms, including data layout and calling conventions, such that compliance with the rules ensures “safe” execution and perhaps certain resource usage guarantees. These rules are relied upon by compilers, libraries, and foreign- function interfaces. Unfortunately, ABIs are typically specified in prose, and while type systems for source languages have evolved, ABIs have comparatively stalled, lacking advancements in expressivity and safety. We propose a vision for richer, semantic ABIs to improve interoperability and library integration, supported by a methodology for formally specifying ABIs using realizability models. These semantic ABIs connect abstract, high-level types to unwieldy, but well-behaved, low-level code. We illustrate our approach with a case study formalizing the ABI of a functional source language in terms of a reference-counting implementation in a C-like target language. A key contribution supporting this case study is a graph-based model of separation logic that captures the ownership and accessibility of reference-counted resources using modalities inspired by hybrid logic. To highlight the flexibility of our methodology, we show how various design decisions can be interpreted into the semantic ABI. Finally, we provide the first formalization of library evolution, a distinguishing feature of Swift’s ABI.
Andrew Wagner, Zachary Eisbach, Amal Ahmed 0001
Proc. ACM Program. Lang.2