Proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation 2022
DOI: 10.1145/3519939.3523708
|View full text |Cite
|
Sign up to set email alerts
|

Hardening attack surfaces with formally proven binary format parsers

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2023
2023
2023
2023

Publication Types

Select...
3
2

Relationship

1
4

Authors

Journals

citations
Cited by 8 publications
(2 citation statements)
references
References 16 publications
0
2
0
Order By: Relevance
“…There is some work in verification of the properties of protocols, such as TLS. Microsoft has successfully deployed formal parser verification in network stack handling for the Windows Virtual Switch [48], for example, which eliminates many classes of implementation vulnerabilities in that component. This does not comment on whether TCP as specified has flaws or ambiguities.…”
Section: Applicability To Modern Systemsmentioning
confidence: 99%
“…There is some work in verification of the properties of protocols, such as TLS. Microsoft has successfully deployed formal parser verification in network stack handling for the Windows Virtual Switch [48], for example, which eliminates many classes of implementation vulnerabilities in that component. This does not comment on whether TCP as specified has flaws or ambiguities.…”
Section: Applicability To Modern Systemsmentioning
confidence: 99%
“…So we need to make sure to read each input byte at most once. While EverParse allows generating input data validators formally guaranteed against double fetches [24], these validators do not cover the subset of EverParse that we are using for our log types. So, we need to allocate a temporary buffer and copy the contents of the input buffer there, and let the verifier operate from there.…”
Section: A Verified Wrapper For Teesmentioning
confidence: 99%