{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T12:18:13Z","timestamp":1648556293030},"publisher-location":"Vienna","reference-count":26,"publisher":"Springer Vienna","isbn-type":[{"value":"9783211832820","type":"print"},{"value":"9783709163559","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/978-3-7091-6355-9_11","type":"book-chapter","created":{"date-parts":[[2011,9,15]],"date-time":"2011-09-15T07:42:02Z","timestamp":1316072522000},"page":"150-159","source":"Crossref","is-referenced-by-count":4,"title":["Truth \u2014 A verification platform for concurrent systems"],"prefix":"10.1007","author":[{"given":"Martin","family":"Lange","sequence":"first","affiliation":[]},{"given":"Martin","family":"Leucker","sequence":"additional","affiliation":[]},{"given":"Thomas","family":"Noll","sequence":"additional","affiliation":[]},{"given":"Stephan","family":"Tobies","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","volume-title":"Proc. of the First Int. Workshop on Rewriting Logic, volume 4 of Electronic Notes in Theoretical Computer Science. Elsevier","author":"P Borovansky","year":"1996","unstructured":"P. Borovansky, C. Kirchner, H. Kirchner, P.E. Moreau, and M. Vittek. Elan: A logical framework based on computational systems. In Proc. of the First Int. Workshop on Rewriting Logic, volume 4 of Electronic Notes in Theoretical Computer Science. Elsevier, 1996."},{"key":"11_CR2","volume-title":"Carnegie Mellon University (CMU)","author":"EM Clarke","year":"1996","unstructured":"E. M. Clarke and J. M. Wing. Formal methods: State of the art and future directions. Technical Report CMU-CS-96\u2013178, Carnegie Mellon University (CMU), September 1996."},{"key":"11_CR3","volume-title":"Jos\u00e9 Meseguer, editor, Proceedings of the First International Workshop on Rewriting Logic, volume 4 of Electronic Notes in Theoretical Computer Science, pages 65-89. Elsevier","author":"M Clavel","year":"1996","unstructured":"Manuel Clavel, Steven Eker, Patrick Lincoln, and Jos Meseguer. Principles of Maude. In Jos\u00e9 Meseguer, editor, Proceedings of the First International Workshop on Rewriting Logic, volume 4 of Electronic Notes in Theoretical Computer Science, pages 65\u201389. Elsevier, 1996."},{"issue":"8","key":"11_CR4","doi-asserted-by":"publisher","first-page":"725","DOI":"10.1007\/BF00264284","volume":"27","author":"R Cleaveland","year":"1990","unstructured":"R. Cleaveland. Tableau-based model checking in the propositional mu-calculus. Acta Informatica, 27 (8): 725\u2013748, 1990.","journal-title":"Acta Informatica"},{"key":"11_CR5","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/3-540-60630-0_8","volume":"1019","author":"R Cleaveland","year":"1995","unstructured":"R. Cleaveland, E. Madelaine, and S. Sims. A front-end generator for verification tools. Lecture Notes in Computer Science, 1019: 153\u2013173, 1995.","journal-title":"Lecture Notes in Computer Science"},{"key":"11_CR6","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1007\/3-540-61474-5_87","volume":"1102","author":"R Cleaveland","year":"1996","unstructured":"R. Cleaveland and S. Sims. The NCSU concurrency workbench. Lecture Notes in Computer Science, 1102: 394\u2013397, 1996.","journal-title":"Lecture Notes in Computer Science"},{"key":"11_CR7","unstructured":"The concurrency mailing list. http:\/\/www-i2.informatik.rwth-aachen.de\/Forschung\/Mcs\/mailing_list.html"},{"key":"11_CR8","volume-title":"The Book of Traces","year":"1995","unstructured":"Volker Diekert and Grzegorz Rozenberg, editors.The Book of Traces. World Scientific, Singapore, 1995."},{"key":"11_CR9","first-page":"1996","volume-title":"volume of Lecture Notes in Computer Science, pages 41\u2013101 Springer-Verlag Inc","author":"E. A","year":"1043","unstructured":"E. A. Emerson. Automated Temporal Reasoning about Reactive Systems, volume 1043 of Lecture Notes in Computer Science, pages 41\u2013101 Springer-Verlag Inc., New York, NY, USA, 1996."},{"key":"11_CR10","volume-title":"American Mathematical Society","author":"E. A","year":"1997","unstructured":"E. A. Emerson. Model checking and the mu-calculus, volume 31 of DIMACS: Series in Discrete Mathematics and Theoretical Computer Science, chapter 6. American Mathematical Society, 1997."},{"key":"11_CR11","unstructured":"E.A. Emerson and C.L. Lei. Efficient model checking in fragments of the propositional ti-calculus. In Symposion on Logic in Computer Science pages 267\u2013278, Washington, D.C., USA, June 1986. IEEE Computer Society Press."},{"key":"11_CR12","unstructured":"Jean-Charles Gr\u00e9goire, Gerard J. Holzmann, and Doron A. Peled, editors.The Spin Verification System volume 32 of DIMACS series. American Mathematical Society, 1997. ISBN 0\u20138218\u20130680\u20137, 203p."},{"key":"11_CR13","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/0304-3975(82)90125-6","volume":"Science27","author":"Dexter Kozen","year":"1983","unstructured":"Dexter Kozen. Results on the propositional mu-calculus.Theoretical Computer Science27:333\u2013354, December 1983.","journal-title":"Theoretical Computer"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"J. Launchbury and S. Peyton Jones. Lazy functional state threads. In Programming Languages Design and Implementation,Orlando, 1994. ACM Press.","DOI":"10.1145\/178243.178246"},{"key":"11_CR15","volume-title":"Technical Report","author":"M Leucker","year":"1998","unstructured":"Martin Leucker and Stephan Tobies. Truth\u2014A Platform for Verification of Distributed Systems. Technical Report 98\u201305, RWTH Aachen, May 1998."},{"key":"11_CR16","volume-title":"Carnegie Mellon University","author":"KL McMillan","year":"1992","unstructured":"K. L. McMillan. The SMV system, symbolic model checking - an approach. Technical Report CMU-CS-92\u2013131, Carnegie Mellon University, 1992."},{"issue":"1","key":"11_CR17","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0304-3975(92)90182-F","volume":"96","author":"J. Meseguer","year":"1992","unstructured":"J. Meseguer. Conditional rewriting logic as a unified model of concurrency. Theoretical Computer Science 96(1):73\u2013155, April 1992.","journal-title":"Theoretical Computer Science"},{"key":"11_CR18","doi-asserted-by":"crossref","unstructured":"Jos\u00e9 Meseguer. Rewriting as a unified model of concurrency. In Proceedings Concur\u201990 Conference,Lecture Notes in Computer Science, Volume 458, pages 384\u2013400, Amsterdam, August 1990. Springer. Also, Report SRI-CSL-90\u201302R, Computer Science Lab, SRI International.","DOI":"10.1007\/BFb0039072"},{"key":"11_CR19","first-page":"331","volume-title":"Seventh International Conference on Concurrency Theory (CONCUR \u201886), volume 1119 of Lecture Notes in Computer Science","author":"J Meseguer","year":"1996","unstructured":"Jos\u00e9 Meseguer. Rewriting logic as a semantic framework for concurrency: a progress report. In Seventh International Conference on Concurrency Theory (CONCUR \u201886), volume 1119 of Lecture Notes in Computer Science, pages 331\u2013372. Springer Verlag, August 1996."},{"key":"11_CR20","volume-title":"Communication and Concurrency","author":"R Milner","year":"1989","unstructured":"R. Milner. Communication and Concurrency. International Series in Computer Science. Prentice Hall, 1989."},{"key":"11_CR21","volume-title":"The Edinburgh Concurrency Workbench (Version 6.1)","author":"F Moller","year":"1992","unstructured":"F. Moller. The Edinburgh Concurrency Workbench (Version 6.1). Department of Computer Science, University of Edinburgh, October 1992."},{"key":"11_CR22","volume-title":"A non-strict purely-functional programming language","author":"J Peterson","year":"1996","unstructured":"John Peterson, Kevin Hammond, et al. Report on the programming language haskell, a non-strict purely-functional programming language, version 1. 3. Technical report, Yale University, May 1996."},{"key":"11_CR23","volume-title":"Edinburgh","author":"C.Stirling","year":"1997","unstructured":"C. Stirling. Games for bisimulation and model checking, June 1997. Notes for Mathfit instructional meeting on games and computation, Edinburgh."},{"key":"11_CR24","doi-asserted-by":"crossref","unstructured":"Patrick Viry. Rewriting: An effective model of concurrency. In Proceedings of PARLE \u201884 - Parallel Architectures and Languages Europe volume 817 of Lecture Notes in Computer Science pages 648\u2013660. Springer-Verlag, 1994.","DOI":"10.1007\/3-540-58184-7_138"},{"key":"11_CR25","unstructured":"Patrick Viry. Rewriting modulo a rewrite system. Technical Report TR-95\u201320, Dipartimento di Informatica, December 01 1995."},{"key":"11_CR26","unstructured":"Patrick Viry. A rewriting implementation of pi-calculus. Technical Report TR-96\u201330, Dipartimento di Informatica, March 26 1996."}],"container-title":["Tool Support for System Specification, Development and Verification"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-7091-6355-9_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T09:36:03Z","timestamp":1606124163000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-7091-6355-9_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783211832820","9783709163559"],"references-count":26,"URL":"http:\/\/dx.doi.org\/10.1007\/978-3-7091-6355-9_11","relation":{},"published":{"date-parts":[[1999]]}}}