{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:29:33Z","timestamp":1725892173017},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642313646"},{"type":"electronic","value":"9783642313653"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31365-3_25","type":"book-chapter","created":{"date-parts":[[2012,6,21]],"date-time":"2012-06-21T16:35:34Z","timestamp":1340296534000},"page":"316-331","source":"Crossref","is-referenced-by-count":0,"title":["From Linear Temporal Logic Properties to Rewrite Propositions"],"prefix":"10.1007","author":[{"given":"Pierre-Cyrille","family":"H\u00e9am","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vincent","family":"Hugot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Olga","family":"Kouchnarenko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"25_CR1","series-title":"Lecture Notes in Computer Science","volume-title":"Term Rewriting and Applications","year":"2007","unstructured":"Baader, F. (ed.): RTA 2007. LNCS, vol.\u00a04533. Springer, Heidelberg (2007)"},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"Bae, K., Meseguer, J.: The linear temporal logic of rewriting Maude model checker. In: \u00d6lveczky [16], pp. 208\u2013225","DOI":"10.1007\/978-3-642-16310-4_14"},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"Boichut, Y., Genet, T., Jensen, T.P., Roux, L.L.: Rewriting approximations for fast prototyping of static analyzers. In: Baader [1], pp. 48\u201362","DOI":"10.1007\/978-3-540-73449-9_6"},{"issue":"3","key":"25_CR4","first-page":"216","volume":"14","author":"Y. Boichut","year":"2008","unstructured":"Boichut, Y., H\u00e9am, P.C., Kouchnarenko, O.: Approximation-based tree regular model-checking. Nord. J. Comput.\u00a014(3), 216\u2013241 (2008)","journal-title":"Nord. J. Comput."},{"key":"25_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-642-00593-0_2","volume-title":"Fundamental Approaches to Software Engineering","author":"A. Boronat","year":"2009","unstructured":"Boronat, A., Heckel, R., Meseguer, J.: Rewriting Logic Semantics and Verification of Model Transformations. In: Chechik, M., Wirsing, M. (eds.) FASE 2009. LNCS, vol.\u00a05503, pp. 18\u201333. Springer, Heidelberg (2009)"},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"Boyer, B., Genet, T.: Verifying Temporal Regular Properties of Abstractions of Term Rewriting Systems. In: RULE. EPTCS, vol.\u00a021, pp. 99\u2013108 (2009)","DOI":"10.4204\/EPTCS.21.9"},{"key":"25_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-642-02979-0_17","volume-title":"Implementation and Application of Automata","author":"R. Courbis","year":"2009","unstructured":"Courbis, R., H\u00e9am, P.-C., Kouchnarenko, O.: TAGED Approximations for Temporal Properties Model-Checking. In: Maneth, S. (ed.) CIAA 2009. LNCS, vol.\u00a05642, pp. 135\u2013144. Springer, Heidelberg (2009)"},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"Dershowitz, N., Jouannaud, J.P.: Rewrite Systems. In: Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B), pp. 243\u2013320 (1990)","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"Escobar, S., Meseguer, J.: Symbolic model checking of infinite-state systems using narrowing. In: Baader [1], pp. 153\u2013168","DOI":"10.1007\/978-3-540-73449-9_13"},{"key":"25_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1007\/978-3-540-85780-8_25","volume-title":"Developments in Language Theory","author":"E. Filiot","year":"2008","unstructured":"Filiot, E., Talbot, J.-M., Tison, S.: Tree Automata with Global Constraints. In: Ito, M., Toyama, M. (eds.) DLT 2008. LNCS, vol.\u00a05257, pp. 314\u2013326. Springer, Heidelberg (2008)"},{"key":"25_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/10721959_21","volume-title":"Automated Deduction - CADE-17","author":"T. Genet","year":"2000","unstructured":"Genet, T., Klay, F.: Rewriting for Cryptographic Protocol Verification. In: McAllester, D. (ed.) CADE 2000. LNCS, vol.\u00a01831, pp. 271\u2013290. Springer, Heidelberg (2000)"},{"key":"25_CR12","unstructured":"Kamp, H.W.: Tense Logic and the Theory of Linear Order (1968)"},{"key":"25_CR13","doi-asserted-by":"crossref","unstructured":"Manna, Z., Pnueli, A.: Temporal Verification of Reactive Systems - Safety. Springer (1995)","DOI":"10.1007\/978-1-4612-4222-2"},{"key":"25_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/978-3-540-68679-8_22","volume-title":"Concurrency, Graphs and Models","author":"J. Meseguer","year":"2008","unstructured":"Meseguer, J.: The Temporal Logic of Rewriting: A Gentle Introduction. In: Degano, P., De Nicola, R., Meseguer, J. (eds.) Concurrency, Graphs and Models. LNCS, vol.\u00a05065, pp. 354\u2013382. Springer, Heidelberg (2008)"},{"issue":"1","key":"25_CR15","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0304-3975(92)90182-F","volume":"96","author":"J. Meseguer","year":"1992","unstructured":"Meseguer, J.: Conditioned Rewriting Logic as a United Model of Concurrency. TCS\u00a096(1), 73\u2013155 (1992)","journal-title":"TCS"},{"key":"25_CR16","series-title":"Lecture Notes in Computer Science","volume-title":"Rewriting Logic and Its Applications","year":"2010","unstructured":"\u00d6lveczky, P.C. (ed.): WRLA 2010. LNCS, vol.\u00a06381. Springer, Heidelberg (2010)"},{"issue":"2","key":"25_CR17","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/j.ic.2008.03.026","volume":"207","author":"T.F. Serbanuta","year":"2009","unstructured":"Serbanuta, T.F., Rosu, G., Meseguer, J.: A rewriting logic approach to operational semantics. Inf. Comput.\u00a0207(2), 305\u2013340 (2009)","journal-title":"Inf. Comput."}],"container-title":["Lecture Notes in Computer Science","Automated Reasoning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31365-3_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T20:45:37Z","timestamp":1558298737000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31365-3_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642313646","9783642313653"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31365-3_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}