{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T15:23:24Z","timestamp":1720625004716},"reference-count":13,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":3131,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2005,1]]},"DOI":"10.1016\/j.entcs.2004.06.028","type":"journal-article","created":{"date-parts":[[2005,1,27]],"date-time":"2005-01-27T07:53:44Z","timestamp":1106812424000},"page":"69-87","source":"Crossref","is-referenced-by-count":2,"special_numbering":"C","title":["From Rogue to MicroRogue"],"prefix":"10.1016","volume":"117","author":[{"given":"Aaron","family":"Stump","sequence":"first","affiliation":[]},{"given":"Ryan","family":"Besand","sequence":"additional","affiliation":[]},{"given":"James C.","family":"Brodman","sequence":"additional","affiliation":[]},{"given":"Jonathan","family":"Hseu","sequence":"additional","affiliation":[]},{"given":"Bill","family":"Kinnersley","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.entcs.2004.06.028_bib001","unstructured":"A. Stump and C. Sch\u00fcrmann. Logical Semantics for the Rewriting Calculus. In M. Bonacina and T. Boy de la Tour, editor, 5th International Workshop on Strategies in Automated Deduction, 2004"},{"key":"10.1016\/j.entcs.2004.06.028_bib002","doi-asserted-by":"crossref","unstructured":"A. Appel. Foundational Proof-Carrying Code. In 16th Annual IEEE Symposium on Logic in Computer Science, 2001","DOI":"10.1109\/LICS.2001.932501"},{"issue":"3\u20134","key":"10.1016\/j.entcs.2004.06.028_bib003","article-title":"A Trustworthy Proof Checker","volume":"31","author":"Appel","year":"2003","journal-title":"Journal of Automated Reasoning, special issue on Proof-Carrying Code"},{"key":"10.1016\/j.entcs.2004.06.028_bib004","series-title":"Term Rewriting and All That","author":"Baader","year":"1998"},{"key":"10.1016\/j.entcs.2004.06.028_bib005","doi-asserted-by":"crossref","unstructured":"C. Barrett, D. Dill, and A. Stump. Checking Satisfiability of First-Order Formulas by Incremental Translation to SAT. In 14th International Conference on Computer-Aided Verification, 2002","DOI":"10.1007\/3-540-45657-0_18"},{"key":"10.1016\/j.entcs.2004.06.028_bib006","unstructured":"H. Cirstea and C. Kirchner. The Rewriting Calculus - Part I. Logic Journal of the Interest Group in Pure and Applied Logics, 9:363\u2013399, May 2001. Also available as Technical Report A01-R-203, LORIA, Nancy (France)"},{"key":"10.1016\/j.entcs.2004.06.028_bib007","unstructured":"H. Cirstea and C. Kirchner. The Rewriting Calculus - Part II. Logic Journal of the Interest Group in Pure and Applied Logics, 9:401\u2013434, May 2001. Also available as Technical Report A01-R-204, LORIA, Nancy (France)"},{"key":"10.1016\/j.entcs.2004.06.028_bib008","series-title":"Introduction to Algorithms","author":"Cormen","year":"1992"},{"key":"10.1016\/j.entcs.2004.06.028_bib009","doi-asserted-by":"crossref","unstructured":"N. Dershowitz and D. Plaisted. Rewriting, chapter 9. Volume 1 of Robinson and Voronkov [10], 2001","DOI":"10.1016\/B978-044450813-3\/50011-4"},{"key":"10.1016\/j.entcs.2004.06.028_bib010","series-title":"Handbook of Automated Reasoning","year":"2001"},{"key":"10.1016\/j.entcs.2004.06.028_bib011","doi-asserted-by":"crossref","unstructured":"R. Sekar, I. Ramakrishnan, and A. Voronkov. Term Indexing, chapter 26. Volume 2 of Robinson and Voronkov [10], 2001","DOI":"10.1016\/B978-044450813-3\/50028-X"},{"key":"10.1016\/j.entcs.2004.06.028_bib012","unstructured":"A. Stump, A. Deivanayagam, S. Kathol, D. Lingelbach, and D. Schobel. Rogue Decision Procedures. In C. Tinelli and S. Ranise, editors, 1st International Workshop on Pragmatics of Decision Procedures in Automated Reasoning, 2003"},{"key":"10.1016\/j.entcs.2004.06.028_bib013","series-title":"Rule Based Programming","article-title":"Scoped dynamic rewrite rules","volume":"volume 59\/4","author":"Visser","year":"2001"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104052958?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104052958?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,4,5]],"date-time":"2020-04-05T08:57:11Z","timestamp":1586077031000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104052958"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,1]]},"references-count":13,"alternative-id":["S1571066104052958"],"URL":"https:\/\/doi.org\/10.1016\/j.entcs.2004.06.028","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2005,1]]}}}