\begin{thebibliography}{10} \bibitem{phillips_graph-based_1998} C.~Phillips and L.~P. Swiler, ``A graph-based system for network-vulnerability analysis,'' {\em Proceedings New Security Paradigms Workshop}, vol.~Part F1292, pp.~71--79, 1998. \newblock doi: 10.1145/310889.310919. \bibitem{schneier_modeling_1999} B.~Schneier, ``Modeling {Security} {Threats},'' {\em Dr. Dobb's Journal}, 1999. \newblock vol. 24, no.12. \bibitem{ou_scalable_2006} X.~Ou, W.~F. Boyer, and M.~A. Mcqueen, ``A {Scalable} {Approach} to {Attack} {Graph} {Generation},'' {\em CCS '06: Proceedings of the 13th ACM conference on Computer and communications security}, pp.~336--345, 2006. \bibitem{sheyner_automated_2002} O.~Sheyner, J.~Haines, S.~Jha, R.~Lippmann, and J.~Wing, ``Automated {Generation} and {Analysis} of {Attack} {Graphs},'' {\em Proceeding of 2002 IEEE Symposium on Security and Privacy}, pp.~254--265, 2002. \bibitem{zhang_boosting_2017} J.~Zhang, S.~Khoram, and J.~Li, ``Boosting the performance of {FPGA}-based graph processor using hybrid memory cube: {A} case for breadth first search,'' {\em FPGA 2017 - Proceedings of the 2017 ACM/SIGDA International Symposium on Field-Programmable Gate Arrays}, pp.~207--216, 2017. \bibitem{j_hale_compliance_nodate} {J. Hale}, P.~Hawrylak, and M.~Papa, ``Compliance {Method} for a {Cyber}-{Physical} {System}.'' \newblock U.S. Patent Number 9,471,789, Oct. 18, 2016. \bibitem{baloyi_guidelines_2019} N.~Baloyi and P.~Kotzé, ``Guidelines for {Data} {Privacy} {Compliance}: {A} {Focus} on {Cyberphysical} {Systems} and {Internet} of {Things},'' in {\em {SAICSIT} '19: {Proceedings} of the {South} {African} {Institute} of {Computer} {Scientists} and {Information} {Technologists} 2019}, (Skukuza South Africa), Association for Computing Machinery, 2019. \bibitem{allman_complying_2006} E.~Allman, ``Complying with {Compliance}: {Blowing} it off is not an option.,'' {\em ACM Queue}, vol.~4, no.~7, 2006. \bibitem{noauthor_sarbanes-oxley_2002} ``Sarbanes-{Oxley} {Act} of 2002.'' \newblock Pub. L. No. 107-204. 2002 [Online]. Available: https://www.govinfo.gov/content/pkg/PLAW-107publ204/html/PLAW-107publ204.htm. \bibitem{noauthor_health_1996} ``Health {Insurance} {Portability} and {Accountability} {Act} of 1996.'' \newblock Pub. L. No. 104-191. 1996 [Online]. Available: https://www.govinfo.gov/content/pkg/PLAW-104publ191/html/PLAW-104publ191.htm. \bibitem{EUdataregulations2018} T.~E. Parliment and the Council of~the European~Union, ``Regulation (eu) 2016/679 of the {European} {Parliament} and of the {Council} of 27.'' \newblock Available: https://eur-lex.europa.eu/legal-content/EN/TXT/PDF/?uri=CELEX:32016R0679. \bibitem{PCI} P.~S.~S. Council, ``Payment {Card} {Industry} {(PCI)} {Data} {Security} {Standard},'' May 2018. \newblock {Available: https://www.pcisecuritystandards.org/documents/PCI$\_$DSS$\_$v3-2-1.pdf}. \bibitem{cook_rage_2018} K.~Cook, {\em {RAGE}: {The} {Rage} {Attack} {Graph} {Engine}}. \newblock PhD thesis, The {University} of {Tulsa}, 2018. \bibitem{berry_graph_2007} J.~Berry and B.~Hendrickson, ``Graph {Analysis} with {High} {Performance} {Computing}.,'' {\em Computing in Science and Engineering}, 2007. \bibitem{ainsworth_graph_2016} S.~Ainsworth and T.~M. Jones, ``Graph prefetching using data structure knowledge,'' {\em Proceedings of the International Conference on Supercomputing}, vol.~01-03-June, 2016. \bibitem{yao_efficient_2018} P.~Yao, L.~Zheng, X.~Liao, H.~Jin, and B.~He, ``An efficient graph accelerator with parallel data conflict management,'' {\em Parallel Architectures and Compilation Techniques - Conference Proceedings, PACT}, 2018. \bibitem{dai_fpgp_2016} G.~Dai, Y.~Chi, Y.~Wang, and H.~Yang, ``{FPGP}: {Graph} processing framework on {FPGA}: {A} case study of breadth-first search,'' {\em FPGA 2016 - Proceedings of the 2016 ACM/SIGDA International Symposium on Field-Programmable Gate Arrays}, pp.~105--110, 2016. \bibitem{arifuzzaman_fast_2015} S.~Arifuzzaman and M.~Khan, ``Fast parallel conversion of edge list to adjacency list for large-scale graphs,'' in {\em {HPC} '15: {Proceedings} of the {Symposium} on {High} {Performance} {Computing}}, pp.~17--24, Apr. 2015. \bibitem{yu_construction_2018} X.~Yu, W.~Chen, J.~Miao, J.~Chen, H.~Mao, Q.~Luo, and L.~Gu, ``The {Construction} of {Large} {Graph} {Data} {Structures} in a {Scalable} {Distributed} {Message} {System},'' in {\em {HPCCT} 2018: {Proceedings} of the 2018 2nd {High} {Performance} {Computing} and {Cluster} {Technologies} {Conference}}, pp.~6--10, June 2018. \bibitem{liakos_memory-optimized_2016} P.~Liakos, K.~Papakonstantinopoulou, and A.~Delis, ``Memory-{Optimized} {Distributed} {Graph} {Processing} through {Novel} {Compression} {Techniques},'' in {\em {CIKM} '16: {Proceedings} of the 25th {ACM} {International} {Conference} on {Information} and {Knowledge} {Management}}, pp.~2317--2322, Oct. 2016. \bibitem{balaji_graph_2016} J.~Balaji and R.~Sunderraman, ``Graph {Topology} {Abstraction} for {Distributed} {Path} {Queries},'' in {\em {HPGP} '16: {Proceedings} of the {ACM} {Workshop} on {High} {Performance} {Graph} {Processing}}, pp.~27--34, May 2016. \bibitem{noauthor_overview_nodate} ``An {Overview} of the {Parallel} {Boost} {Graph} {Library} - 1.75.0,'' 2009. \bibitem{noauthor_boost_nodate} J.~Siek, L.-Q. Lee, and A.~Lumsdaine, ``The {Boost} {Graph} {Library}, vers. 1.75.0.'' \newblock {https://www.boost.org/doc/libs/1$\_$75$\_$0/libs/graph/doc/index.html}. \bibitem{cook_scalable_2016} K.~Cook, T.~Shaw, J.~Hale, and P.~Hawrylak, ``Scalable attack graph generation,'' {\em Proceedings of the 11th Annual Cyber and Information Security Research Conference, CISRC 2016}, 2016. \bibitem{li_concurrency_2019} M.~Li, P.~Hawrylak, and J.~Hale, ``Concurrency {Strategies} for {Attack} {Graph} {Generation},'' {\em Proceedings - 2019 2nd International Conference on Data Intelligence and Security, ICDIS 2019}, pp.~174--179, 2019. \bibitem{9150145} M.~Li, P.~J. Hawrylak, and J.~Hale, ``Implementing an attack graph generator in cuda,'' in {\em 2020 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)}, pp.~730--738, 2020. \bibitem{7087377} K.~Kaynar and F.~Sivrikaya, ``Distributed attack graph generation,'' {\em IEEE Transactions on Dependable and Secure Computing}, vol.~13, no.~5, pp.~519--532, 2016. \bibitem{Graphviz} {The Graphviz Authors}, ``{DOT} {Language}.'' \newblock https://graphviz.org/doc/info/lang.html. \bibitem{nichols_2018} W.~M. Nichols, {\em {Hybrid} {Attack} {Graphs} for {Use} with a {Simulation} of a {Cyber-Physical} {System}}. \newblock PhD thesis, The {University} of {Tulsa}, 2018. \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.}.'' National Vulnerability Database, Aug. 2019. \bibitem{li_combining_2019} M.~Li, P.~Hawrylak, and J.~Hale, ``Combining {OpenCL} and {MPI} to support heterogeneous computing on a cluster,'' {\em ACM International Conference Proceeding Series}, 2019. \bibitem{louthan_hybrid_2011} G.~Louthan, {\em Hybrid {Attack} {Graphs} for {Modeling} {Cyber}-{Physical} {Systems}}. \newblock PhD thesis, The {University} of {Tulsa}, 2011. \bibitem{pacheco_introduction_2011} P.~Pacheco, {\em An {Introduction} to {Parallel} {Programming}}. \newblock Morgan Kaufmann, print~ed., 2011. \bibitem{lawrence_livermore_national_laboratory_mpip_nodate} {Lawrence Livermore National Laboratory}, ``mpi{P}, a light-weight {MPI} profiler.'' \newblock https://software.llnl.gov/mpiP/. \end{thebibliography}