{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T14:23:10Z","timestamp":1725459790129},"publisher-location":"Berlin\/Heidelberg","reference-count":15,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540530487"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0039064","type":"book-chapter","created":{"date-parts":[[2006,1,31]],"date-time":"2006-01-31T14:58:08Z","timestamp":1138719488000},"page":"246-262","source":"Crossref","is-referenced-by-count":1,"title":["An implementation of a translational semantics for an imperative language"],"prefix":"10.1007","author":[{"given":"Lars-\u00e5ke","family":"Fredlund","sequence":"first","affiliation":[]},{"given":"Bengt","family":"Jonsson","sequence":"additional","affiliation":[]},{"given":"Joachim","family":"Parrow","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"E. Astesiano and E. Zucca. Semantics of CSP via translation into CCS. In Mathematical Foundations of Computer Science, volume 118 of LNCS, pages 172\u2013182. Springer Verlag, 1981.","DOI":"10.1007\/3-540-10856-4_83"},{"key":"19_CR2","unstructured":"G. Boudol, R. de Simone, and D. Vergamini. Experiment with Auto and Autograph on a simple case sliding window protocol. Technical Report 870, Inria, July 1988."},{"issue":"5","key":"19_CR3","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1145\/362946.362970","volume":"2","author":"K. Bartlett","year":"1969","unstructured":"K. Bartlett, R. Scantlebury, and P. Wilkinson. A note on reliable full-duplex transmissions over half duplex lines. Communications of the ACM, 2(5):260\u2013261, 1969.","journal-title":"Communications of the ACM"},{"issue":"2","key":"19_CR4","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1145\/5397.5399","volume":"8","author":"E.M. Clarke","year":"1986","unstructured":"E.M. Clarke, E.A. Emerson, and A.P. Sistla. Automatic verification of finite-state concurrent systems using temporal logic specification. ACM Trans. on Programming Languages and Systems, 8(2):244\u2013263, April 1986.","journal-title":"ACM Trans. on Programming Languages and Systems"},{"key":"19_CR5","unstructured":"R. Cleaveland, J. Parrow, and B. Steffen. A semantics-based verification tool for finite-state systems. In Protocol Specification, Testing, and Verification IX, pages 287\u2013302, 1989. North-Holland."},{"key":"19_CR6","unstructured":"J.C. Godskesen, K.G. Larsen, and M. Zeeberg. TAV users manual. In Proc. Workshop on Automatic Verification Methods for Finite State Systems, Grenoble, 1989."},{"key":"19_CR7","unstructured":"M. Hennessy and W. Li. Translating a subset of Ada into CCS. In D. Bjoerner, editor, Formal Description of Programming Concepts II, pages 227\u2013249, Amsterdam, 1983. North-Holland."},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"L. Lamport. The mutual exclusion problem part II \u2014 statement and solutions. Journal of the ACM, 33(2), 1986.","DOI":"10.1145\/5383.5385"},{"key":"19_CR9","unstructured":"R. Milner. Communication and Concurrency. Prentice Hall, 1989."},{"key":"19_CR10","unstructured":"R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes, part I. Technical Report ECS-LFCS-89-85, Department of Computer Science, University of Edinburgh, 1989."},{"key":"19_CR11","unstructured":"R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes, part II. Technical Report ECS-LFCS-89-86, Department of Computer Science, University of Edinburgh, 1989."},{"key":"19_CR12","unstructured":"J.L. Peterson and A. Silberschatz. Operating System Concepts. Addison-Wesley, 1985."},{"key":"19_CR13","unstructured":"J. Richier, C. Rodriguez, J. Sifakis, and J. Voiron. Verification in XESAR of the sliding window protocol. In Protocol Specification, Testing, and Verification VII. North-Holland, 1987."},{"key":"19_CR14","unstructured":"S.A. Smolka and R.E. Strom. A CCS semantics for NIL. In M. Wirsing, editor, Formal Description of Programming Concepts III, pages 347\u2013368, Amsterdam, 1986. North-Holland."},{"key":"19_CR15","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/BF01887209","volume":"1","author":"D.J. Walker","year":"1989","unstructured":"D.J. Walker. Automated analysis of mutual exclusion algorithms using CCS. Formal Aspects of Computing, 1:273\u2013292, 1989.","journal-title":"Formal Aspects of Computing"}],"container-title":["Lecture Notes in Computer Science","CONCUR '90 Theories of Concurrency: Unification and Extension"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0039064.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T22:24:25Z","timestamp":1607552665000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0039064"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540530487"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/bfb0039064","relation":{},"subject":[]}}