{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T06:26:01Z","timestamp":1725863161181},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319448015"},{"type":"electronic","value":"9783319448022"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-44802-2_7","type":"book-chapter","created":{"date-parts":[[2016,8,17]],"date-time":"2016-08-17T12:32:52Z","timestamp":1471437172000},"page":"118-133","source":"Crossref","is-referenced-by-count":0,"title":["Towards Generic Monitors for Object-Oriented Real-Time Maude Specifications"],"prefix":"10.1007","author":[{"given":"Antonio","family":"Moreno-Delgado","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francisco","family":"Dur\u00e1n","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos\u00e9","family":"Meseguer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,8,18]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-07964-5","volume-title":"Interactive Theorem Proving and Program Development. Coq\u2019Art: The Calculus of Inductive Constructions","author":"Y Bertot","year":"2004","unstructured":"Bertot, Y., Cast\u00e9ran, P.: Interactive Theorem Proving and Program Development. Coq\u2019Art: The Calculus of Inductive Constructions. Springer, Heidelberg (2004). http:\/\/www.labri.fr\/perso\/casteran\/CoqArt\/index.html"},{"key":"7_CR2","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/S0304-3975(01)00359-0","volume":"285","author":"M Clavel","year":"2002","unstructured":"Clavel, M., Dur\u00e1n, F., Eker, S., Lincoln, P., Mart\u00ed-Oliet, N., Meseguer, J., Quesada, J.: Maude: specification and programming in rewriting logic. Theoret. Comput. Sci. 285, 187\u2013243 (2002)","journal-title":"Theoret. Comput. Sci."},{"key":"7_CR3","series-title":"Lecture Notes in Computer Science","volume-title":"All About Maude - A High-Performance Logical Framework: How to Specify, Program, and Verify Systems in Rewriting Logic","author":"M Clavel","year":"2007","unstructured":"Clavel, M., Dur\u00e1n, F., Eker, S., Lincoln, P., Mart\u00ed-Oliet, N., Meseguer, J., Talcott, C.: All About Maude - A High-Performance Logical Framework: How to Specify, Program, and Verify Systems in Rewriting Logic. LNCS, vol. 4350. Springer, Heidelberg (2007)"},{"key":"7_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1007\/3-540-45499-3_30","volume-title":"Algebraic Methodology and Software Technology","author":"F Dur\u00e1n","year":"2000","unstructured":"Dur\u00e1n, F.: The extensibility of Maude\u2019s module algebra. In: Rus, T. (ed.) AMAST 2000. LNCS, vol. 1816, p. 422. Springer, Heidelberg (2000)"},{"issue":"1\u20132","key":"7_CR5","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/s10990-008-9028-2","volume":"21","author":"F Dur\u00e1n","year":"2008","unstructured":"Dur\u00e1n, F., Lucas, S., March\u00e9, C., Meseguer, J., Urbain, X.: Proving operational termination of membership equational programs. High.-Order Symbolic Comput. 21(1\u20132), 59\u201388 (2008)","journal-title":"High.-Order Symbolic Comput."},{"issue":"2","key":"7_CR6","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/j.scico.2006.07.002","volume":"66","author":"F Dur\u00e1n","year":"2007","unstructured":"Dur\u00e1n, F., Meseguer, J.: Maude\u2019s module algebra. Sci. Comput. Program. 66(2), 125\u2013153 (2007)","journal-title":"Sci. Comput. Program."},{"issue":"7\u20138","key":"7_CR7","doi-asserted-by":"crossref","first-page":"816","DOI":"10.1016\/j.jlap.2011.12.004","volume":"81","author":"F Dur\u00e1n","year":"2012","unstructured":"Dur\u00e1n, F., Meseguer, J.: On the Church-Rosser and coherence properties of conditional order-sorted rewrite theories. J. Log. Algebr. Program. 81(7\u20138), 816\u2013850 (2012)","journal-title":"J. Log. Algebr. Program."},{"key":"7_CR8","volume-title":"The SPIN Model Checker","author":"GJ Holzmann","year":"2003","unstructured":"Holzmann, G.J.: The SPIN Model Checker. Addison-Wesley, Boston (2003)"},{"key":"7_CR9","unstructured":"Lee, I., Kannan, S., Kim, M., Sokolsky, O., Viswanathan, M.: Runtime assurance based on formal specifications. In: Arabnia, H.R. (ed.) Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA 1999, 28 June\u20131 July 1999, Las Vegas, Nevada, USA, pp. 279\u2013287. CSREA Press (1999)"},{"issue":"1","key":"7_CR10","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0304-3975(92)90182-F","volume":"96","author":"J Meseguer","year":"1992","unstructured":"Meseguer, J.: Conditional rewriting logic as a unified model of concurrency. Theoret. Comput. Sci. 96(1), 73\u2013155 (1992)","journal-title":"Theoret. Comput. Sci."},{"key":"7_CR11","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.scico.2013.07.004","volume":"83","author":"J Meseguer","year":"2014","unstructured":"Meseguer, J.: Taming distributed system complexity through formal patterns. Sci. Comput. Program. 83, 3\u201334 (2014)","journal-title":"Sci. Comput. Program."},{"issue":"2","key":"7_CR12","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/j.jlap.2009.07.003","volume":"79","author":"J Meseguer","year":"2010","unstructured":"Meseguer, J., Palomino, M., Mart\u00ed-Oliet, N.: Algebraic simulations. J. Log. Algebr. Program. 79(2), 103\u2013143 (2010)","journal-title":"J. Log. Algebr. Program."},{"key":"7_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/3-540-47993-7_1","volume-title":"ECOOP 2002 - Object-Oriented Programming","author":"J Meseguer","year":"2002","unstructured":"Meseguer, J., Talcott, C.: Semantic models for distributed object reflection. In: Magnusson, B. (ed.) ECOOP 2002. LNCS, vol. 2374, p. 1. Springer, Heidelberg (2002)"},{"issue":"1\u20132","key":"7_CR14","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/s10990-007-9001-5","volume":"20","author":"PC \u00d6lveczky","year":"2007","unstructured":"\u00d6lveczky, P.C., Meseguer, J.: Semantics and pragmatics of Real-Time Maude. High.-Order Symbolic Comput. 20(1\u20132), 161\u2013196 (2007)","journal-title":"High.-Order Symbolic Comput."},{"key":"7_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1007\/978-3-642-22944-2_22","volume-title":"Algebra and Coalgebra in Computer Science","author":"C Rocha","year":"2011","unstructured":"Rocha, C., Meseguer, J.: Proving safety properties of rewrite theories. In: Corradini, A., Klin, B., C\u00eerstea, C. (eds.) CALCO 2011. LNCS, vol. 6859, pp. 314\u2013328. Springer, Heidelberg (2011)"},{"issue":"1","key":"7_CR16","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/j.infsof.2012.07.009","volume":"55","author":"J Troya","year":"2013","unstructured":"Troya, J., Vallecillo, A., Dur\u00e1n, F., Zschaler, S.: Model-driven performance analysis of rule-based domain specific visual models. Inf. Softw. Technol. 55(1), 88\u2013110 (2013)","journal-title":"Inf. Softw. Technol."},{"issue":"2","key":"7_CR17","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/s10270-009-0115-6","volume":"9","author":"S Zschaler","year":"2010","unstructured":"Zschaler, S.: Formal specification of non-functional properties of component-based software systems. Softw. Syst. Model. 9(2), 161\u2013201 (2010)","journal-title":"Softw. Syst. Model."}],"container-title":["Lecture Notes in Computer Science","Rewriting Logic and Its Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-44802-2_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T16:53:17Z","timestamp":1498323197000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-44802-2_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319448015","9783319448022"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-44802-2_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}