{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:56:40Z","timestamp":1725663400940},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540190271"},{"type":"electronic","value":"9783540389415"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1988]]},"DOI":"10.1007\/3-540-19027-9_2","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T14:56:08Z","timestamp":1330181768000},"page":"21-33","source":"Crossref","is-referenced-by-count":3,"title":["A semantics driven temporal verification system"],"prefix":"10.1007","author":[{"given":"G. D.","family":"Gough","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H.","family":"Barringer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"2_CR1","first-page":"53","volume-title":"Temporal Logics and their Applications","author":"H. Barringer","year":"1987","unstructured":"H. Barringer. Using Temporal Logic in the Compositional Specification of Concurrent Systems. In A. P. Galton, editor, Temporal Logics and their Applications, chapter 2, pages 53\u201390, Academic Press Inc. Limited, London, December 1987."},{"key":"2_CR2","unstructured":"M.C. Browne and E.M. Clarke. SML \u2014 a high level language for the design and verification of finite state machines. In From H.D.L. descriptions to guaranteed correct circuit designs, IFIP, September 1986."},{"key":"2_CR3","unstructured":"M.C. Browne, E.M. Clarke, D. Dill, and B. Mishra. Automatic Verification of Sequential Circuits using Temporal Logic. Technical Report CS-85-100, Department of Computer Science, Carnegie-Mellon University, 1984."},{"key":"2_CR4","unstructured":"H. Barringer and G.D. Gough. Mechanisation of Temporal Logics. Part 1: Techniques. Temple internal report, Department of Computer Science, University of Manchester, 1987."},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"H. Barringer, R. Kuiper, and A. Pnueli. Now You May Compose Temporal Logic Specifications. In Proceedings of the Sixteenth ACM Symposium on the Theory of Computing, 1984.","DOI":"10.1145\/800057.808665"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"H. Barringer, R. Kuiper, and A. Pnueli. A Really Abstract Concurrent Model and its Temporal Logic. In Proceedings of the Thirteenth ACM Symposium on the Principles of Programming Languages, St. Petersberg Beach, Florida, January 1986.","DOI":"10.1145\/512644.512660"},{"key":"2_CR7","unstructured":"M.C. Browne. An improved algorithm for the automatic verification of finite state systems using temporal logic. Technical Report, Department of Computer Science, Carnegie-Mellon University, December 1986."},{"issue":"2","key":"2_CR8","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 specifications. ACM Transactions on Programming Languages and Systems, 8(2):244\u2013263, 1986.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"E. M. Clarke, O. Gr\u00fcmberg, and M. C. Browne. Reasoning about networks with many identical finite-state processes. In Proceedings of the Fifth Annual ACM Symposium on Principles of Distributed Computing, ACM, August 1986.","DOI":"10.1145\/10590.10611"},{"key":"2_CR10","unstructured":"G. D. Gough. Decision Procedures for Temporal Logic. Master's thesis, Department of Computer Science, University of Manchester, October 1984."},{"key":"2_CR11","unstructured":"Stephen C. Johnson. Yacc: Yet another compiler-compiler. Unix Programmer's Manual Vol 2b, 1979."},{"issue":"2","key":"2_CR12","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1145\/69624.357207","volume":"5","author":"L. Lamport","year":"1983","unstructured":"L. Lamport. Specifying concurrent program modules. ACM Transactions on Programming Languages and Systems, 5(2):190\u2013222, July 1983.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"2_CR13","first-page":"657","volume-title":"Information Processing 83","author":"L. Lamport","year":"1983","unstructured":"L. Lamport. What good is temporal logic. In R. E. A. Mason, editor, Information Processing 83, pages 657\u2013668, IFIP, Elsevier Science Publishers B.V. (North-Holland), 1983."},{"key":"2_CR14","first-page":"77","volume-title":"Logics and Models of Concurrent Systems","author":"L. Lamport","year":"1984","unstructured":"L. Lamport. An Axiomatic Semantics of Concurrent Programming Languages. In Krysztof Apt, editor, Logics and Models of Concurrent Systems, pages 77\u2013122, NATO, Springer-Verlag, La Colle-sur-Loup, France, October 1984."},{"key":"2_CR15","volume-title":"The Correctness Problem in Computer Science","author":"Z. Manna","year":"1982","unstructured":"Z. Manna and A. Pnueli. Verification of Concurrent Programs: The Temporal Framework. In Robert S. Boyer and J. Strother Moore, editors, The Correctness Problem in Computer Science, Academic Press, London, 1982."},{"issue":"3","key":"2_CR16","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1145\/357172.357178","volume":"4","author":"S. Owicki","year":"1982","unstructured":"S. Owicki and L. Lamport. Proving Liveness Properties of Concurrent Programs. ACM Transactions on Programming Languages and Systems, 4(3):455\u2013495, July 1982.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"3","key":"2_CR17","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/0020-0190(81)90106-X","volume":"12","author":"G. L. Peterson","year":"1981","unstructured":"G. L. Peterson. Myths about the mutual exclusion problem. Information Processing Letters, 12(3):115\u2013116, 1981.","journal-title":"Information Processing Letters"},{"key":"2_CR18","unstructured":"G. D. Plotkin. A structural approach to operational semantics. Technical Report DAIMI FN-19, Department of Computer Science,Aarhus University, September 1981."},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"A. Pnueli. The Temporal Logic of Programs. In Proceedings of the Eighteenth Symposium on the Foundations of Computer Science, Providence, November 1977.","DOI":"10.1109\/SFCS.1977.32"},{"key":"2_CR20","first-page":"123","volume-title":"Logics and Models of Concurrent Systems","author":"A. Pnueli","year":"1984","unstructured":"A. Pnueli. In transition from global to modular temporal reasoning about programs. In Krysztof Apt, editor, Logics and Models of Concurrent Systems, pages 123\u2013144, NATO, Springer-Verlag, La Colle-sur-Loup, France, October 1984."},{"key":"2_CR21","doi-asserted-by":"crossref","unstructured":"J. P. Queille and J. Sifakis. Specification and verification of concurrent systems in CESAR. Lecture Notes in Computer Science, 137, April 1982.","DOI":"10.1007\/3-540-11494-7_22"}],"container-title":["Lecture Notes in Computer Science","ESOP '88"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-19027-9_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T17:19:04Z","timestamp":1619543944000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-19027-9_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988]]},"ISBN":["9783540190271","9783540389415"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-19027-9_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1988]]}}}