Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Chong Ye

dblp:302/5205 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
3since 2021 · last 2025
0009-0006-9761-0260ORCID · corroborated

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

Computer networks · 2 · 2 since 2021Software engineering, systems software and programming languages · 1 · 1 first-author · 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.

Computer networks
3 papers
Software-defined and programmable networks · 78% Network management and operations · 22%
Software engineering, system software, and programming languages
1 paper
Program verification · 100%

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

TopicWeightPapersLastEvidence papers
Software-defined and programmable networks › programmable data plane
p4 program verification
1.422024
P4Inv: Inferring Packet Invariants for Verification of Stateful P4 Programs · INFOCOM 2024
P4b: A Translator from P4 Programs to Boogie · ESEC/SIGSOFT FSE 2023
Software-defined and programmable networks
programmable data plane
1.422024
P4Inv: Inferring Packet Invariants for Verification of Stateful P4 Programs · INFOCOM 2024
P4b: A Translator from P4 Programs to Boogie · ESEC/SIGSOFT FSE 2023
Network management and operations
network verification
1.022025
P4Inv: Inferring Packet Invariants for Verification of Stateful P4 Programs · INFOCOM 2024
On Temporal Verification of Stateful P4 Programs · NSDI 2025
Software-defined and programmable networks › programmable data plane
p4
0.912025
On Temporal Verification of Stateful P4 Programs · NSDI 2025

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

formal translation rules · 1.3boogie verification toolchain · 1.3model checking · 0.9formal verification · 0.8data-driven invariant inference · 0.8
YearPublicationVenuePosition
2025 On Temporal Verification of Stateful P4 Programs
Delong Zhang, Chong Ye, Fei He 0001
NSDI2
2024 P4Inv: Inferring Packet Invariants for Verification of Stateful P4 Programs
abstract
P4 is widely adopted for programming data planes in software-defined networking. Formal verification of P4 programs is essential to ensure network reliability and security. However, existing P4 verifiers overlook the stateful nature of packet processing, rendering them inadequate for verifying complex stateful P4 programs.In this paper, we introduce a novel concept called packet invariants to address the stateful aspects of P4 programs. We present an automated verification tool specifically designed for stateful P4 programs. This algorithm efficiently discovers and validates packet invariants in a data-driven manner, offering a novel and effective verification approach for stateful P4 programs. To the best of our knowledge, this approach represents the first attempt to generate and leverage domain-specific invariants for P4 program verification. We implement our approach in a prototype tool called P4Inv. Experimental results demonstrate its effectiveness in verifying stateful P4 programs.
Delong Zhang, Chong Ye, Fei He 0001
INFOCOM2
2023 P4b: A Translator from P4 Programs to Boogie
abstract
P4 is a mainstream language for Software Defined Network (SDN) data planes. P4 is designed to achieve target-independent, protocol-independent, and configurable SDN data planes. However, logic errors may occur in P4 programs, resulting in improper packet processing, which may cause serious network errors and information disclosure. In addition, P4 programs contain many branches and thus are more challenging to ensure correctness. Formal verification is a powerful technique to verify the correctness of P4 programs. Unfortunately, current P4 verification studies lack basic toolchains, and their intermediate languages are not expressive enough. We present P4b, an efficient translator from P4 programs to Boogie, a verification-oriented intermediate representation. We provide formal translation rules to ensure the correctness of the translation process. The translated results can be verified by the toolchain of Boogie. We conducted experiments on 170 P4 programs collected from GitHub, and the experimental results demonstrate that our translator is useful and practical. The screencast is available at https://youtu.be/8_rEj3QFQeM. The tool is available at https://github.com/Invincibleyc/P4B-Translator.
Chong Ye, Fei He 0001
ESEC/SIGSOFT FSE1