John Sonchack
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
John Sonchack has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- David Walker
Princeton University, Princeton, USA
2 shared publications - Devon Loehr
Google, Mountain View, CA, USA
2 shared publications - Jennifer Rexford
Princeton University
2 shared publications - Liangcheng Yu
Microsoft Research, Redmond, Washington, USA
1 shared publication - Mary Hogan
Computer Science Department, Oberlin College, Oberlin, OH, USA
1 shared publication - Pamela Zave
Computer Science, Princeton University, Princeton, New Jersey, USA
1 shared publication
Latest Publications
- Open Access
- 11 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 122-139
VeriLucid: A Verification-aware Data-plane Programming Language
Correctness is important in data-plane programs, which run on critical infrastructure connecting millions of users. Verification helps programmers build correct software, but current data-plane tools can only check simple properties or require immense programmer effort. As a solution, this paper introduces the first verification-aware data-plane language: VeriLucid. The core idea is to unify programming and specification in one high-level language, with built-in proof automation. Integration makes it natural for programmers to use verification continuously throughout development, like unit testing but with strong guarantees. In evaluation, we show that VeriLucid requires 10X less programmer effort, in terms of lines of code, than other verification tools with comparable expressiveness.
- 11 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 122-139
Open AccessVeriLucid: A Verification-aware Data-plane Programming Language
Correctness is important in data-plane programs, which run on critical infrastructure connecting millions of users. Verification helps programmers build correct software, but current data-plane tools can only check simple properties or require immense programmer effort. As a solution, this paper introduces the first verification-aware data-plane language: VeriLucid. The core idea is to unify programming and specification in one high-level language, with built-in proof automation. Integration makes it natural for programmers to use verification continuously throughout development, like unit testing but with strong guarantees. In evaluation, we show that VeriLucid requires 10X less programmer effort, in terms of lines of code, than other verification tools with comparable expressiveness.
- 21 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Networking
- Vol. 33 (2) , 526-540
Automated Optimization of Parameterized Data-Plane Programs With Parasol
Programmable data planes allow for sophisticated applications that give operators the power to customize the functionality of their networks. Deploying these applications, however, often requires tedious and burdensome optimization of their layout and design, in which programmers must manually write, compile, and test an implementation, adjust the design, and repeat. In this paper we present Parasol, a framework that allows programmers to define general, parameterized network algorithms and automatically optimize their various parameters. The parameters of a Parasolprogram can represent a wide variety of implementation decisions, and may be optimized for arbitrary, high-level objectives defined by the programmer. Furthermore, optimization may be tailored to particular environments by providing a representative sample of traffic. We show how we implement the Parasolframework, which consists of a sketching language for writing parameterized programs, and a simulation-based optimizer for testing different parameter settings. We evaluate Parasolby implementing a suite of ten data-plane applications, and find that Parasolproduces a solution with comparable performance to hand-optimized P4 code within a two-hour time budget.
- 21 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Networking
- Vol. 33 (2) , 526-540
Automated Optimization of Parameterized Data-Plane Programs With Parasol
Programmable data planes allow for sophisticated applications that give operators the power to customize the functionality of their networks. Deploying these applications, however, often requires tedious and burdensome optimization of their layout and design, in which programmers must manually write, compile, and test an implementation, adjust the design, and repeat. In this paper we present Parasol, a framework that allows programmers to define general, parameterized network algorithms and automatically optimize their various parameters. The parameters of a Parasolprogram can represent a wide variety of implementation decisions, and may be optimized for arbitrary, high-level objectives defined by the programmer. Furthermore, optimization may be tailored to particular environments by providing a representative sample of traffic. We show how we implement the Parasolframework, which consists of a sketching language for writing parameterized programs, and a simulation-based optimizer for testing different parameter settings. We evaluate Parasolby implementing a suite of ten data-plane applications, and find that Parasolproduces a solution with comparable performance to hand-optimized P4 code within a two-hour time budget.
- 8 January 2023
- Published by Springer Nature
- p. 180-196
SwitchLog: A Logic Programming Language for Network Switches
- 8 January 2023
- Published by Springer Nature
- p. 180-196
SwitchLog: A Logic Programming Language for Network Switches
- Open Access
- 22 August 2022
- Published by Association for Computing Machinery (ACM)
- p. 219-232
Cebinae
For public networks like the Internet and those of many clouds, end-host applications can use any congestion control protocol they wish. This protocol diversity and application autonomy are only increasing over time. While in-network support for fairness is an attractive solution for reigning in the inequity, existing solutions still have difficulty scaling to today's networks using today's devices. In this paper, we present Cebinae, a mechanism for augmenting existing networks of legacy hosts with penalties for flows that exceed their max-min fair share. Cebinae is compatible with all of the congestion control protocols in today's Internet, is deployable on commodity programmable switches, and scales orders of magnitude beyond existing alternatives.
- 22 August 2022
- Published by Association for Computing Machinery (ACM)
- p. 219-232
Open AccessCebinae
For public networks like the Internet and those of many clouds, end-host applications can use any congestion control protocol they wish. This protocol diversity and application autonomy are only increasing over time. While in-network support for fairness is an attractive solution for reigning in the inequity, existing solutions still have difficulty scaling to today's networks using today's devices. In this paper, we present Cebinae, a mechanism for augmenting existing networks of legacy hosts with penalties for flows that exceed their max-min fair share. Cebinae is compatible with all of the congestion control protocols in today's Internet, is deployable on commodity programmable switches, and scales orders of magnitude beyond existing alternatives.