Towards a Rule-Level Verification Framework for Property-Preserving Graph Transformations
We report in this paper a method for proving that a graph transformation is property-preserving. Our approach uses a relational representation for graph grammar and a logical representation for graph properties with first-order logic formulas. The presented work consists in identifying the general c...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 953 |
|---|---|
| container_issue | |
| container_start_page | 946 |
| container_title | |
| container_volume | |
| creator | Hanh Nhi Tran Percebois, C. |
| description | We report in this paper a method for proving that a graph transformation is property-preserving. Our approach uses a relational representation for graph grammar and a logical representation for graph properties with first-order logic formulas. The presented work consists in identifying the general conditions for a graph grammar to preserve graph properties, in particular structural properties. We aim to implement all the relevant notions of graph grammar in the Isabelle/HOL proof assistant in order to allow a (semi) automatic verification of graph transformation with a reasonable complexity. Given an input graph and a set of graph transformation rules, we can use mathematical induction strategies to verify statically if the transformation preserves a particular property of the initial graph. The main highlight of our approach is that such a verification is done without calculating the resulting graph and thus without using a transformation engine. |
| doi_str_mv | 10.1109/ICST.2012.200 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>hal_6IE</sourceid><recordid>TN_cdi_ieee_primary_6200119</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6200119</ieee_id><sourcerecordid>oai_HAL_hal_00690923v1</sourcerecordid><originalsourceid>FETCH-LOGICAL-h1630-c74ead7cde902f3286d4ea12342cc8c2fafda0203a4e32c3c6ce2335f83c9c93</originalsourceid><addsrcrecordid>eNo9kM1PwzAMxcOXxBg7cuKSK4cOJ06T5jhNbEyaxAQVEqcqSl1W6NYpHZv23xMYwodn-fn3fDBjNwKGQoC9n41f8qEEIaPACRtYk4HRNlXagDplPWmMSBCsOGNXQqVxsqDFeVyI1CYqU9klG3TdB8QygBZtj73l7d6FsuOOP381lMxpRw1_pVBXtXfbul3zSXAr2rfhk1dt4IvQbihsD8kiUEdhV6_f-TS4zZLnwa27iKx-Y901u6hc09Hgr_dZPnnIx4_J_Gk6G4_myVJohMQbRa40viQLskKZ6TIaQqKS3mdeVq4qHUhApwilR689ScS0ytBbb7HP7o5nl64pNqFeuXAoWlcXj6N58eMBaAtW4k5E9vbI1kT0D-v4TSEsfgPEvWTb</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Towards a Rule-Level Verification Framework for Property-Preserving Graph Transformations</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Hanh Nhi Tran ; Percebois, C.</creator><creatorcontrib>Hanh Nhi Tran ; Percebois, C.</creatorcontrib><description>We report in this paper a method for proving that a graph transformation is property-preserving. Our approach uses a relational representation for graph grammar and a logical representation for graph properties with first-order logic formulas. The presented work consists in identifying the general conditions for a graph grammar to preserve graph properties, in particular structural properties. We aim to implement all the relevant notions of graph grammar in the Isabelle/HOL proof assistant in order to allow a (semi) automatic verification of graph transformation with a reasonable complexity. Given an input graph and a set of graph transformation rules, we can use mathematical induction strategies to verify statically if the transformation preserves a particular property of the initial graph. The main highlight of our approach is that such a verification is done without calculating the resulting graph and thus without using a transformation engine.</description><identifier>ISSN: 2159-4848</identifier><identifier>ISBN: 1457719061</identifier><identifier>ISBN: 9781457719066</identifier><identifier>ISBN: 9780769546704</identifier><identifier>ISBN: 0769546706</identifier><identifier>EISSN: 2771-3091</identifier><identifier>EISBN: 9780769546704</identifier><identifier>EISBN: 0769546706</identifier><identifier>DOI: 10.1109/ICST.2012.200</identifier><language>eng</language><publisher>IEEE</publisher><subject>Analytical models ; Cognition ; Computer Science ; Context ; Encoding ; Finite element methods ; Grammar ; Image edge detection ; Isabelle/HOL ; property-preserving graph grammar ; Software Engineering ; theorem proving ; verification of graph transformations</subject><ispartof>2012 IEEE Fifth International Conference on Software Testing, Verification and Validation, 2012, p.946-953</ispartof><rights>Distributed under a Creative Commons Attribution 4.0 International License</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><orcidid>0000-0003-0868-1253</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/6200119$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>230,309,310,780,784,789,790,885,2058,27925,54920</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/6200119$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc><backlink>$$Uhttps://ensta-bretagne.hal.science/hal-00690923$$DView record in HAL$$Hfree_for_read</backlink></links><search><creatorcontrib>Hanh Nhi Tran</creatorcontrib><creatorcontrib>Percebois, C.</creatorcontrib><title>Towards a Rule-Level Verification Framework for Property-Preserving Graph Transformations</title><title>2012 IEEE Fifth International Conference on Software Testing, Verification and Validation</title><addtitle>icst</addtitle><description>We report in this paper a method for proving that a graph transformation is property-preserving. Our approach uses a relational representation for graph grammar and a logical representation for graph properties with first-order logic formulas. The presented work consists in identifying the general conditions for a graph grammar to preserve graph properties, in particular structural properties. We aim to implement all the relevant notions of graph grammar in the Isabelle/HOL proof assistant in order to allow a (semi) automatic verification of graph transformation with a reasonable complexity. Given an input graph and a set of graph transformation rules, we can use mathematical induction strategies to verify statically if the transformation preserves a particular property of the initial graph. The main highlight of our approach is that such a verification is done without calculating the resulting graph and thus without using a transformation engine.</description><subject>Analytical models</subject><subject>Cognition</subject><subject>Computer Science</subject><subject>Context</subject><subject>Encoding</subject><subject>Finite element methods</subject><subject>Grammar</subject><subject>Image edge detection</subject><subject>Isabelle/HOL</subject><subject>property-preserving graph grammar</subject><subject>Software Engineering</subject><subject>theorem proving</subject><subject>verification of graph transformations</subject><issn>2159-4848</issn><issn>2771-3091</issn><isbn>1457719061</isbn><isbn>9781457719066</isbn><isbn>9780769546704</isbn><isbn>0769546706</isbn><isbn>9780769546704</isbn><isbn>0769546706</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2012</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNo9kM1PwzAMxcOXxBg7cuKSK4cOJ06T5jhNbEyaxAQVEqcqSl1W6NYpHZv23xMYwodn-fn3fDBjNwKGQoC9n41f8qEEIaPACRtYk4HRNlXagDplPWmMSBCsOGNXQqVxsqDFeVyI1CYqU9klG3TdB8QygBZtj73l7d6FsuOOP381lMxpRw1_pVBXtXfbul3zSXAr2rfhk1dt4IvQbihsD8kiUEdhV6_f-TS4zZLnwa27iKx-Y901u6hc09Hgr_dZPnnIx4_J_Gk6G4_myVJohMQbRa40viQLskKZ6TIaQqKS3mdeVq4qHUhApwilR689ScS0ytBbb7HP7o5nl64pNqFeuXAoWlcXj6N58eMBaAtW4k5E9vbI1kT0D-v4TSEsfgPEvWTb</recordid><startdate>201204</startdate><enddate>201204</enddate><creator>Hanh Nhi Tran</creator><creator>Percebois, C.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope><scope>1XC</scope><scope>VOOES</scope><orcidid>https://orcid.org/0000-0003-0868-1253</orcidid></search><sort><creationdate>201204</creationdate><title>Towards a Rule-Level Verification Framework for Property-Preserving Graph Transformations</title><author>Hanh Nhi Tran ; Percebois, C.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-h1630-c74ead7cde902f3286d4ea12342cc8c2fafda0203a4e32c3c6ce2335f83c9c93</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2012</creationdate><topic>Analytical models</topic><topic>Cognition</topic><topic>Computer Science</topic><topic>Context</topic><topic>Encoding</topic><topic>Finite element methods</topic><topic>Grammar</topic><topic>Image edge detection</topic><topic>Isabelle/HOL</topic><topic>property-preserving graph grammar</topic><topic>Software Engineering</topic><topic>theorem proving</topic><topic>verification of graph transformations</topic><toplevel>online_resources</toplevel><creatorcontrib>Hanh Nhi Tran</creatorcontrib><creatorcontrib>Percebois, C.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection><collection>Hyper Article en Ligne (HAL)</collection><collection>Hyper Article en Ligne (HAL) (Open Access)</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Hanh Nhi Tran</au><au>Percebois, C.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Towards a Rule-Level Verification Framework for Property-Preserving Graph Transformations</atitle><btitle>2012 IEEE Fifth International Conference on Software Testing, Verification and Validation</btitle><stitle>icst</stitle><date>2012-04</date><risdate>2012</risdate><spage>946</spage><epage>953</epage><pages>946-953</pages><issn>2159-4848</issn><eissn>2771-3091</eissn><isbn>1457719061</isbn><isbn>9781457719066</isbn><isbn>9780769546704</isbn><isbn>0769546706</isbn><eisbn>9780769546704</eisbn><eisbn>0769546706</eisbn><abstract>We report in this paper a method for proving that a graph transformation is property-preserving. Our approach uses a relational representation for graph grammar and a logical representation for graph properties with first-order logic formulas. The presented work consists in identifying the general conditions for a graph grammar to preserve graph properties, in particular structural properties. We aim to implement all the relevant notions of graph grammar in the Isabelle/HOL proof assistant in order to allow a (semi) automatic verification of graph transformation with a reasonable complexity. Given an input graph and a set of graph transformation rules, we can use mathematical induction strategies to verify statically if the transformation preserves a particular property of the initial graph. The main highlight of our approach is that such a verification is done without calculating the resulting graph and thus without using a transformation engine.</abstract><pub>IEEE</pub><doi>10.1109/ICST.2012.200</doi><tpages>8</tpages><orcidid>https://orcid.org/0000-0003-0868-1253</orcidid><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 2159-4848 |
| ispartof | 2012 IEEE Fifth International Conference on Software Testing, Verification and Validation, 2012, p.946-953 |
| issn | 2159-4848 2771-3091 |
| language | eng |
| recordid | cdi_ieee_primary_6200119 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Analytical models Cognition Computer Science Context Encoding Finite element methods Grammar Image edge detection Isabelle/HOL property-preserving graph grammar Software Engineering theorem proving verification of graph transformations |
| title | Towards a Rule-Level Verification Framework for Property-Preserving Graph Transformations |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-24T06%3A11%3A34IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-hal_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Towards%20a%20Rule-Level%20Verification%20Framework%20for%20Property-Preserving%20Graph%20Transformations&rft.btitle=2012%20IEEE%20Fifth%20International%20Conference%20on%20Software%20Testing,%20Verification%20and%20Validation&rft.au=Hanh%20Nhi%20Tran&rft.date=2012-04&rft.spage=946&rft.epage=953&rft.pages=946-953&rft.issn=2159-4848&rft.eissn=2771-3091&rft.isbn=1457719061&rft.isbn_list=9781457719066&rft.isbn_list=9780769546704&rft.isbn_list=0769546706&rft_id=info:doi/10.1109/ICST.2012.200&rft_dat=%3Chal_6IE%3Eoai_HAL_hal_00690923v1%3C/hal_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=9780769546704&rft.eisbn_list=0769546706&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=6200119&rfr_iscdi=true |