{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T15:42:37Z","timestamp":1743090157332,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031224751"},{"type":"electronic","value":"9783031224768"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-22476-8_4","type":"book-chapter","created":{"date-parts":[[2022,11,30]],"date-time":"2022-11-30T12:03:51Z","timestamp":1669809831000},"page":"55-72","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Automatic Generation of\u00a0Verified Concurrent Hardware Using VHDL"],"prefix":"10.1007","author":[{"given":"Luciano","family":"Silva","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcel","family":"Oliveira","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,12,1]]},"reference":[{"key":"4_CR1","volume-title":"Concurrency in ADA","author":"A Burns","year":"1997","unstructured":"Burns, A., Wellings, A.: Concurrency in ADA, 2nd edn. Cambridge University Press, Cambridge (1997)","edition":"2"},{"key":"4_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-4042-7","volume-title":"Hardware Design and Simulation in VAL\/VHDL","author":"LM Augustin","year":"1991","unstructured":"Augustin, L.M., Luckham, D.C., Gennart, B.A., Huh, Y., Stanculescu, A.G.: Hardware Design and Simulation in VAL\/VHDL. Kluwer Academic Pub, Dordrecht (1991)"},{"key":"4_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-3572-0","volume-title":"Field-Programmable Gate Arrays","author":"SD Brown","year":"1992","unstructured":"Brown, S.D., Francis, R.J., Rose, J., Vranesic, Z.G.: Field-Programmable Gate Arrays. Kluwer Academic Publishers, USA (1992)"},{"issue":"2\u20133","key":"4_CR4","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/s00165-003-0006-5","volume":"15","author":"ALC Cavalcanti","year":"2003","unstructured":"Cavalcanti, A.L.C., Sampaio, A.C.A., Woodcock, J.C.P.: A refinement strategy for Circus. Formal Aspects Comput. 15(2\u20133), 146\u2013181 (2003)","journal-title":"Formal Aspects Comput."},{"key":"4_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/11813040_9","volume-title":"FM 2006: Formal Methods","author":"A Freitas","year":"2006","unstructured":"Freitas, A., Cavalcanti, A.: Automatic translation from Circus to Java. In: Misra, J., Nipkow, T., Sekerinski, E. (eds.) FM 2006. LNCS, vol. 4085, pp. 115\u2013130. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11813040_9"},{"key":"4_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/978-3-642-54862-8_13","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"T Gibson-Robinson","year":"2014","unstructured":"Gibson-Robinson, T., Armstrong, P., Boulgakov, A., Roscoe, A.W.: FDR3 \u2014 a modern refinement checker for CSP. In: \u00c1brah\u00e1m, E., Havelund, K. (eds.) TACAS 2014. LNCS, vol. 8413, pp. 187\u2013201. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54862-8_13"},{"key":"4_CR7","volume-title":"Communicating Sequential Processes","author":"CAR Hoare","year":"1985","unstructured":"Hoare, C.A.R.: Communicating Sequential Processes. Prentice-Hall, Hoboken (1985)"},{"key":"4_CR8","volume-title":"Concurrent Systems: Formal Development in CSP","author":"MG Hinchey","year":"1995","unstructured":"Hinchey, M.G., Jarvis, S.A.: Concurrent Systems: Formal Development in CSP. McGraw-Hill Inc, New York (1995)"},{"key":"4_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-29473-5_1","volume-title":"Formal Methods: Foundations and Applications - 18th Brazilian Symposium on Formal Methods","author":"FJS Mac\u00e1rio","year":"2015","unstructured":"Mac\u00e1rio, F.J.S., Oliveira, M.V.M.: Hard-wiring CSP hiding: implementing channel abstraction to generate veried concurrent hardware. In: Corn\u00e9lio, M., Roscoe, B. (eds.) Formal Methods: Foundations and Applications - 18th Brazilian Symposium on Formal Methods. Lecture Notes in Computer Science, vol. 9526, pp. 3\u201318. The original publication is available at www.springerlink.com, Springer-Verlag (2015)"},{"key":"4_CR10","unstructured":"McMillin, B., Arrowsmith, E.: CCSP-a formal system for distributed program debugging. In: Proceedings of the Software for Multiprocessors and Supercomputers, Theory, Practice, Experience, Moscow - Russia, (1994)"},{"key":"4_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/978-3-540-30482-1_29","volume-title":"Formal Methods and Software Engineering","author":"M Oliveira","year":"2004","unstructured":"Oliveira, M., Cavalcanti, A.: From Circus to JCSP. In: Davies, J., Schulte, W., Barnett, M. (eds.) ICFEM 2004. LNCS, vol. 3308, pp. 320\u2013340. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30482-1_29"},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/978-3-642-40561-7_4","volume-title":"Software Engineering and Formal Methods","author":"MVM Oliveira","year":"2013","unstructured":"Oliveira, M.V.M., De Medeiros J\u00fanior, I.S., Woodcock, J.: A verified protocol to implement multi-way synchronisation and interleaving in CSP. In: Hierons, R.M., Merayo, M.G., Bravetti, M. (eds.) SEFM 2013. LNCS, vol. 8137, pp. 46\u201360. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40561-7_4"},{"key":"4_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/978-3-540-76650-6_17","volume-title":"Formal Methods and Software Engineering","author":"M Oliveira","year":"2007","unstructured":"Oliveira, M., Woodcock, J.: Automatic generation of verified concurrent hardware. In: Butler, M., Hinchey, M.G., Larrondo-Petrie, M.M. (eds.) ICFEM 2007. LNCS, vol. 4789, pp. 286\u2013306. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-76650-6_17"},{"key":"4_CR14","unstructured":"Phillips, J.D., Stiles,G.S.: An automatic translation of CSP to Handel-C. In: East, I., Martin, J., Welch, P., Duce, D., Green, M., (eds), Communicating Process Architectures 2004, pp. 19\u201338 (2004)"},{"key":"4_CR15","unstructured":"Raju, V., Rong, L., Stiles, G.S.: Automatic conversion of CSP to CTJ, JCSP, and CCSP. In: Broenink, J.F., Hilderink, G.H., (eds), Communicating Process Architectures 2003, pp. 63\u201381 (2003)"},{"key":"4_CR16","volume-title":"The Theory and Practice of Concurrency","author":"AW Roscoe","year":"1998","unstructured":"Roscoe, A.W.: The Theory and Practice of Concurrency. Prentice-Hall Series in Computer Science. Prentice-Hall, Hoboken (1998)"},{"key":"4_CR17","volume-title":"Concurrent and Real Time Systems: The CSP Approach","author":"S Schneider","year":"1999","unstructured":"Schneider, S.: Concurrent and Real Time Systems: The CSP Approach, 1st edn. John Wiley, New York (1999)","edition":"1"},{"key":"4_CR18","volume-title":"Software Engineering","author":"I Sommerville","year":"2010","unstructured":"Sommerville, I.: Software Engineering, 9th edn. Addison-Wesley, Boston (2010)","edition":"9"},{"key":"4_CR19","unstructured":"Stepney, S.: CSP\/FDR2 to Handel-C translation. Technical report YCS-2002-357, Department of Computer Science, University of York (2003)"},{"key":"4_CR20","unstructured":"Welch, P.H.: Process oriented design for Java: concurrency for all. In: Arabnia, H.R., editor, Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, pp. 51\u201357. CSREA Press (2000)"},{"key":"4_CR21","volume-title":"Using Z-Specification, Refinement, and Proof","author":"JCP Woodcock","year":"1996","unstructured":"Woodcock, J.C.P., Davies, J.: Using Z-Specification, Refinement, and Proof. Prentice-Hall, Hoboken (1996)"}],"container-title":["Lecture Notes in Computer Science","Formal Methods: Foundations and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22476-8_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,30]],"date-time":"2022-11-30T12:04:28Z","timestamp":1669809868000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22476-8_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031224751","9783031224768"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22476-8_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 December 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SBMF","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brazilian Symposium on Formal Methods","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 December 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 December 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sbmf2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/dcomp.ufs.br\/sbmf2022","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"15","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"8","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"53% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}