Formal verification of ARP (address resolution protocol) through SMT-based model checking - A case study -

3Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Internet protocols are intrinsically complex to understand and validate, due both to the potentially unbounded number of entities involved, and to the complexity of interactions amongst them. Yet, their safety is indispensable to guarantee the proper behavior of a number of critical applications. In this work, we apply formal methods to verify the safety of the Address Resolution Protocol (ARP), a standard protocol of the TCP/IP stack i.e. the communication protocols used by any Internet Host, and we are able to formally prove that the ARP protocol, as defined by the standard Request for Comments, exhibits various vulnerabilities which have been exploited since many years and still are the main ingredient of many attack vectors. As a complementary result we also show the feasibility of formal verification methods when applied to real network protocols.

Cite

CITATION STYLE

APA

Bruschi, D., Di Pasquale, A., Ghilardi, S., Lanzi, A., & Pagani, E. (2017). Formal verification of ARP (address resolution protocol) through SMT-based model checking - A case study -. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10510 LNCS, pp. 391–406). Springer Verlag. https://doi.org/10.1007/978-3-319-66845-1_26

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free