{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T04:19:34Z","timestamp":1742617174343,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540565963"},{"type":"electronic","value":"9783540475958"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-56596-5_50","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:18:42Z","timestamp":1330255122000},"page":"639-659","source":"Crossref","is-referenced-by-count":1,"title":["Compiling joy into Silicon: An exercise in applied structural operational semantics"],"prefix":"10.1007","author":[{"given":"Sam","family":"Weber","sequence":"first","affiliation":[]},{"given":"Bard","family":"Bloom","sequence":"additional","affiliation":[]},{"given":"Geoffrey","family":"Brown","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"J. C. M. Baeten and W. P. Weijland. Process Algebra. Cambridge Tracts in Theoretical Computer Science 18. Cambridge University Press, 1990.","DOI":"10.1017\/CBO9780511624193"},{"key":"25_CR2","unstructured":"H. P. Barendregt. The Lambda Calculus: Its Syntax and Semantics, volume 103 of Studies in Logic. North-Holland, 1981. Revised Edition, 1984."},{"key":"25_CR3","unstructured":"H. Bisseling, H. Eemers, M. Kamps, and A. Peeters. Designing delay-insensitive circuits. Technical report, 1990."},{"key":"25_CR4","unstructured":"B. Bloom. Partial traces and the semantics and logic of ccs-like languages. Technical Report 89\u20131066, Cornell, 1989."},{"key":"25_CR5","unstructured":"B. Bloom. Ready Simulation, Bisimulation, and the Semantics of CCS-Like Languages. PhD thesis, Massachusetts Institute of Technology, Aug. 1989."},{"key":"25_CR6","unstructured":"E. Brunvand and R. F. Sproull. Translating concurrent communicating programs into delay-insensitive circuits. Technical Report CMU-CS-89-126, Carnegie-Mellon University, 1989."},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"S. M. Burns and A. J. Martin. Syntax-directed translation of concurrent programs into self-timed circuits. In Advanced Research in VLSI: Proceedings of the 5th MIT Conference, pages 35\u201350, 1988.","DOI":"10.21236\/ADA447033"},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"W. A. Clark and C. E. Molnar. Macromodular computer systems. In B. Waxman and R. Stacey, editors, Biomedical Research Vol. IV, pages 45\u201385. Academic, New York.","DOI":"10.1145\/1465482.1465536"},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"D. L. Dill. Trace Theory for Automatic Hierarchical Verification of Speed-Independent Circuits. MIT Press, 1989.","DOI":"10.7551\/mitpress\/6874.001.0001"},{"issue":"12","key":"25_CR10","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1112\/jlms\/s2-12.3.361","volume":"2","author":"J. Hyland","year":"1976","unstructured":"J. Hyland. A syntactic characterization of the equality in some models of the \u03bb-calculus. J. London Math. Soc, 2(12):361\u2013370, 1976.","journal-title":"J. London Math. Soc"},{"issue":"1","key":"25_CR11","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1109\/T-C.1974.223773","volume":"C-23","author":"R. M. Keller","year":"1974","unstructured":"R. M. Keller. Towards a theory of universal speed-independent modules. IEEE Transactions on Computers, C-23(1):21\u201333, January 1974.","journal-title":"IEEE Transactions on Computers"},{"key":"25_CR12","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1007\/BF01660034","volume":"1","author":"A. J. Martin","year":"1986","unstructured":"A. J. Martin. Compiling communicating processes into delay-insensitive VLSI circuits. Distributed Computing, 1:226\u2013234, 1986.","journal-title":"Distributed Computing"},{"key":"25_CR13","unstructured":"G. J. Milne. The Correctness of a Simple Silicon Compiler., pages 1\u201312. North-Holland, 1983."},{"key":"25_CR14","doi-asserted-by":"crossref","unstructured":"R. Milner. A modal characterisation of observable machine-behaviour. In E. Astesiano and C. B\u00f6hm, editors, CAAP '81: Trees in Algebra and Programming, 6th Colloquium, volume 112 of Lect. Notes in Computer Sci., pages 25\u201334. Springer-Verlag, 1981.","DOI":"10.1007\/3-540-10828-9_52"},{"key":"25_CR15","volume-title":"Prentice Hall International Series in Computer Science","author":"R. Milner","year":"1989","unstructured":"R. Milner. Communication and Concurrency. Prentice Hall International Series in Computer Science. Prentice Hall, New York, 1989."},{"key":"25_CR16","unstructured":"C. E. Molnar, T.-P. Fang, and F. U. Rosenbeiger. Synthesis of delay-insensitive modules. In H. Fuchs, editor, Chapel Hill Conference on VLSI, pages 67\u201386, 1985."},{"key":"25_CR17","doi-asserted-by":"crossref","unstructured":"D. Park. Concurrency and automata on infinite sequences. In P. Deussen, editor, Theoretical Computer Science, Lect. Notes in Computer Sci., page 261. Springer-Verlag, 1981.","DOI":"10.1007\/BFb0017309"},{"key":"25_CR18","volume-title":"Technical Report DAIMI FN-19","author":"G. Plotkin","year":"1981","unstructured":"G. Plotkin. A structural approach to operational semantics. Technical Report DAIMI FN-19, Aarhus University, Computer Science Department, Denmark, 1981."},{"issue":"3","key":"25_CR19","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0304-3975(77)90044-5","volume":"5","author":"G. D. Plotkin","year":"1977","unstructured":"G. D. Plotkin. LCF considered as a programming language. Theoretical Computer Sci., 5(3):223\u2013255, 1977.","journal-title":"Theoretical Computer Sci."},{"key":"25_CR20","volume-title":"Asynchronous Systems","author":"R. Sproull","year":"1986","unstructured":"R. Sproull and I. E. Sutherland. Asynchronous Systems. Sutherland, Sproull & Associates, 1986."},{"key":"25_CR21","unstructured":"J. Staunstrup and M. Greenstreet. Atomicity, programs, and hardware. Technical Report ID-TR 198-46, Technical University of Denmark, 1990."},{"key":"25_CR22","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1007\/BF01661169","volume":"1","author":"M. J. F. T. S. Anantharaman","year":"1986","unstructured":"M. J. F. T. S. Anantharaman, E. M. Clarke and B. Mishra. Compiling path expressions into vlsi circuits. Distributed Computing, 1:150\u2013166, 1986.","journal-title":"Distributed Computing"},{"key":"25_CR23","doi-asserted-by":"crossref","unstructured":"F. Vaandrager. On the relationship between process algebra and input\/output automata. In Sixth annual IEEE symposium on Logic in Computer Science, pages 387\u2013389. IEEE Computer Society Press, 1991.","DOI":"10.1109\/LICS.1991.151662"},{"key":"25_CR24","unstructured":"C. H. K. van Berkel, C. Niessen, M. Rem, and R. W. Saeijs. VLSI programming and silicon compilation; a novel approach from philips research. In ICCD, 1988."},{"key":"25_CR25","unstructured":"K. van Berkel. Handshake Circuits: an intermediary between communicating processes and VLSI. PhD thesis, Technische Universiteit Eindhoven, 1992."},{"key":"25_CR26","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1137\/0205036","volume":"5","author":"C. Wadsworth","year":"1976","unstructured":"C. Wadsworth. The relation between computational and denotational properties for Scott's D\u221e-models of the \u03bb-calculus. SIAM J. Comput., 5:488\u2013521, 1976.","journal-title":"SIAM J. Comput."},{"key":"25_CR27","unstructured":"S. Weber, B. Bloom, and G. Brown. Compiling Joy to silicon: A verified silicon compilation scheme. In T. Knight and J. Savage, editors, Proceedings of the Advanced Research in VLSI and Parallel Systems Conference, pages 79\u201398. 1992."},{"key":"25_CR28","unstructured":"A. K. Wright and M. Felleisen. A syntactic approach to type soundness. Technical Report TR91-160, Rice University, 1991."}],"container-title":["Lecture Notes in Computer Science","Semantics: Foundations and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56596-5_50.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T21:50:14Z","timestamp":1742593814000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56596-5_50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540565963","9783540475958"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/3-540-56596-5_50","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}