159 lines
6.2 KiB
Plaintext
159 lines
6.2 KiB
Plaintext
\begin{thebibliography}{10}
|
|
|
|
\bibitem{noauthor_boost_nodate}
|
|
The {Boost} {Graph} {Library} - 1.75.0.
|
|
|
|
\bibitem{noauthor_overview_nodate}
|
|
An {Overview} of the {Parallel} {Boost} {Graph} {Library} - 1.75.0.
|
|
|
|
\bibitem{ainsworth_graph_2016}
|
|
Sam Ainsworth and Timothy~M. Jones.
|
|
\newblock Graph prefetching using data structure knowledge.
|
|
\newblock {\em Proceedings of the International Conference on Supercomputing},
|
|
01-03-June, 2016.
|
|
|
|
\bibitem{allman_complying_2006}
|
|
Eric Allman.
|
|
\newblock Complying with {Compliance}: {Blowing} it off is not an option.
|
|
\newblock {\em ACM Queue}, 4(7), 2006.
|
|
|
|
\bibitem{arifuzzaman_fast_2015}
|
|
Shaikh Arifuzzaman and Maleq Khan.
|
|
\newblock Fast parallel conversion of edge list to adjacency list for
|
|
large-scale graphs.
|
|
\newblock In {\em {HPC} '15: {Proceedings} of the {Symposium} on {High}
|
|
{Performance} {Computing}}, pages 17--24, April 2015.
|
|
|
|
\bibitem{balaji_graph_2016}
|
|
Janani Balaji and Rajshekhar Sunderraman.
|
|
\newblock Graph {Topology} {Abstraction} for {Distributed} {Path} {Queries}.
|
|
\newblock In {\em {HPGP} '16: {Proceedings} of the {ACM} {Workshop} on {High}
|
|
{Performance} {Graph} {Processing}}, pages 27--34, May 2016.
|
|
|
|
\bibitem{baloyi_guidelines_2019}
|
|
Ntsako Baloyi and Paula Kotzé.
|
|
\newblock Guidelines for {Data} {Privacy} {Compliance}: {A} {Focus} on
|
|
{Cyberphysical} {Systems} and {Internet} of {Things}.
|
|
\newblock In {\em {SAICSIT} '19: {Proceedings} of the {South} {African}
|
|
{Institute} of {Computer} {Scientists} and {Information} {Technologists}
|
|
2019}, Skukuza South Africa, 2019. Association for Computing Machinery.
|
|
|
|
\bibitem{berry_graph_2007}
|
|
Jonathan Berry and Bruce Hendrickson.
|
|
\newblock Graph {Analysis} with {High} {Performance} {Computing}.
|
|
\newblock {\em Computing in Science and Engineering}, 2007.
|
|
|
|
\bibitem{cook_rage_2018}
|
|
Kyle Cook.
|
|
\newblock {\em {RAGE}: {The} {Rage} {Attack} {Graph} {Engine}}.
|
|
\newblock PhD thesis, 2018.
|
|
|
|
\bibitem{cook_scalable_2016}
|
|
Kyle Cook, Thomas Shaw, John Hale, and Peter Hawrylak.
|
|
\newblock Scalable attack graph generation.
|
|
\newblock {\em Proceedings of the 11th Annual Cyber and Information Security
|
|
Research Conference, CISRC 2016}, 2016.
|
|
|
|
\bibitem{CVE-2019-10747}
|
|
{set-value is vulnerable to Prototype Pollution in versions lower than 3.0.1.
|
|
The function mixin-deep could be tricked into adding or modifying properties
|
|
of Object.prototype using any of the constructor, prototype and $\_$proto$\_$
|
|
payloads.}
|
|
\newblock National Vulnerability Database, August 2019.
|
|
|
|
\bibitem{dai_fpgp_2016}
|
|
Guohao Dai, Yuze Chi, Yu~Wang, and Huazhong Yang.
|
|
\newblock {FPGP}: {Graph} processing framework on {FPGA}: {A} case study of
|
|
breadth-first search.
|
|
\newblock {\em FPGA 2016 - Proceedings of the 2016 ACM/SIGDA International
|
|
Symposium on Field-Programmable Gate Arrays}, pages 105--110, 2016.
|
|
|
|
\bibitem{j_hale_compliance_nodate}
|
|
{J. Hale}, P.~Hawrylak, and M.~Papa.
|
|
\newblock Compliance {Method} for a {Cyber}-{Physical} {System}.
|
|
|
|
\bibitem{7087377}
|
|
Kerem Kaynar and Fikret Sivrikaya.
|
|
\newblock Distributed attack graph generation.
|
|
\newblock {\em IEEE Transactions on Dependable and Secure Computing},
|
|
13(5):519--532, 2016.
|
|
|
|
\bibitem{li_combining_2019}
|
|
Ming Li, Peter Hawrylak, and John Hale.
|
|
\newblock Combining {OpenCL} and {MPI} to support heterogeneous computing on a
|
|
cluster.
|
|
\newblock {\em ACM International Conference Proceeding Series}, 2019.
|
|
|
|
\bibitem{li_concurrency_2019}
|
|
Ming Li, Peter Hawrylak, and John Hale.
|
|
\newblock Concurrency {Strategies} for {Attack} {Graph} {Generation}.
|
|
\newblock {\em Proceedings - 2019 2nd International Conference on Data
|
|
Intelligence and Security, ICDIS 2019}, pages 174--179, 2019.
|
|
|
|
\bibitem{9150145}
|
|
Ming Li, Peter~J. Hawrylak, and John Hale.
|
|
\newblock Implementing an attack graph generator in cuda.
|
|
\newblock In {\em 2020 IEEE International Parallel and Distributed Processing
|
|
Symposium Workshops (IPDPSW)}, pages 730--738, 2020.
|
|
|
|
\bibitem{liakos_memory-optimized_2016}
|
|
Panagiotis Liakos, Katia Papakonstantinopoulou, and Alex Delis.
|
|
\newblock Memory-{Optimized} {Distributed} {Graph} {Processing} through {Novel}
|
|
{Compression} {Techniques}.
|
|
\newblock In {\em {CIKM} '16: {Proceedings} of the 25th {ACM} {International}
|
|
{Conference} on {Information} and {Knowledge} {Management}}, pages
|
|
2317--2322, October 2016.
|
|
|
|
\bibitem{louthan_hybrid_2011}
|
|
G~Louthan.
|
|
\newblock {\em Hybrid {Attack} {Graphs} for {Modeling} {Cyber}-{Physical}
|
|
{Systems}}.
|
|
\newblock PhD thesis, 2011.
|
|
|
|
\bibitem{ou_scalable_2006}
|
|
Xinming Ou, Wayne~F Boyer, and Miles~A Mcqueen.
|
|
\newblock A {Scalable} {Approach} to {Attack} {Graph} {Generation}.
|
|
\newblock pages 336--345, 2006.
|
|
|
|
\bibitem{phillips_graph-based_1998}
|
|
Cynthia Phillips and Laura~Painton Swiler.
|
|
\newblock A graph-based system for network-vulnerability analysis.
|
|
\newblock {\em Proceedings New Security Paradigms Workshop}, Part F1292:71--79,
|
|
1998.
|
|
|
|
\bibitem{schneier_modeling_1999}
|
|
Bruce Schneier.
|
|
\newblock Modeling {Security} {Threats}, 1999.
|
|
\newblock Publication Title: Dr. Dobb's Journal.
|
|
|
|
\bibitem{sheyner_automated_2002}
|
|
O.~Sheyner, J.~Haines, S.~Jha, R.. Lippmann, and J.~Wing.
|
|
\newblock Automated {Generation} and {Analysis} of {Attack} {Graphs}.
|
|
\newblock {\em Proceeding of 2002 IEEE Symposium on Security and Privacy},
|
|
pages 254--265, 2002.
|
|
|
|
\bibitem{yao_efficient_2018}
|
|
Pengcheng Yao, Long Zheng, Xiaofei Liao, Hai Jin, and Bingsheng He.
|
|
\newblock An efficient graph accelerator with parallel data conflict
|
|
management.
|
|
\newblock {\em Parallel Architectures and Compilation Techniques - Conference
|
|
Proceedings, PACT}, 2018.
|
|
|
|
\bibitem{yu_construction_2018}
|
|
Xinjie Yu, Wentao Chen, Jiajia Miao, Jian Chen, Handong Mao, Qiong Luo, and Lin
|
|
Gu.
|
|
\newblock The {Construction} of {Large} {Graph} {Data} {Structures} in a
|
|
{Scalable} {Distributed} {Message} {System}.
|
|
\newblock In {\em {HPCCT} 2018: {Proceedings} of the 2018 2nd {High}
|
|
{Performance} {Computing} and {Cluster} {Technologies} {Conference}}, pages
|
|
6--10, June 2018.
|
|
|
|
\bibitem{zhang_boosting_2017}
|
|
Jialiang Zhang, Soroosh Khoram, and Jing Li.
|
|
\newblock Boosting the performance of {FPGA}-based graph processor using hybrid
|
|
memory cube: {A} case for breadth first search.
|
|
\newblock {\em FPGA 2017 - Proceedings of the 2017 ACM/SIGDA International
|
|
Symposium on Field-Programmable Gate Arrays}, pages 207--216, 2017.
|
|
|
|
\end{thebibliography}
|