{ "labelLang" : "hun", "responseDate" : "2024-03-29 16:58", "content" : { "otype" : "JournalArticle", "mtid" : 23929075, "status" : "ADMIN_APPROVED", "published" : true, "unhandledTickets" : 0, "oldTimestamp" : "2018-10-01T21:59:18.000+0000", "deleted" : false, "oldId" : 13929075, "lastRefresh" : "2022-07-29T04:38:01.683+0000", "lastModified" : "2018-10-01T21:59:18.000+0000", "created" : "2013-03-13T16:37:00.000+0000", "creator" : { "otype" : "Admin", "mtid" : 10018988, "link" : "/api/admin/10018988", "label" : "Kollár István (BME admin 5 - INAKTÍV)", "familyName" : "Kollár", "givenName" : "István", "published" : true, "oldId" : 10018988, "snippet" : true }, "lastDuplumOK" : "2018-10-20T20:20:31.229+0000", "lastDuplumSearch" : "2018-10-20T20:20:31.229+0000", "adminApproved" : "2013-06-04T10:57:15.000+0000", "adminApprover" : { "otype" : "Admin", "mtid" : 10044917, "link" : "/api/admin/10044917", "label" : "Scopus szerint idézi (BME) (BME admin 5 - INAKTÍV)", "familyName" : "Scopus szerint idézi", "givenName" : "(BME)", "published" : true, "oldId" : 10044917, "snippet" : true }, "core" : false, "citation" : true, "publicationPending" : false, "type" : { "otype" : "PublicationType", "mtid" : 24, "link" : "/api/publicationtype/24", "label" : "Folyóiratcikk", "code" : 24, "otypeName" : "JournalArticle", "listPosition" : 1, "published" : true, "oldId" : 24, "snippet" : true }, "languages" : [ { "otype" : "Language", "mtid" : 10002, "link" : "/api/language/10002", "label" : "Angol", "name" : "Angol", "nameEng" : "English", "published" : true, "oldId" : 2, "snippet" : true } ], "firstAuthor" : "Da, Costa S A", "authorships" : [ { "otype" : "PersonAuthorship", "mtid" : 33663352, "link" : "/api/authorship/33663352", "label" : "Da, Costa S A", "listPosition" : 1, "share" : 0.0, "first" : true, "last" : false, "familyName" : "Da", "givenName" : "Costa S A", "authorTyped" : true, "editorTyped" : false, "otherTyped" : false, "type" : { "otype" : "AuthorshipType", "mtid" : 1, "link" : "/api/authorshiptype/1", "label" : "Szerző", "code" : 0, "published" : true, "oldId" : 0, "snippet" : true }, "published" : false, "oldId" : 54640424, "snippet" : true }, { "otype" : "PersonAuthorship", "mtid" : 33663353, "link" : "/api/authorship/33663353", "label" : "Ribeiro, L", "listPosition" : 2, "share" : 0.0, "first" : false, "last" : true, "familyName" : "Ribeiro", "givenName" : "L", "authorTyped" : true, "editorTyped" : false, "otherTyped" : false, "type" : { "otype" : "AuthorshipType", "mtid" : 1, "link" : "/api/authorshiptype/1", "label" : "Szerző", "code" : 0, "published" : true, "oldId" : 0, "snippet" : true }, "published" : false, "oldId" : 54640423, "snippet" : true } ], "title" : "Verification of graph grammars using a logical approach", "identifiers" : [ { "otype" : "PublicationIdentifier", "mtid" : 7712323, "link" : "/api/publicationidentifier/7712323", "label" : "DOI: 10.1016/j.scico.2010.02.006", "source" : { "otype" : "PlainSource", "mtid" : 6, "link" : "/api/publicationsource/6", "label" : "DOI", "type" : { "otype" : "PublicationSourceType", "mtid" : 10001, "link" : "/api/publicationsourcetype/10001", "label" : "DOI", "mayHaveOa" : true, "published" : true, "snippet" : true }, "name" : "DOI", "nameEng" : "DOI", "linkPattern" : "https://doi.org/@@@", "publiclyVisible" : true, "published" : true, "oldId" : 6, "snippet" : true }, "validState" : "NO", "idValue" : "10.1016/j.scico.2010.02.006", "realUrl" : "https://doi.org/10.1016%2Fj.scico.2010.02.006", "published" : false, "oldId" : 6213717, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 7712321, "link" : "/api/publicationidentifier/7712321", "label" : "WoS: 000301328200004", "source" : { "otype" : "PlainSource", "mtid" : 1, "link" : "/api/publicationsource/1", "label" : "WoS", "type" : { "otype" : "PublicationSourceType", "mtid" : 10003, "link" : "/api/publicationsourcetype/10003", "label" : "Indexelő adatbázis", "mayHaveOa" : false, "published" : true, "snippet" : true }, "name" : "WoS", "nameEng" : "WoS", "linkPattern" : "http://gateway.isiknowledge.com/gateway/Gateway.cgi?&GWVersion=2&SrcAuth=CustomerName&SrcApp=CustomerName&DestLinkType=FullRecord&KeyUT=@@@&DestApp=WOS", "publiclyVisible" : true, "published" : true, "oldId" : 1, "snippet" : true }, "validState" : "IDENTICAL", "idValue" : "000301328200004", "realUrl" : "http://gateway.isiknowledge.com/gateway/Gateway.cgi?&GWVersion=2&SrcAuth=CustomerName&SrcApp=CustomerName&DestLinkType=FullRecord&KeyUT=000301328200004&DestApp=WOS", "published" : false, "oldId" : 6213715, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 7712322, "link" : "/api/publicationidentifier/7712322", "label" : "Scopus: 84857045778", "source" : { "otype" : "PlainSource", "mtid" : 3, "link" : "/api/publicationsource/3", "label" : "Scopus", "type" : { "otype" : "PublicationSourceType", "mtid" : 10003, "link" : "/api/publicationsourcetype/10003", "label" : "Indexelő adatbázis", "mayHaveOa" : false, "published" : true, "snippet" : true }, "name" : "Scopus", "linkPattern" : "http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-@@@", "publiclyVisible" : true, "published" : true, "oldId" : 3, "snippet" : true }, "validState" : "NO", "idValue" : "84857045778", "realUrl" : "http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84857045778", "published" : false, "oldId" : 6213716, "snippet" : true } ], "journal" : { "otype" : "Journal", "mtid" : 4022, "link" : "/api/journal/4022", "label" : "SCIENCE OF COMPUTER PROGRAMMING 0167-6423 1872-7964", "pIssn" : "0167-6423", "eIssn" : "1872-7964", "reviewType" : "REVIEWED", "noIF" : false, "sciIndexed" : true, "scopusIndexed" : true, "lang" : "FOREIGN", "hungarian" : false, "published" : true, "oldId" : 4022, "snippet" : true }, "volume" : "77", "issue" : "4", "firstPage" : "480", "lastPage" : "504", "firstPageOrInternalIdForSort" : "480", "pageLength" : 25, "publishedYear" : 2012, "digital" : null, "printed" : null, "sourceYear" : 2013, "packet" : "bme-pa-migracio-20014-06-20-v01", "foreignEdition" : true, "foreignLanguage" : true, "fullPublication" : false, "conferencePublication" : null, "nationalOrigin" : null, "missingAuthor" : false, "oaType" : "NONE", "oaCheckDate" : "2022-07-29", "oaFree" : false, "citationCount" : 0, "citationCountUnpublished" : 0, "citationCountWoOther" : 0, "independentCitCountWoOther" : 0, "doiCitationCount" : 0, "wosCitationCount" : 0, "scopusCitationCount" : 0, "independentCitationCount" : 0, "unhandledCitationCount" : 0, "citingPubCount" : 0, "independentCitingPubCount" : 0, "unhandledCitingPubCount" : 0, "citedPubCount" : 1, "citedCount" : 1, "referenceList" : "Ehrig, H., Engels, G., Kreowski, H.-J., Rozenberg, G., (1999) Handbook of Graph Grammars and Computing by Graph Transformation: Vol. 2: Applications, Languages, and Tools, , World Scientific Publishing Co., Inc. River Edge, NJ, USA;\nDotti, F.L., Foss, L., Ribeiro, L., Santos, O.M., Verification of distributed object-based systems (2003) 6th International Conference on Formal Methods for Open Object-based Distributed Systems, 2884, pp. 261-275. , LNCS Springer;\nHolzmann, G.J., The model checker SPIN (1997) IEEE Transactions on Software Engineering, 23 (5), pp. 279-295;\nMichelon, L., Costa, S.A., Ribeiro, L., Specification of real-time systems with graph grammars (2006) Brazilian Symposium on Software Engineering, pp. 97-112. , P.C. Masiero;\nBehrmann, G., David, A., Larsen, K.G., Tutorial on uppaal (2004) Formal Methods for the Design of Real-Time Systems, 3185, pp. 200-236. , LNCS Springer;\nRensink, A., Schmidt, A., Varr, D., Model checking graph transformations: A comparison of two approaches (2004) Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3256, pp. 226-241;\nClarke, E., Grumberg, O., Jha, S., Lu, Y., Veith, H., Progress on the State Explosion Problem in Model Checking (2001) Lecture Notes in Computer Science, (2000), pp. 176-194;\nBaldan, P., Corradini, A., Knig, B., A framework for the verification of infinite-state graph transformation systems (2008) Information and Computation, 206, pp. 869-907;\nBaldan, P., Knig, B., Approximating the behaviour of graph transformation systems (2002) Proceedings of ICGT '02 (International Conference on Graph Transformation), 2505, pp. 14-29. , LNCS Springer;\nBaldan, P., Corradini, A., Montanari, U., Ribeiro, L., Unfolding semantics of graph transformation (2007) Information and Computation, 205 (5), pp. 733-782. , DOI 10.1016/j.ic.2006.11.004, PII S0890540106001611;\nDwyer, M.B., Hatcliff, J., Robby, Pasareanu, C.S., Visser, W., Formal software analysis emerging trends in software model checking (2007) FoSE 2007: Future of Software Engineering, pp. 120-136. , DOI 10.1109/FOSE.2007.6, 4221616, FoSE 2007: Future of Software Engineering;\nRobinson, J.A., Voronkov, A., (2001) Handbook of Automated Reasoning (In 2 Volumes), , Elsevier and MIT Press;\nClarke, E.M., Wing, J.M., Alur, R., Clarke, E., Cleaveland, R., Dill, D., Emerson, A., Zave, P., Formal methods: State of the art and future directions (1996) ACM Computing Surveys, 28 (4), pp. 626-643;\nAbdulla, P.A., Jonsson, B., Nilsson, M., D'Orso, J., Saksena, M., Regular model checking for ltl(mso) Alur and Peled, (34), p. 348360;\nBouajjani, A., Habermehl, P., Vojnar, T., Abstract regular model checking Alur and Peled, (34), p. 372386;\nKesten, Y., Maler, O., Marcus, M., Pnueli, A., Shahar, E., Symbolic model checking with rich assertional languages (2001) Theoretical Computer Science, 256 (1-2), pp. 93-112. , DOI 10.1016/S0304-3975(00)00103-1, PII S0304397500001031;\nDelzanno, G., Automatic verification of parameterized cache coherence protocols (2000) CAV '00: Proceedings of the 12th International Conference on Computer Aided Verification, pp. 53-68. , Springer-Verlag London, UK;\nFisher, M., Konev, B., Lisitsa, A., Practical infinite-state verification with temporal reasoning (2005) VISSAS, 1, pp. 91-100. , E.M. Clarke, M. Minea, F.L. Tiplea, NATO Security through Science Series D: Information and Communication Security IOS Press;\nEhrig, H., Heckel, R., Korff, M., Lwe, M., Ribeiro, L., Wagner, A., Corradini, A., Algebraic approaches to graph transformation (1997) Part Ii: Single Pushout Approach and Comparison with Double Pushout Approach, p. 247312;\nCourcelle, B., The expression of graph properties and graph transformations in monadic second-order logic Rozenberg, (30), p. 313400;\nCourcelle, B., Monadic second-order definable graph transductions: A survey (1994) Theoretical Computer Science, 126 (1), pp. 53-75;\nCourcelle, B., Recognizable sets of graphs, hypergraphs and relational structures: A survey (2004) Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3340, pp. 1-11;\nBaresi, L., Spoletini, P., On the use of alloy to analyze graph transformation systems (2006) Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), LNCS 4178, pp. 306-320. , Graph Transformations - Third International Conference, ICGT 2006, Proceedings;\nStrecker, M., Modeling and Verifying Graph Transformations in Proof Assistants (2008) Electronic Notes in Theoretical Computer Science, 203 (1), pp. 135-148. , DOI 10.1016/j.entcs.2008.03.039, PII S1571066108001448;\nDa Costa, S.A., Ribeiro, L., Formal verification of graph grammars using mathematical induction (2009) Electronic Notes in Theoretical Computer Science, 240, pp. 43-60. , http://dx.doi.org/10.1016/j.entcs.2009.05.044;\nLwe, M., Korff, M., Wagner, A., (1993) An Algebraic Framework for the Transformation of Attributed Graphs, p. 185199;\nKastenberg, H., Towards Attributed Graphs in Groove. Work in Progress (2006) Electronic Notes in Theoretical Computer Science, 154 (SPEC. ISS. 2), pp. 47-54. , DOI 10.1016/j.entcs.2005.03.030, PII S1571066106003100;\nKnig, B., Kozioura, V., Towards the verification of attributed graph transformation systems (2008) Graph Transformations, 4th Int. Conference, 5214, pp. 305-320. , ICGT 2008 Lecture Notes in Computer Science Springer;\nEhrig, H., Ehrig, K., Prange, U., Taentzer, G., Fundamental theory for typed attributed graphs and graph transformation based on adhesive HLR categories (2006) Fundamenta Informaticae, 74 (1), pp. 31-61. , Special Issue on ICGT 2004;\nRozenberg, G., (1997) Handbook of Graph Grammars and Computing by Graph Transformations, Volume 1: Foundations, , World Scientific;\nTanenbaum, A., (2002) Computer Networks, , Prentice Hall;\nGurevich, Y., Monadic second-order theories (1985) Model-Theoretic Logics, pp. 479-506. , J. Barwise, S. Feferman, Springer;\nTaentzer, G., Agg: A tool environment for algebraic graph transformation (2000) Applications of Graph Transformations with Industrial Relevance, International Workshop, 1779, pp. 481-488. , AGTIVE'99 Lecture Notes in Computer Science Springer;\nAlur, R., Peled, D., (2004) Computer Aided Verification, 16th International Conference, CAV 2004, Boston, MA, USA, July 1317, 2004, Proceedings, 3114. , Lecture Notes in Computer Science Springer", "hasCitationDuplums" : false, "userChangeableUntil" : "2013-06-04T10:57:15.000+0000", "publishDate" : "2014-08-13T10:10:49.000+0000", "directInstitutesForSort" : "", "ownerAuthorCount" : 1, "ownerInstituteCount" : 4, "directInstituteCount" : 0, "authorCount" : 2, "contributorCount" : 0, "hasQualityFactor" : false, "link" : "/api/publication/23929075", "label" : "Da Costa S et al. Verification of graph grammars using a logical approach. (2012) SCIENCE OF COMPUTER PROGRAMMING 0167-6423 1872-7964 77 4 480-504", "template" : "