{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:13:44Z","timestamp":1761610424278,"version":"build-2065373602"},"reference-count":29,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":4958,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2000]]},"DOI":"10.1016\/s1571-0661(05)80123-9","type":"journal-article","created":{"date-parts":[[2005,5,25]],"date-time":"2005-05-25T08:37:08Z","timestamp":1117010228000},"page":"121-137","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":4,"special_numbering":"C","title":["Rewriting Logic as a Framework for Generic Verification Tools"],"prefix":"10.1016","volume":"36","author":[{"given":"Martin","family":"Leucker","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Noll","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"year":"1998","series-title":"\u201cTerm Rewriting and All That,\u201d","author":"Baader","key":"10.1016\/S1571-0661(05)80123-9_BIB1"},{"key":"10.1016\/S1571-0661(05)80123-9_BIB2","series-title":"Handbook of Logic in Artificial Intelligence and Logic Programming","article-title":"Unification theory","author":"Baader","year":"1994"},{"key":"10.1016\/S1571-0661(05)80123-9_BIB3","doi-asserted-by":"crossref","unstructured":"Borovansky, P., C. Kirchner, H. Kirchner, P. Moreau and M. Vittek, Elan: A logical framework based on computational systems, in: Proc. of the First Int. Workshop on Rewriting Logic, Electronic Notes in Theoretical Computer Science 4 (1996). URL http:\/\/www1.elsevier.nl\/mcs\/tcs\/pc\/volume4.htm","DOI":"10.1016\/S1571-0661(04)00032-5"},{"key":"10.1016\/S1571-0661(05)80123-9_BIB4","first-page":"96","article-title":"Formal methods: State of the art and future directions","author":"Clarke","year":"1996","journal-title":"Technical Report CMU-CS-Carnegie Mellon University (CMU). URL ftp:\/\/reports.adm.cs.cmu.edu\/usr\/anon\/1996\/CMU-CS-96-178.ps"},{"key":"10.1016\/S1571-0661(05)80123-9_BIB5","doi-asserted-by":"crossref","unstructured":"Clavel, M., S. Eker, P. Lincoln and J. Meseguer, Principles of Maude, in: J. Meseguer, editor, Proceedings of the First International Workshop on Rewriting Logic, Electronic Notes in Theoretical Computer Science 4, Elsevier, 1996, pp. 65\u201389. URL http:\/\/www.csl.sri.com\/~clavel\/pubs\/rwl96b.ps","DOI":"10.1016\/S1571-0661(04)00034-9"},{"key":"10.1016\/S1571-0661(05)80123-9_BIB6","first-page":"725","article-title":"Tableau-based model checking in the propositional mu-calculus","volume":"27","author":"Cleaveland","year":"1990","journal-title":"Acta Informatica. URL http:\/\/www.cs.sunysb.edu\/~rance\/publications\/papers\/ai90.ps.gz."},{"key":"10.1016\/S1571-0661(05)80123-9_BIB7","doi-asserted-by":"crossref","unstructured":"Cleaveland, R., E. Madelaine and S. Sims, A front-end generator for verification tools, in: Proc. of the Int. Workshop on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'95), Lecture Notes in Computer Science 1019, 1995, pp. 153\u2013173. URL http:\/\/www.csc.ncsu.edu\/eos\/users\/s\/stsims\/WWW\/papers\/pac.ps","DOI":"10.1007\/3-540-60630-0_8"},{"key":"10.1016\/S1571-0661(05)80123-9_BIB8","doi-asserted-by":"crossref","unstructured":"Cleaveland, R. and S. Sims, The NCSU concurrency workbench, in: Proceedings of the Eighth International Conference on Computer Aided Verification (CAV'96), Lecture Notes in Computer Science 1102, 1996, pp. 394\u2013397.","DOI":"10.1007\/3-540-61474-5_87"},{"key":"10.1016\/S1571-0661(05)80123-9_BIB9","unstructured":"The concurrency mailing list. URL http:\/\/www.cwi.nl\/~bertl\/concurrency\/concurrency.html"},{"year":"1998","series-title":"\u201cCafeOBJ Report,\u201d World Scientific, Singapore","author":"Diaconescu","key":"10.1016\/S1571-0661(05)80123-9_BIB10"},{"key":"10.1016\/S1571-0661(05)80123-9_BIB11","first-page":"41","volume":"1043","author":"Emerson","year":"1996"},{"volume":"32","first-page":"203","year":"1997","key":"10.1016\/S1571-0661(05)80123-9_BIB12"},{"key":"10.1016\/S1571-0661(05)80123-9_BIB13","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/BF00243791","article-title":"Unification in Abelian semigroups","volume":"3","author":"Herold","year":"1987","journal-title":"Journal of Automated Reasoning"},{"key":"10.1016\/S1571-0661(05)80123-9_BIB14","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/0304-3975(82)90125-6","article-title":"Results on the propositional mu-calculus","volume":"27","author":"Kozen","year":"1983","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(05)80123-9_BIB15","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-7091-6355-9_11","article-title":"Truth - a verification platform for concurrent systems","author":"Lange","year":"1999"},{"key":"10.1016\/S1571-0661(05)80123-9_BIB16","doi-asserted-by":"crossref","unstructured":"Leucker, M. and T. Noll, Rapid prototyping of specification language implementations, in: Proceedings of the 10th IEEE International Workshop on Rapid System Prototyping (1999), pp. 60-65.","DOI":"10.1109\/IWRSP.1999.779032"},{"key":"10.1016\/S1571-0661(05)80123-9_BIB17","first-page":"352","article-title":"Rewriting logic as a logical and semantic framework","volume":"4","author":"Mart\u00ed-Oliet","year":"1996","journal-title":"First International Workshop on Rewriting Logic and its Applications, Electronic Notes in Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(05)80123-9_BIB18","series-title":"Technical Report CMU-CS-92-131, Carnegie Mellon University","article-title":"The SMV system, symbolic model checking - an approach","author":"McMillan","year":"1992"},{"key":"10.1016\/S1571-0661(05)80123-9_BIB19","doi-asserted-by":"crossref","unstructured":"Meseguer, J., Rewriting as a unified model of concurrency, in: Proceedings Concur'90 Conference, Lecture Notes in Computer Science, Volume 458 (1990), pp. 384-400, also, Report SRI-CSL-90-02R, Computer Science Lab, SRI International.","DOI":"10.1007\/BFb0039072"},{"key":"10.1016\/S1571-0661(05)80123-9_BIB20","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0304-3975(92)90182-F","article-title":"Conditional rewriting logic as a unified model of concurrency","volume":"96","author":"Meseguer","year":"1992","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(05)80123-9_BIB21","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/3-540-61604-7_64","article-title":"Rewriting logic as a semantic framework for concurrency: a progress report. Seventh International Conference on Concurrency Theory (CONCUR '96)","volume":"1119","author":"Meseguer","year":"1996","journal-title":"Lecture Notes in Computer Science"},{"key":"10.1016\/S1571-0661(05)80123-9_BIB22","first-page":"313","article-title":"Completeness results for basic narrowing","volume":"5","author":"Middeldorp","year":"1994","journal-title":"Journal of Applicable Algebra in Engineering, Communication and Computing"},{"year":"1989","series-title":"\u201cCommunication and Concurrency,\u201d International Series in Computer Science","author":"Milner","key":"10.1016\/S1571-0661(05)80123-9_BIB23"},{"key":"10.1016\/S1571-0661(05)80123-9_BIB24","doi-asserted-by":"crossref","unstructured":"Milner, R., J. Parrow and D. Walker, A calculus of mobile processes, Parts I and II, Information and Computation 100 (1992), pp. 1\u201377.","DOI":"10.1016\/0890-5401(92)90009-5"},{"year":"1992","series-title":"\u201cThe Edinburgh Concurrency Workbench (Version 6.1),\u201d Department of Computer Science, University of Edinburgh","author":"Moller","key":"10.1016\/S1571-0661(05)80123-9_BIB25"},{"key":"10.1016\/S1571-0661(05)80123-9_BIB26","doi-asserted-by":"crossref","unstructured":"Noll, T., On coherence properties in term rewriting models of concurrency, in: Proceedings of the 10th International Conference on Concurrency Theory (CONCUR'99), LNCS 1664 (1999), pp. 478\u2013493.","DOI":"10.1007\/3-540-48320-9_33"},{"key":"10.1016\/S1571-0661(05)80123-9_BIB27","series-title":"Technical Report TR-SIP-99-00, Universidad Complutense de Madrid, Spain","article-title":"N. Marti-Oliet. Executing and verifying ccs in maude","author":"Verdejo","year":"2000"},{"key":"10.1016\/S1571-0661(05)80123-9_BIB28","doi-asserted-by":"crossref","unstructured":"Viry, P., Rewriting: An effective model of concurrency, in: Proceedings of PARLE '94 - Parallel Architectures and Languages Europe, Lecture Notes in Computer Science 817 (1994), pp. 648\u2013660.","DOI":"10.1007\/3-540-58184-7_138"},{"key":"10.1016\/S1571-0661(05)80123-9_BIB29","series-title":"Technical Report TR-95-20, Dipartimento di Informatica, Universita di Pisa","article-title":"Rewriting modulo a rewrite system","author":"Viry","year":"1995"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105801239?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105801239?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:09:10Z","timestamp":1761610150000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066105801239"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"references-count":29,"alternative-id":["S1571066105801239"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)80123-9","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[2000]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Rewriting Logic as a Framework for Generic Verification Tools","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1571-0661(05)80123-9","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2000 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}