Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Nick Giannarakis"'
Publikováno v:
Proceedings of the ACM on Programming Languages. 5:1-30
ProbNV is a new framework for probabilistic network control plane verification that strikes a balance between generality and scalability. ProbNV is general enough to encode a wide range of features from the most common protocols (eBGP and OSPF) and y
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::19b661046eaee055f4d336ddfbadeb54
https://doi.org/10.1145/3473595
https://doi.org/10.1145/3473595
Autor:
Aseem Rastogi, Bryan Parno, Aymeric Fromherz, Chris Hawblitzel, Nikhil Swamy, Nick Giannarakis
Publikováno v:
Proceedings of the ACM on Programming Languages. 3:1-30
High-performance cryptographic libraries often mix code written in a high-level language with code written in assembly. To support formally verifying the correctness and security of such hybrid programs, this paper presents an embedding of a subset o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9c88f32b3bd2ba3fff9e7d1ba0fdb9fe
https://doi.org/10.1145/3290376
https://doi.org/10.1145/3290376
Publikováno v:
PLDI
Network misconfiguration has caused a raft of high-profile outages over the past decade, spurring researchers to develop a variety of network analysis and verification tools. Unfortunately, developing and maintaining such tools is an enormous challen
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f24b28f6aabc0846a88595afae6b2bea
https://doi.org/10.1145/3385412.3386019
https://doi.org/10.1145/3385412.3386019
Publikováno v:
NetPL@SIGCOMM
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0c230fc815e5d26c9a79e3d3b2af25a0
https://doi.org/10.1145/3341561.3349592
https://doi.org/10.1145/3341561.3349592
Publikováno v:
Computer Aided Verification ISBN: 9783030255428
CAV (2)
CAV (2)
We show how to verify that large data center networks satisfy key properties such as all-pairs reachability under a bounded number of faults. To scale the analysis, we develop algorithms that identify network symmetries and compute small abstract net
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::33a8e6e646c630ac001e4a5d6e6e1567
https://doi.org/10.1007/978-3-030-25543-5_18
https://doi.org/10.1007/978-3-030-25543-5_18
Publikováno v:
POPL
We introduce a strengthening of the release-acquire fragment of the C11 memory model that (i) forbids dubious behaviors that are not observed in any implementation; (ii) supports fence instructions that restore sequential consistency; and (iii) admit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::14aca43245001771c592e492a52a032c
https://doi.org/10.1145/2837614.2837643
https://doi.org/10.1145/2837614.2837643
Autor:
Andrew Tolmach, Benjamin C. Pierce, Antal Spector-Zabusky, Arthur Azevedo de Amorim, Nick Giannarakis, Catalin Hritcu, Maxime Dénès
Publikováno v:
IEEE Symposium on Security and Privacy
2015 IEEE Symposium on Security and Privacy
2015 IEEE Symposium on Security and Privacy, May 2015, San Jose, United States. pp.813-830, ⟨10.1109/SP.2015.55⟩
2015 IEEE Symposium on Security and Privacy
2015 IEEE Symposium on Security and Privacy, May 2015, San Jose, United States. pp.813-830, ⟨10.1109/SP.2015.55⟩
International audience ; Recent advances in hardware design have demonstrated mechanisms allowing a wide range of low-level security policies (or micro-policies) to be expressed using rules on metadata tags. We propose a methodology for defining and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::032279c920072a1563342cc979436f2f
https://doi.org/10.1109/sp.2015.55
https://doi.org/10.1109/sp.2015.55