{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:50:25Z","timestamp":1750308625219,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,11,2]],"date-time":"2011-11-02T00:00:00Z","timestamp":1320192000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2011,11,2]]},"DOI":"10.1145\/2103380.2103436","type":"proceedings-article","created":{"date-parts":[[2012,1,17]],"date-time":"2012-01-17T17:20:41Z","timestamp":1326820841000},"page":"272-276","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["A unified design method utilizing decomposability and composability for secure systems"],"prefix":"10.1145","author":[{"given":"Edward","family":"Jung","sequence":"first","affiliation":[{"name":"Southern Polytechnic State Univ., Marietta, GA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chih-Cheng","family":"Hung","sequence":"additional","affiliation":[{"name":"Southern Polytechnic State Univ., Marietta, GA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guangzhi","family":"Ma","sequence":"additional","affiliation":[{"name":"Huazhong Univ. of Science and Technology, Wuhan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Seonho","family":"Choi","sequence":"additional","affiliation":[{"name":"Bowie State University, Bowie, MD"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2011,11,2]]},"reference":[{"key":"#cr-split#-e_1_3_2_1_1_1.1","unstructured":"DHS Science and Technology \"A Roadmap for Cybersecurity Research.\" 2009. <http:\/\/www.cyber.st.dhs.gov\/documents.html&gt"},{"key":"#cr-split#-e_1_3_2_1_1_1.2","unstructured":"DHS Science and Technology \"A Roadmap for Cybersecurity Research.\" 2009. <http:\/\/www.cyber.st.dhs.gov\/documents.html>"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2010.203"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/43.41505"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/PGEC.1964.263726"},{"key":"e_1_3_2_1_5_1","unstructured":"J. Hartmanis and R. E. Sterns 1966. Algebraic Structure Theory of Sequential Machines. Prentice-Hall.   J. Hartmanis and R. E. Sterns 1966. Algebraic Structure Theory of Sequential Machines. Prentice-Hall."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/0016-0032(54)90574-8"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/PGEC.1964.263722"},{"key":"e_1_3_2_1_9_1","unstructured":"Z. Kohavi 1978 Switching and Finite Automata Theory. McGraw-Hill.   Z. Kohavi 1978 Switching and Finite Automata Theory. McGraw-Hill."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/32.481534"},{"issue":"5","key":"e_1_3_2_1_11_1","first-page":"1045","article-title":"A Method for Synthesizing Sequential Circuits","volume":"34","author":"Mealy G.","year":"1955","journal-title":"Journal"},{"key":"e_1_3_2_1_12_1","first-page":"4","article-title":"Optimal State Assignment of Finite State Machines","author":"Micheli G.","year":"1985","journal-title":"IEEE Trans. on Computer-Aided Design"},{"volume-title":"Principled Assuredly Trustworthy Composable Architectures, 6--29","year":"2004","author":"Neumann P. G.","key":"e_1_3_2_1_13_1"},{"volume-title":"Principled Assuredly Trustworthy Composable Architectures, 30--55","year":"2004","author":"Neumann P. G.","key":"e_1_3_2_1_14_1"},{"key":"e_1_3_2_1_15_1","first-page":"6","article-title":"The Architecture of Complexity","volume":"106","author":"Simon H. A.","year":"1962","journal-title":"Proc. of the American Philosophical Society"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEC.1961.5219265"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1653662.1653719"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEC.1961.5219264"},{"key":"e_1_3_2_1_19_1","first-page":"83","article-title":"An Algorithm for Nearly-Minimal Collapsing of Finite-State Machine Networks","volume":"80","author":"Wolf W.","year":"1990","journal-title":"IEEE"},{"key":"e_1_3_2_1_20_1","unstructured":"H. Zeiger \"Loop-free Synthesis of Finite-State Machines \" Ph.D. Dissertation Dept. of EE MIT Cambridge 1964.  H. Zeiger \"Loop-free Synthesis of Finite-State Machines \" Ph.D. Dissertation Dept. of EE MIT Cambridge 1964."}],"event":{"name":"RACS '11: Research in Applied Computation Symposium","sponsor":["SIGAPP ACM Special Interest Group on Applied Computing","ACCT Association of Convergent Computing Technology","CUSST University of Suwon: Center for U-city Security & Surveillance Technology of the University of Suwon","KIISE Korean Institute of Information Scientists and Engineers","KISTI"],"location":"Miami Florida","acronym":"RACS '11"},"container-title":["Proceedings of the 2011 ACM Symposium on Research in Applied Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2103380.2103436","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2103380.2103436","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T19:07:47Z","timestamp":1750273667000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2103380.2103436"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,11,2]]},"references-count":20,"alternative-id":["10.1145\/2103380.2103436","10.1145\/2103380"],"URL":"https:\/\/doi.org\/10.1145\/2103380.2103436","relation":{},"subject":[],"published":{"date-parts":[[2011,11,2]]},"assertion":[{"value":"2011-11-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}