Testing from Algebraic Specifications: Test Data Set Selection by Unfolding Axioms
This paper deals with test data set selection from algebraic specifications. Test data sets are generated from selection criteria which are usually defined to cover specification axioms. The unfolding selection criterion consists in covering the input domain of an operation using case analysis. The...
Gespeichert in:
| Hauptverfasser: | , , , , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 217 |
|---|---|
| container_issue | |
| container_start_page | 203 |
| container_title | |
| container_volume | 3997 |
| creator | Aiguier, Marc Arnould, Agnès Boin, Clément Le Gall, Pascale Marre, Bruno |
| description | This paper deals with test data set selection from algebraic specifications. Test data sets are generated from selection criteria which are usually defined to cover specification axioms. The unfolding selection criterion consists in covering the input domain of an operation using case analysis. The unfolding procedure can be iterated in order to split input domains of operations into finer subdomains. In this paper we propose to extend an unfolding procedure previously developed in [5, 19] that could only be performed on very low level, i.e. executable specifications. On the contrary, our new unfolding procedure can be applied to any positive conditional specification. We show that our unfolding procedure is sound (no test is added) and complete (no test is lost) with respect to the starting reference test data set. |
| doi_str_mv | 10.1007/11759744_14 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>hal_pasca</sourceid><recordid>TN_cdi_pascalfrancis_primary_20039798</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>oai_HAL_hal_00341964v1</sourcerecordid><originalsourceid>FETCH-LOGICAL-h290t-28e62258c5ca2d56363ca9cc7bff45dd18400e68d4fad0b735802d2549ad61343</originalsourceid><addsrcrecordid>eNpVkUlrwzAQhdUNmqY59Q_o0kMPbkebZfVm0hUChSY5C1mSE7WOHSxTmn9fm5Quh2Fg3vceDA-hCwLXBEDeECKFkpxrwg_QRMmMCQ6McyHIIRqRlJCEMa6O_mmcH6MRMKBJb2Wn6CzGNwCgUtERel342IV6hcu22eC8WvmiNcHi-dbbUAZrutDU8RYPGL4zncFz3_VTeTsouNjhZV02lRsy8s_QbOI5OilNFf3ke4_R8uF-MX1KZi-Pz9N8lqypgi6hmU8pFZkV1lAnUpYya5S1sihLLpwjGQfwaeZ4aRwUkokMqKOCK-NSwjgbo6t97tpUetuGjWl3ujFBP-UzPdygf5-olH-Qnr3cs1sTranK1tQ2xB8X7VElVfabGXupXvlWF03zHjUBPRSg_xTAvgBjQHDD</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Testing from Algebraic Specifications: Test Data Set Selection by Unfolding Axioms</title><source>Springer Books</source><creator>Aiguier, Marc ; Arnould, Agnès ; Boin, Clément ; Le Gall, Pascale ; Marre, Bruno</creator><contributor>Grieskamp, Wolfgang ; Weise, Carsten</contributor><creatorcontrib>Aiguier, Marc ; Arnould, Agnès ; Boin, Clément ; Le Gall, Pascale ; Marre, Bruno ; Grieskamp, Wolfgang ; Weise, Carsten</creatorcontrib><description>This paper deals with test data set selection from algebraic specifications. Test data sets are generated from selection criteria which are usually defined to cover specification axioms. The unfolding selection criterion consists in covering the input domain of an operation using case analysis. The unfolding procedure can be iterated in order to split input domains of operations into finer subdomains. In this paper we propose to extend an unfolding procedure previously developed in [5, 19] that could only be performed on very low level, i.e. executable specifications. On the contrary, our new unfolding procedure can be applied to any positive conditional specification. We show that our unfolding procedure is sound (no test is added) and complete (no test is lost) with respect to the starting reference test data set.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 9783540344544</identifier><identifier>ISBN: 3540344543</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 9783540344551</identifier><identifier>EISBN: 3540344551</identifier><identifier>DOI: 10.1007/11759744_14</identifier><language>eng</language><publisher>Berlin, Heidelberg: Springer Berlin Heidelberg</publisher><subject>algebraic specifications ; Applied sciences ; Computer Science ; Computer science; control theory; systems ; conditional rewriting ; Exact sciences and technology ; Multiagent Systems ; Programming Languages ; proof tree normalization ; selection criteria ; Software ; Software Engineering ; Specification-based testing ; unfolding ; Web</subject><ispartof>Formal Approaches to Software Testing, 2006, Vol.3997, p.203-217</ispartof><rights>Springer-Verlag Berlin Heidelberg 2006</rights><rights>2008 INIST-CNRS</rights><rights>Distributed under a Creative Commons Attribution 4.0 International License</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><orcidid>0000-0003-0154-0909 ; 0000-0002-8955-6835</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/11759744_14$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/11759744_14$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>230,309,310,777,778,782,787,788,791,883,27908,38238,41425,42494</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=20039798$$DView record in Pascal Francis$$Hfree_for_read</backlink><backlink>$$Uhttps://hal.science/hal-00341964$$DView record in HAL$$Hfree_for_read</backlink></links><search><contributor>Grieskamp, Wolfgang</contributor><contributor>Weise, Carsten</contributor><creatorcontrib>Aiguier, Marc</creatorcontrib><creatorcontrib>Arnould, Agnès</creatorcontrib><creatorcontrib>Boin, Clément</creatorcontrib><creatorcontrib>Le Gall, Pascale</creatorcontrib><creatorcontrib>Marre, Bruno</creatorcontrib><title>Testing from Algebraic Specifications: Test Data Set Selection by Unfolding Axioms</title><title>Formal Approaches to Software Testing</title><description>This paper deals with test data set selection from algebraic specifications. Test data sets are generated from selection criteria which are usually defined to cover specification axioms. The unfolding selection criterion consists in covering the input domain of an operation using case analysis. The unfolding procedure can be iterated in order to split input domains of operations into finer subdomains. In this paper we propose to extend an unfolding procedure previously developed in [5, 19] that could only be performed on very low level, i.e. executable specifications. On the contrary, our new unfolding procedure can be applied to any positive conditional specification. We show that our unfolding procedure is sound (no test is added) and complete (no test is lost) with respect to the starting reference test data set.</description><subject>algebraic specifications</subject><subject>Applied sciences</subject><subject>Computer Science</subject><subject>Computer science; control theory; systems</subject><subject>conditional rewriting</subject><subject>Exact sciences and technology</subject><subject>Multiagent Systems</subject><subject>Programming Languages</subject><subject>proof tree normalization</subject><subject>selection criteria</subject><subject>Software</subject><subject>Software Engineering</subject><subject>Specification-based testing</subject><subject>unfolding</subject><subject>Web</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>9783540344544</isbn><isbn>3540344543</isbn><isbn>9783540344551</isbn><isbn>3540344551</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2006</creationdate><recordtype>conference_proceeding</recordtype><recordid>eNpVkUlrwzAQhdUNmqY59Q_o0kMPbkebZfVm0hUChSY5C1mSE7WOHSxTmn9fm5Quh2Fg3vceDA-hCwLXBEDeECKFkpxrwg_QRMmMCQ6McyHIIRqRlJCEMa6O_mmcH6MRMKBJb2Wn6CzGNwCgUtERel342IV6hcu22eC8WvmiNcHi-dbbUAZrutDU8RYPGL4zncFz3_VTeTsouNjhZV02lRsy8s_QbOI5OilNFf3ke4_R8uF-MX1KZi-Pz9N8lqypgi6hmU8pFZkV1lAnUpYya5S1sihLLpwjGQfwaeZ4aRwUkokMqKOCK-NSwjgbo6t97tpUetuGjWl3ujFBP-UzPdygf5-olH-Qnr3cs1sTranK1tQ2xB8X7VElVfabGXupXvlWF03zHjUBPRSg_xTAvgBjQHDD</recordid><startdate>20060101</startdate><enddate>20060101</enddate><creator>Aiguier, Marc</creator><creator>Arnould, Agnès</creator><creator>Boin, Clément</creator><creator>Le Gall, Pascale</creator><creator>Marre, Bruno</creator><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>IQODW</scope><scope>1XC</scope><scope>VOOES</scope><orcidid>https://orcid.org/0000-0003-0154-0909</orcidid><orcidid>https://orcid.org/0000-0002-8955-6835</orcidid></search><sort><creationdate>20060101</creationdate><title>Testing from Algebraic Specifications: Test Data Set Selection by Unfolding Axioms</title><author>Aiguier, Marc ; Arnould, Agnès ; Boin, Clément ; Le Gall, Pascale ; Marre, Bruno</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-h290t-28e62258c5ca2d56363ca9cc7bff45dd18400e68d4fad0b735802d2549ad61343</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2006</creationdate><topic>algebraic specifications</topic><topic>Applied sciences</topic><topic>Computer Science</topic><topic>Computer science; control theory; systems</topic><topic>conditional rewriting</topic><topic>Exact sciences and technology</topic><topic>Multiagent Systems</topic><topic>Programming Languages</topic><topic>proof tree normalization</topic><topic>selection criteria</topic><topic>Software</topic><topic>Software Engineering</topic><topic>Specification-based testing</topic><topic>unfolding</topic><topic>Web</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Aiguier, Marc</creatorcontrib><creatorcontrib>Arnould, Agnès</creatorcontrib><creatorcontrib>Boin, Clément</creatorcontrib><creatorcontrib>Le Gall, Pascale</creatorcontrib><creatorcontrib>Marre, Bruno</creatorcontrib><collection>Pascal-Francis</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</fulltext></delivery><addata><au>Aiguier, Marc</au><au>Arnould, Agnès</au><au>Boin, Clément</au><au>Le Gall, Pascale</au><au>Marre, Bruno</au><au>Grieskamp, Wolfgang</au><au>Weise, Carsten</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Testing from Algebraic Specifications: Test Data Set Selection by Unfolding Axioms</atitle><btitle>Formal Approaches to Software Testing</btitle><date>2006-01-01</date><risdate>2006</risdate><volume>3997</volume><spage>203</spage><epage>217</epage><pages>203-217</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>9783540344544</isbn><isbn>3540344543</isbn><eisbn>9783540344551</eisbn><eisbn>3540344551</eisbn><abstract>This paper deals with test data set selection from algebraic specifications. Test data sets are generated from selection criteria which are usually defined to cover specification axioms. The unfolding selection criterion consists in covering the input domain of an operation using case analysis. The unfolding procedure can be iterated in order to split input domains of operations into finer subdomains. In this paper we propose to extend an unfolding procedure previously developed in [5, 19] that could only be performed on very low level, i.e. executable specifications. On the contrary, our new unfolding procedure can be applied to any positive conditional specification. We show that our unfolding procedure is sound (no test is added) and complete (no test is lost) with respect to the starting reference test data set.</abstract><cop>Berlin, Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/11759744_14</doi><tpages>15</tpages><orcidid>https://orcid.org/0000-0003-0154-0909</orcidid><orcidid>https://orcid.org/0000-0002-8955-6835</orcidid><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0302-9743 |
| ispartof | Formal Approaches to Software Testing, 2006, Vol.3997, p.203-217 |
| issn | 0302-9743 1611-3349 |
| language | eng |
| recordid | cdi_pascalfrancis_primary_20039798 |
| source | Springer Books |
| subjects | algebraic specifications Applied sciences Computer Science Computer science control theory systems conditional rewriting Exact sciences and technology Multiagent Systems Programming Languages proof tree normalization selection criteria Software Software Engineering Specification-based testing unfolding Web |
| title | Testing from Algebraic Specifications: Test Data Set Selection by Unfolding Axioms |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-16T13%3A58%3A14IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-hal_pasca&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Testing%20from%20Algebraic%20Specifications:%20Test%20Data%20Set%20Selection%20by%20Unfolding%20Axioms&rft.btitle=Formal%20Approaches%20to%20Software%20Testing&rft.au=Aiguier,%20Marc&rft.date=2006-01-01&rft.volume=3997&rft.spage=203&rft.epage=217&rft.pages=203-217&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=9783540344544&rft.isbn_list=3540344543&rft_id=info:doi/10.1007/11759744_14&rft_dat=%3Chal_pasca%3Eoai_HAL_hal_00341964v1%3C/hal_pasca%3E%3Curl%3E%3C/url%3E&rft.eisbn=9783540344551&rft.eisbn_list=3540344551&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |