{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T22:13:20Z","timestamp":1725747200280},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642410703"},{"type":"electronic","value":"9783642410710"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-41071-0_11","type":"book-chapter","created":{"date-parts":[[2013,8,29]],"date-time":"2013-08-29T22:59:14Z","timestamp":1377817154000},"page":"147-162","source":"Crossref","is-referenced-by-count":1,"title":["Theorem Proving Graph Grammars: Strategies for Discharging Proof Obligations"],"prefix":"10.1007","author":[{"given":"Luiz Carlos","family":"Lemos Junior","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simone","family":"Andr\u00e9 da Costa Cavalheiro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luciana","family":"Foss","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1142\/9789812384720_0004","volume-title":"Handbook of graph grammars and computing by graph transformation","author":"H. Ehrig","year":"1997","unstructured":"Ehrig, H., Heckel, R., Korff, M., L\u00f6we, M., Ribeiro, L., Wagner, A., Corradini, A.: Handbook of graph grammars and computing by graph transformation, pp. 247\u2013312. World Scientific Publishing Co., Inc., River Edge (1997)"},{"key":"11_CR2","unstructured":"Robinson, J.A., Voronkov, A. (eds.): Handbook of Automated Reasoning (in 2 volumes). Elsevier and MIT Press (2001)"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"de Mello, A.M., Junior, L.C.L., Foss, L., da Costa Cavalheiro, S.A.: Graph grammars: A comparison between verification methods. In: WEIT, pp. 88\u201394 (2011)","DOI":"10.1109\/WEIT.2011.17"},{"issue":"4","key":"11_CR4","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1016\/j.scico.2010.02.006","volume":"77","author":"S.A. Costa da","year":"2012","unstructured":"da Costa, S.A., Ribeiro, L.: Verification of graph grammars using a logical approach. Sci. Comput. Program.\u00a077(4), 480\u2013504 (2012)","journal-title":"Sci. Comput. Program."},{"key":"11_CR5","unstructured":"Ribeiro, L., Dotti, F.L., da Costa, S.A., Dillenburg, F.C.: Towards theorem proving graph grammars using Event-B. ECEASST\u00a030 (2010)"},{"key":"11_CR6","unstructured":"da Costa, S.A.: Relational approach of graph grammars. PhD thesis, UFRGS, Brazil (2010)"},{"key":"11_CR7","unstructured":"DEPLOY: Event-B and the rodin platform (Mai 2013), \n                  \n                    http:\/\/www.event-b.org\/\n                  \n                  \n                 (last accessed Mai 2013)"},{"issue":"6","key":"11_CR8","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/s10009-010-0145-y","volume":"12","author":"J.R. Abrial","year":"2010","unstructured":"Abrial, J.R., Butler, M., Hallerstede, S., Hoang, T.S., Mehta, F., Voisin, L.: Rodin: An open toolset for modelling and reasoning in Event-B. International Journal on Software Tools for Technology Transfer (STTT)\u00a012(6), 447\u2013466 (2010)","journal-title":"International Journal on Software Tools for Technology Transfer (STTT)"},{"key":"11_CR9","unstructured":"Tanenbaum, A.: Computer Networks, 4th edn. Prentice Hall Professional Technical Reference (2002)"},{"key":"11_CR10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139195881","volume-title":"Modeling in Event-B: System and Software Engineering","author":"J.R. Abrial","year":"2010","unstructured":"Abrial, J.R.: Modeling in Event-B: System and Software Engineering, 1st edn. Cambridge University Press, New York (2010)","edition":"1"},{"key":"11_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/978-3-642-33296-8_8","volume-title":"Formal Methods: Foundations and Applications","author":"S.A. Costa Cavalheiro da","year":"2012","unstructured":"da Costa Cavalheiro, S.A., Foss, L., Ribeiro, L.: Specification patterns for properties over reachable states of graph grammars. In: Gheyi, R., Naumann, D. (eds.) SBMF 2012. LNCS, vol.\u00a07498, pp. 83\u201398. Springer, Heidelberg (2012)"}],"container-title":["Lecture Notes in Computer Science","Formal Methods: Foundations and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-41071-0_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T20:26:57Z","timestamp":1558038417000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-41071-0_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642410703","9783642410710"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-41071-0_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}