{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:20:36Z","timestamp":1725456036421},"publisher-location":"Berlin\/Heidelberg","reference-count":19,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354019021X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0026105","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T07:47:21Z","timestamp":1132645641000},"page":"200-214","source":"Crossref","is-referenced-by-count":0,"title":["Expressiveness bounds for completeness in trace-based network proof systems"],"prefix":"10.1007","author":[{"given":"Jennifer","family":"Widom","sequence":"first","affiliation":[]},{"given":"Prakash","family":"Panangaden","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"14_CR1","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0020-0190(85)90056-0","volume":"21","author":"B. Alpern","year":"1985","unstructured":"B. Alpern and F.B. Schneider. Defining liveness. Information Processing Letters, 21(4):181\u2013185, October 1985.","journal-title":"Information Processing Letters"},{"key":"14_CR2","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1007\/3-540-10699-5_102","volume-title":"Formalization of Programming Concepts, Lecture Notes in Computer Science 107","author":"J.D. Brock","year":"1981","unstructured":"J.D. Brock and W.B. Ackerman. Scenarios: a model of non-determinate computation. In Formalization of Programming Concepts, Lecture Notes in Computer Science 107, pages 252\u2013259, Springer-Verlag, Berlin, 1981."},{"key":"14_CR3","first-page":"68","volume-title":"Logics of Programs, Lecture Notes in Computer Science 164","author":"S.D. Brookes","year":"1984","unstructured":"S.D. Brookes. A semantics and proof system for communicating processes. In Logics of Programs, Lecture Notes in Computer Science 164, pages 68\u201385, Springer-Verlag, Berlin, 1984."},{"key":"14_CR4","unstructured":"Z.C. Chen and C.A.R. Hoare. Partial correctness of communicating sequential processes. In Proceedings of the IEEE International Conference on Distributed Computing Systems, pages 1\u201312, Paris, April 1981."},{"issue":"1","key":"14_CR5","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1137\/0207005","volume":"7","author":"S.A. Cook","year":"1978","unstructured":"S.A. Cook. Soundness and completeness of an axiom system for program verification. SIAM Journal on Computing, 7(1):70\u201390, February 1978.","journal-title":"SIAM Journal on Computing"},{"key":"14_CR6","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0304-3975(83)90081-6","volume":"26","author":"E.C.R. Hehner","year":"1983","unstructured":"E.C.R. Hehner and C.A.R. Hoare. A more complete model of communicating processes. Theoretical Computer Science, 26:105\u2013120, September 1983.","journal-title":"Theoretical Computer Science"},{"key":"14_CR7","volume-title":"Communicating Sequential Processes","author":"C.A.R. Hoare","year":"1985","unstructured":"C.A.R. Hoare. Communicating Sequential Processes. Prentice-Hall, Englewood Cliffs, New Jersey, 1985."},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"B. Jonsson. A model and proof system for asynchronous networks. In Proceedings of the Fourth ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, pages 49\u201358, August 1985.","DOI":"10.1145\/323596.323601"},{"issue":"7","key":"14_CR9","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1109\/TSE.1981.230844","volume":"7","author":"J. Misra","year":"1981","unstructured":"J. Misra and K.M. Chandy. Proofs of networks of processes. IEEE Transactions on Software Engineering, 7(7):417\u2013426, July 1981.","journal-title":"IEEE Transactions on Software Engineering"},{"key":"14_CR10","first-page":"215","volume-title":"The Correctness Problem in Computer Science","author":"Z. Manna","year":"1981","unstructured":"Z. Manna and A. Pnueli. Verification of concurrent programs: the temporal framework. In R.S. Boyer and J.S. Moore, editors, The Correctness Problem in Computer Science, pages 215\u2013273, International Lecture Series in Computer Science, Academic Press, London, 1981."},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Z. Manna and A. Pnueli. Verification of concurrent programs: a temporal proof system. In Proceedings of the Fourth School on Advanced Programming, pages 163\u2013255, Amsterdam, June 1982.","DOI":"10.21236\/ADA116035"},{"issue":"1","key":"14_CR12","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/BF01843567","volume":"1","author":"V. Nguyen","year":"1986","unstructured":"V. Nguyen, A. Demers, D. Gries, and S. Owicki. A model and temporal proof system for networks of processes. Distributed Computing, 1(1):7\u201325, January 1986.","journal-title":"Distributed Computing"},{"key":"14_CR13","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0020-0190(85)90040-7","volume":"21","author":"V. Nguyen","year":"1985","unstructured":"V. Nguyen. The incompleteness of Misra and Chandy's proof systems. Information Processing Letters, 21:93\u201396, August 1985.","journal-title":"Information Processing Letters"},{"key":"14_CR14","volume-title":"Temporal Logic. Library of Exact Philosophy","author":"N. Rescher","year":"1971","unstructured":"N. Rescher and A. Urquhart. Temporal Logic. Library of Exact Philosophy, Springer-Verlag, Vienna, 1971."},{"key":"14_CR15","volume-title":"Mathematical Logic","author":"J.R. Schoenfield","year":"1967","unstructured":"J.R. Schoenfield. Mathematical Logic. Addison-Wesley, Reading, Massachusetts, 1967."},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"J. Widom, D. Gries, and F.B. Schneider. Completeness and incompleteness of trace-based network proof systems. In Proceedings of the Fourteenth ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, pages 27\u201338, January 1987.","DOI":"10.1145\/41625.41628"},{"key":"14_CR17","volume-title":"Trace-Based Network Proof Systems: Expressiveness and Completeness","author":"J. Widom","year":"1987","unstructured":"J. Widom. Trace-Based Network Proof Systems: Expressiveness and Completeness. PhD thesis, Cornell University, Ithaca, New York, May 1987."},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"P. Wolper. Temporal logic can be more expressive. In Proceedings of the 22nd Annual Symposium on Foundations of Computer Science, pages 340\u2013348, October 1981.","DOI":"10.1109\/SFCS.1981.44"},{"key":"14_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1007\/BFb0015776","volume-title":"Proceedings of the 12th International Colloquium on Automata, Languages, and Programming","author":"J. Zwiers","year":"1985","unstructured":"J. Zwiers, W.P. de Roever, and P. van Emde Boas. Compositionality and concurrent networks: soundness and completeness of a proofsystem. In Proceedings of the 12th International Colloquium on Automata, Languages, and Programming, Lecture Notes in Computer Science 194, pages 509\u2013519, Springer-Verlag, Berlin, 1985."}],"container-title":["Lecture Notes in Computer Science","CAAP '88"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0026105.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:55:54Z","timestamp":1607550954000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0026105"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354019021X"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/bfb0026105","relation":{},"subject":[]}}