{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:40:43Z","timestamp":1725493243441},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540651918"},{"type":"electronic","value":"9783540495192"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/3-540-49519-3_29","type":"book-chapter","created":{"date-parts":[[2007,10,20]],"date-time":"2007-10-20T06:37:12Z","timestamp":1192862232000},"page":"451-468","source":"Crossref","is-referenced-by-count":0,"title":["An Instruction Set Process Calculus"],"prefix":"10.1007","author":[{"given":"Shiu -Kai","family":"Chin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jang Dae","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,5,17]]},"reference":[{"key":"29_CR1","doi-asserted-by":"crossref","unstructured":"M. R. Barbacci. Instruction Set Processor Specifications ISPS: The Notation and its Applications. IEEE Trans. Comp., C-30(7), January 1981.","DOI":"10.1109\/TC.1981.6312154"},{"key":"29_CR2","volume-title":"Digital Computer Fundamentals \u2014 Sixth Edition","author":"T. C. Bartee","year":"1984","unstructured":"Thomas C. Bartee. Digital Computer Fundamentals \u2014 Sixth Edition. McGraw Hill New York, 1984."},{"key":"29_CR3","unstructured":"Gerard Berry. The Foundations of Esterel. In G. Plotkin C. Stirling and M. Tofte, editors, Proof, Language, and Interaction: Essays in Honour of Robin Milner. MIT Press, 1998."},{"key":"29_CR4","unstructured":"Christopher R. Clare. Designing Logic Systems Using State Machines. McGraw Hill, 1973."},{"key":"29_CR5","volume-title":"Computer Structures \u2014 Principles and Examples","author":"D. Siewiorek","year":"1982","unstructured":"D. Siewiorek, C. Bell, and A. Newell. Computer Structures \u2014 Principles and Examples. McGraw-Hill New York, 1982."},{"key":"29_CR6","doi-asserted-by":"crossref","unstructured":"M.J.C. Gordon. A proof generating system for higher-order logic. In G. Birtwistle and P. A. Subramanyam, editors, VLSI specification, verification and synthesis. Kluwer, 1987.","DOI":"10.1007\/978-1-4613-2007-4_3"},{"key":"29_CR7","doi-asserted-by":"crossref","unstructured":"Gordon L. Smith, Ralph Bahnsen, and Harry Halliwell. Boolean Comparison of Hardware and Flowcharts. IBM J. Res. Develop., 26(1):106\u2013116, January 1982.","DOI":"10.1147\/rd.261.0106"},{"key":"29_CR8","volume-title":"Switching and Finite Automata Theory","author":"Z. Kohavi","year":"1982","unstructured":"Z. Kohavi. Switching and Finite Automata Theory. McGraw-Hill New York, 1982."},{"key":"29_CR9","volume-title":"Proceedings of the 1991 International Tutorial and Workshop on the HOL Theorem Proving system","author":"T. F. Melham","year":"1991","unstructured":"T. F. Melham. A Package for Inductive Relation Definitions in HOL. In Proceedings of the 1991 International Tutorial and Workshop on the HOL Theorem Proving system. IEEE Computer Society Press, Davis, California, August 1991."},{"key":"29_CR10","doi-asserted-by":"crossref","unstructured":"George Milne. Circal and the representation of communication, concurrency and time. In ACM Transactions on Programming Languages and Systems, April 1985.","DOI":"10.1145\/3318.3322"},{"key":"29_CR11","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/0304-3975(83)90114-7","volume":"25","author":"R. Milner","year":"1983","unstructured":"Robin Milner. Calculi for synchrony and asynchrony. Theoretical Computer Science, 25:267\u2013310, 1983.","journal-title":"Theoretical Computer Science"},{"key":"29_CR12","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"Robin Milner. Communication and Concurrency. Prentice Hall, New York, 1989."},{"key":"29_CR13","unstructured":"Monica Nesi. A Formalization of the Process Algebra CCS in Higher Order Logic. Technical Report 278, University of Cambridge, December 1992."},{"key":"29_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/3-540-60915-6_5","volume-title":"Logics for Concurrency","author":"C. Stirling","year":"1996","unstructured":"Colin Stirling. Modal and Temporal Logics for Processes. In Logics for Concurrency, number 1043 in Lecture Notes in Computer Science, pages 149\u2013237. Springer-Verlag, 1996."}],"container-title":["Lecture Notes in Computer Science","Formal Methods in Computer-Aided Design"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-49519-3_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T17:59:04Z","timestamp":1556906344000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-49519-3_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540651918","9783540495192"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-49519-3_29","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1998]]}}}