{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T22:57:04Z","timestamp":1648940224124},"reference-count":26,"publisher":"Elsevier BV","issue":"1-5","license":[{"start":{"date-parts":[[1991,8,1]],"date-time":"1991-08-01T00:00:00Z","timestamp":681004800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Microprocessing and Microprogramming"],"published-print":{"date-parts":[[1991,8]]},"DOI":"10.1016\/0165-6074(91)90376-5","type":"journal-article","created":{"date-parts":[[2003,8,8]],"date-time":"2003-08-08T00:56:10Z","timestamp":1060304170000},"page":"393-400","source":"Crossref","is-referenced-by-count":0,"title":["An integrated software environment for large-scale Occam programming"],"prefix":"10.1016","volume":"32","author":[{"given":"Valmir C.","family":"Barbosa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L\u00facia Maria de A.","family":"Drummond","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Astrid Luise H.","family":"Hellmuth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0165-6074(91)90376-5_BIB1","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1002\/net.3230150404","article-title":"Reducing complexities of the distributed max-flow and breadth-first-search algorithms by means of network synchronization","volume":"15","author":"Awerbuch","year":"1985","journal-title":"Networks"},{"key":"10.1016\/0165-6074(91)90376-5_BIB2","doi-asserted-by":"crossref","first-page":"804","DOI":"10.1145\/4221.4227","article-title":"Complexity of network synchronization","volume":"32","author":"Awerbuch","year":"1985","journal-title":"J. ACM"},{"key":"10.1016\/0165-6074(91)90376-5_BIB3","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0304-3975(81)90110-9","article-title":"The temporal semantics of concurrent programs","volume":"13","author":"Pnueli","year":"1981","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/0165-6074(91)90376-5_BIB4","series-title":"Communicating Sequential Processes","author":"Hoare","year":"1984"},{"key":"10.1016\/0165-6074(91)90376-5_BIB5","series-title":"Proc. of the Annual ACM Symposium on Principles of Distributed Computing","first-page":"137","article-title":"Hierarchical correctness proofs for distributed algorithms","author":"Lynch","year":"1987"},{"key":"10.1016\/0165-6074(91)90376-5_BIB6","series-title":"Parallel Program Design: a Foundation","author":"Chandy","year":"1988"},{"key":"10.1016\/0165-6074(91)90376-5_BIB7","series-title":"Proc. of the Annual ACM Symposium on Principles of Distributed Computing","first-page":"28","article-title":"A lattice-structured proof technique applied to a minimum spanning tree algorithm","author":"Welch","year":"1988"},{"key":"10.1016\/0165-6074(91)90376-5_BIB8","series-title":"Proc. of the Annual ACM Symposium on Principles of Distributed Computing","first-page":"44","article-title":"Understanding and verifying distributed algorithms using stratified decomposition","author":"Chou","year":"1988"},{"key":"10.1016\/0165-6074(91)90376-5_BIB9","series-title":"Research Seminar Series MIT\/LCS\/RSS 5","article-title":"Distributed algorithms: lecture notes for 6.852, fall 1988","author":"Lynch","year":"1989"},{"key":"10.1016\/0165-6074(91)90376-5_BIB10","series-title":"Technical Report ES-237\/91","article-title":"From distributed algorithms to Occam programs by successive refinements","author":"Barbosa","year":"1991"},{"key":"10.1016\/0165-6074(91)90376-5_BIB11","volume":"Vol. 1","author":"Fox","year":"1988"},{"key":"10.1016\/0165-6074(91)90376-5_BIB12","series-title":"Technical Report ES-149\/88","article-title":"Static task allocation in heterogeneous distributed systems","author":"Barbosa","year":"1988"},{"key":"10.1016\/0165-6074(91)90376-5_BIB13","series-title":"Proc. of EUROMICRO-88","first-page":"511","article-title":"Specification of a communication virtual processor for parallel processing systems","author":"Barbosa","year":"1988"},{"key":"10.1016\/0165-6074(91)90376-5_BIB14","doi-asserted-by":"crossref","first-page":"1311","DOI":"10.1109\/32.60319","article-title":"Strategies for the prevention of communication deadlocks in distributed parallel programs","volume":"16","author":"Barbosa","year":"1990","journal-title":"IEEE Trans. on Software Engineering"},{"key":"10.1016\/0165-6074(91)90376-5_BIB15","series-title":"Hypercube Multiprocessors 1986","first-page":"148","article-title":"Hypercube embedding is NP-complete","author":"Krumme","year":"1986"},{"key":"10.1016\/0165-6074(91)90376-5_BIB16","series-title":"Computers and Intractability: a Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0165-6074(91)90376-5_BIB17","series-title":"Heuristics","author":"Pearl","year":"1984"},{"key":"10.1016\/0165-6074(91)90376-5_BIB18","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1126\/science.3755256","article-title":"Computing with neural circuits: a model","volume":"233","author":"Hopfield","year":"1986","journal-title":"Science"},{"key":"10.1016\/0165-6074(91)90376-5_BIB19","series-title":"Data Networks","author":"Bertsekas","year":"1987"},{"key":"10.1016\/0165-6074(91)90376-5_BIB20","series-title":"Computer Network Architectures and Protocols","first-page":"361","article-title":"Flow control protocols","author":"Gerla","year":"1982"},{"key":"10.1016\/0165-6074(91)90376-5_BIB21","series-title":"Programming Parallel Processors","first-page":"105","article-title":"Intel iPSC concurrent computer","author":"Pase","year":"1988"},{"key":"10.1016\/0165-6074(91)90376-5_BIB22","first-page":"38","article-title":"iPSC\/2 system: a second generation hypercube","volume":"Vol. 1","author":"Arlauskas","year":"1988"},{"key":"10.1016\/0165-6074(91)90376-5_BIB23","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1109\/TC.1987.1676939","article-title":"Deadlock-free message routing in multiprocessor interconnection networks","volume":"C-36","author":"Dally","year":"1987","journal-title":"IEEE Trans. on Computers"},{"key":"10.1016\/0165-6074(91)90376-5_BIB24","series-title":"VLSI and Parallel Computation","first-page":"140","article-title":"Network and processor architecture for message-driven computers","author":"Dally","year":"1990"},{"key":"10.1016\/0165-6074(91)90376-5_BIB25","doi-asserted-by":"crossref","first-page":"512","DOI":"10.1109\/TCOM.1981.1095021","article-title":"Prevention of deadlocks in packet-switched data transport systems","volume":"COM-29","author":"G\u00fcnther","year":"1981","journal-title":"IEEE Trans. on Communications"},{"key":"10.1016\/0165-6074(91)90376-5_BIB26","first-page":"600","article-title":"Networks for parallel processors: measurements and prognostications","volume":"Vol. 1","author":"Grunwald","year":"1988"}],"container-title":["Microprocessing and Microprogramming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0165607491903765?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0165607491903765?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,14]],"date-time":"2019-03-14T21:50:01Z","timestamp":1552600201000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0165607491903765"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,8]]},"references-count":26,"journal-issue":{"issue":"1-5","published-print":{"date-parts":[[1991,8]]}},"alternative-id":["0165607491903765"],"URL":"https:\/\/doi.org\/10.1016\/0165-6074(91)90376-5","relation":{},"ISSN":["0165-6074"],"issn-type":[{"value":"0165-6074","type":"print"}],"subject":[],"published":{"date-parts":[[1991,8]]}}}