{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T08:18:46Z","timestamp":1648714726819},"reference-count":33,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1993,6,1]],"date-time":"1993-06-01T00:00:00Z","timestamp":738892800000},"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":["Journal of Systems and Software"],"published-print":{"date-parts":[[1993,6]]},"DOI":"10.1016\/0164-1212(93)90023-q","type":"journal-article","created":{"date-parts":[[2003,9,3]],"date-time":"2003-09-03T17:06:23Z","timestamp":1062608783000},"page":"201-214","source":"Crossref","is-referenced-by-count":1,"title":["Tracing the execution of distributed programs"],"prefix":"10.1016","volume":"21","author":[{"given":"William S","family":"Lloyd","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Phil","family":"Kearns","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0164-1212(93)90023-Q_BIB1","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1145\/363235.363259","article-title":"An Axiomatic Basis for Computer Programming","volume":"12","author":"Hoare","year":"1969","journal-title":"Commun. ACM"},{"key":"10.1016\/0164-1212(93)90023-Q_BIB2","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1109\/TSE.1976.233815","article-title":"Observations of Fallibility in Applications of Modern Programming Methodologies","volume":"SE-2","author":"Gerhart","year":"1976","journal-title":"IEEE Trans. Software Eng."},{"key":"10.1016\/0164-1212(93)90023-Q_BIB3","series-title":"SIGPLAN Not.","first-page":"36","article-title":"The Case for the Assert Statement","author":"Matuszek","year":"1976"},{"key":"10.1016\/0164-1212(93)90023-Q_BIB4","series-title":"Mathematical Aspects of Computer Science XIX","first-page":"19","article-title":"Assigning meanings to programs","author":"Floyd","year":"1967"},{"key":"10.1016\/0164-1212(93)90023-Q_BIB5","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/BF00268134","article-title":"An Axiomatic Proof Technique for Parallel Programs","volume":"6","author":"Owicki","year":"1976","journal-title":"Acta Informat."},{"key":"10.1016\/0164-1212(93)90023-Q_BIB6","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1145\/357172.357178","article-title":"Proving Liveness Properties of Concurrent Programs","volume":"4","author":"Owicki","year":"1982","journal-title":"ACM Trans. Progr. Lang. Syst."},{"key":"10.1016\/0164-1212(93)90023-Q_BIB7","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1145\/357103.357110","article-title":"A Proof System for Communicating Sequential processes","volume":"2","author":"Apt","year":"1980","journal-title":"ACM Trans. Prog. Lang. Syst."},{"key":"10.1016\/0164-1212(93)90023-Q_BIB8","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/BF00289266","article-title":"A Proof Technique for Communicating Sequential Processes","volume":"15","author":"Levin","year":"1981","journal-title":"Acta. Informat."},{"key":"10.1016\/0164-1212(93)90023-Q_BIB9","doi-asserted-by":"crossref","first-page":"402","DOI":"10.1145\/579.583","article-title":"Using Message Passing for Distributed Programming: Proof Rules and Disciplines","volume":"6","author":"Schlichting","year":"1984","journal-title":"ACM Trans. Prog. Lang. Syst."},{"key":"10.1016\/0164-1212(93)90023-Q_BIB10","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/BF00289262","article-title":"Recursive Assertions and Parallel Programs","volume":"15","author":"Apt","year":"1981","journal-title":"Acta Informat."},{"key":"10.1016\/0164-1212(93)90023-Q_BIB11","article-title":"Axiomatic Proof Techniques for Parallel Programs","author":"Owicki","year":"1975"},{"key":"10.1016\/0164-1212(93)90023-Q_BIB12","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1145\/42190.42348","article-title":"Control Predicates are Better than Dummy Variables for Reasoning about Program Control","volume":"10","author":"Lamport","year":"1988","journal-title":"ACM Trans. Progr. Lang. Syst."},{"key":"10.1016\/0164-1212(93)90023-Q_BIB13","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1007\/BF00571463","article-title":"Program Proving: Coroutines","volume":"2","author":"Clint","year":"1973","journal-title":"Acta Informat."},{"key":"10.1016\/0164-1212(93)90023-Q_BIB14","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1145\/214451.214456","article-title":"Distributed Snapshots: Determining Global States of Distributed Systems","volume":"3","author":"Chandy","year":"1985","journal-title":"ACM Trans. Comp. Syst."},{"key":"10.1016\/0164-1212(93)90023-Q_BIB15","doi-asserted-by":"crossref","first-page":"666","DOI":"10.1145\/359576.359585","article-title":"Communicating Sequential Processes","volume":"21","author":"Hoare","year":"1978","journal-title":"Commun. ACM"},{"key":"10.1016\/0164-1212(93)90023-Q_BIB16","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1145\/322358.322372","article-title":"Formal Justification of a Proof System for Communicating Sequential Processes","volume":"30","author":"Apt","year":"1983","journal-title":"J. ACM"},{"key":"10.1016\/0164-1212(93)90023-Q_BIB17","series-title":"Proceedings of the 11th International Symposium on Distributed Computing Systems, IEEE Computer Society Press","first-page":"552","article-title":"Using tracing to direct our reasoning about distributed programs","author":"Lloyd","year":"1991"},{"key":"10.1016\/0164-1212(93)90023-Q_BIB18","series-title":"Proceedings of the Eleventh Australian Computer Science Conference","first-page":"56","article-title":"Timestamps in message-passing systems which preserve the partial ordering","author":"Fidge","year":"1988"},{"key":"10.1016\/0164-1212(93)90023-Q_BIB19","series-title":"Parallel and Distributed Algorithms: Proceedings of the International Workshop on Parallel and Distributed Algorithms","first-page":"215","article-title":"Virtual time and global states of distributed systems","author":"Mattern","year":"1989"},{"key":"10.1016\/0164-1212(93)90023-Q_BIB20","doi-asserted-by":"crossref","first-page":"558","DOI":"10.1145\/359545.359563","article-title":"Time, Clocks and the Ordering of Events in a Distributed System","volume":"21","author":"Lamport","year":"1978","journal-title":"Commun. ACM"},{"key":"10.1016\/0164-1212(93)90023-Q_BIB21","article-title":"Causal Reasoning About Distributed Programs","author":"Lloyd","year":"1991"},{"key":"10.1016\/0164-1212(93)90023-Q_BIB22","series-title":"Software Testing Techniques","author":"Bezier","year":"1990"},{"key":"10.1016\/0164-1212(93)90023-Q_BIB23","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1145\/69624.357207","article-title":"Specifying Concurrent Program Modules","volume":"5","author":"Lamport","year":"1983","journal-title":"ACM Trans. Progr. Lang. Syst."},{"key":"10.1016\/0164-1212(93)90023-Q_BIB24","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1145\/63238.63240","article-title":"A Simple Approach to Specifying Concurrent Systems","volume":"32","author":"Lamport","year":"1989","journal-title":"Commun. ACM"},{"key":"10.1016\/0164-1212(93)90023-Q_BIB25","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1109\/TSE.1981.230844","article-title":"Proofs of Networks of Processes","volume":"SE-7","author":"Misra","year":"1981","journal-title":"IEEE Trans. Software Eng."},{"key":"10.1016\/0164-1212(93)90023-Q_BIB26","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1145\/1780.1805","article-title":"Axiomatic Semantics of Communicating Sequential processes","volume":"6","author":"Soundararajan","year":"1984","journal-title":"ACM Trans. Prog. Lang. Syst."},{"key":"10.1016\/0164-1212(93)90023-Q_BIB27","doi-asserted-by":"crossref","first-page":"932","DOI":"10.1109\/32.58782","article-title":"The Specification and Verified Decomposition of System Requirements Using CSP","volume":"16","author":"Moore","year":"1990","journal-title":"IEEE Trans. Software Eng."},{"key":"10.1016\/0164-1212(93)90023-Q_BIB28","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1002\/spe.4380160304","article-title":"A Probe Effect in Concurrent Programs","volume":"16","author":"Gait","year":"1986","journal-title":"Software Pract. Exp."},{"key":"10.1016\/0164-1212(93)90023-Q_BIB29","series-title":"Proceedings of the 10th IEEE International Conference on Distributed Computing Systems, IEEE Computer Society Press","first-page":"312","article-title":"Bounding sequence numbers: A general approach","author":"Lloyd","year":"1990"},{"key":"10.1016\/0164-1212(93)90023-Q_BIB30","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1109\/MS.1985.230351","article-title":"Debugging Ada Tasking Programs","volume":"2","author":"Helmbold","year":"1985","journal-title":"IEEE Software"},{"key":"10.1016\/0164-1212(93)90023-Q_BIB31","series-title":"Ada in Use, Proceedings of the Ada International Conference, Cambridge University Press","first-page":"255","article-title":"TSL: Task sequencing language","author":"Helmbold","year":"1985"},{"key":"10.1016\/0164-1212(93)90023-Q_BIB32","series-title":"Proceedings of the ACM\/ONR Workshop on Parallel and Distributed Debugging, ACM Press","first-page":"167","article-title":"Consistent detection of global predicates","author":"Cooper","year":"1991"},{"key":"10.1016\/0164-1212(93)90023-Q_BIB33","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0164-1212(83)90011-0","article-title":"High-Level Debugging of Distributed Systems: The Behavioral Abstraction Approach","volume":"3","author":"Bates","year":"1983","journal-title":"J. Syst. Software"}],"container-title":["Journal of Systems and Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016412129390023Q?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016412129390023Q?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T10:58:45Z","timestamp":1551092325000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016412129390023Q"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,6]]},"references-count":33,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1993,6]]}},"alternative-id":["016412129390023Q"],"URL":"https:\/\/doi.org\/10.1016\/0164-1212(93)90023-q","relation":{},"ISSN":["0164-1212"],"issn-type":[{"value":"0164-1212","type":"print"}],"subject":[],"published":{"date-parts":[[1993,6]]}}}