Test criteria for context-free grammars
This paper discusses the formalization of the test adequacy criterion for context-free grammars. The basic concept of grammar-based testing is introduced and the grammar-based test criterion is formally defined. This paper also proposes a family of grammar-based structural test criteria whose subsum...
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 | 305 vol.1 |
|---|---|
| container_issue | |
| container_start_page | 300 |
| container_title | |
| container_volume | |
| creator | Hu Li Maozhong Jin Chao Liu Zhongyi Gao |
| description | This paper discusses the formalization of the test adequacy criterion for context-free grammars. The basic concept of grammar-based testing is introduced and the grammar-based test criterion is formally defined. This paper also proposes a family of grammar-based structural test criteria whose subsume relations and test set sizes are analyzed, which are used to assess the proposed criteria. Some basic properties based on Weyuker's axiom systems are generalized and some fundamental properties specific to grammar-based testing are proposed We believe the concepts developed in this paper will contribute to the classical theory of software testing adequacy and are very valuable for software test practice |
| doi_str_mv | 10.1109/CMPSAC.2004.1342847 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>pascalfrancis_6IE</sourceid><recordid>TN_cdi_ieee_primary_1342847</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>1342847</ieee_id><sourcerecordid>17480220</sourcerecordid><originalsourceid>FETCH-LOGICAL-i120t-cbccd89b9555acbfab6fd3996bc8f86a12c16b7fbeb18df462002e481fafc1133</originalsourceid><addsrcrecordid>eNpFUEtLAzEYDKhgqfsLetmLeNo1X945lkWtUGnBei7Jt4lE-iLZg_57F1ZwLnOYYZgZQhZAWwBqH7u37fuyaxmlogUumBH6ilRWG6qVlYxRa67JjGpOGw5S35KqlC86QkjQVs_Iwy6UocachpCTq-M513g-DeF7aGIOof7M7nh0udyRm-gOJVR_PCcfz0-7btWsNy-v3XLdJGB0aNAj9sZ6K6V06KPzKvbcWuXRRKMcMATldfTBg-mjUGNzFoSB6CICcD4n91PuxRV0h5jdCVPZX3IaW_zsQQtDx1mjbzH5UgjhX54u4L_zDE9l</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Test criteria for context-free grammars</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Hu Li ; Maozhong Jin ; Chao Liu ; Zhongyi Gao</creator><creatorcontrib>Hu Li ; Maozhong Jin ; Chao Liu ; Zhongyi Gao</creatorcontrib><description>This paper discusses the formalization of the test adequacy criterion for context-free grammars. The basic concept of grammar-based testing is introduced and the grammar-based test criterion is formally defined. This paper also proposes a family of grammar-based structural test criteria whose subsume relations and test set sizes are analyzed, which are used to assess the proposed criteria. Some basic properties based on Weyuker's axiom systems are generalized and some fundamental properties specific to grammar-based testing are proposed We believe the concepts developed in this paper will contribute to the classical theory of software testing adequacy and are very valuable for software test practice</description><identifier>ISSN: 0730-3157</identifier><identifier>ISBN: 9780769522098</identifier><identifier>ISBN: 0769522092</identifier><identifier>DOI: 10.1109/CMPSAC.2004.1342847</identifier><language>eng</language><publisher>Los Alamitos CA: IEEE</publisher><subject>Application software ; Applied sciences ; Chaos ; Computer applications ; Computer science; control theory; systems ; Exact sciences and technology ; Extraterrestrial measurements ; Production ; Software ; Software engineering ; Software testing ; System testing ; Terminology ; Vocabulary</subject><ispartof>Proceedings of the 28th Annual International Computer Software and Applications Conference, 2004. COMPSAC 2004, 2004, p.300-305 vol.1</ispartof><rights>2006 INIST-CNRS</rights><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/1342847$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,776,780,785,786,2052,4036,4037,27902,54895</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/1342847$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=17480220$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Hu Li</creatorcontrib><creatorcontrib>Maozhong Jin</creatorcontrib><creatorcontrib>Chao Liu</creatorcontrib><creatorcontrib>Zhongyi Gao</creatorcontrib><title>Test criteria for context-free grammars</title><title>Proceedings of the 28th Annual International Computer Software and Applications Conference, 2004. COMPSAC 2004</title><addtitle>CMPSAC</addtitle><description>This paper discusses the formalization of the test adequacy criterion for context-free grammars. The basic concept of grammar-based testing is introduced and the grammar-based test criterion is formally defined. This paper also proposes a family of grammar-based structural test criteria whose subsume relations and test set sizes are analyzed, which are used to assess the proposed criteria. Some basic properties based on Weyuker's axiom systems are generalized and some fundamental properties specific to grammar-based testing are proposed We believe the concepts developed in this paper will contribute to the classical theory of software testing adequacy and are very valuable for software test practice</description><subject>Application software</subject><subject>Applied sciences</subject><subject>Chaos</subject><subject>Computer applications</subject><subject>Computer science; control theory; systems</subject><subject>Exact sciences and technology</subject><subject>Extraterrestrial measurements</subject><subject>Production</subject><subject>Software</subject><subject>Software engineering</subject><subject>Software testing</subject><subject>System testing</subject><subject>Terminology</subject><subject>Vocabulary</subject><issn>0730-3157</issn><isbn>9780769522098</isbn><isbn>0769522092</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2004</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNpFUEtLAzEYDKhgqfsLetmLeNo1X945lkWtUGnBei7Jt4lE-iLZg_57F1ZwLnOYYZgZQhZAWwBqH7u37fuyaxmlogUumBH6ilRWG6qVlYxRa67JjGpOGw5S35KqlC86QkjQVs_Iwy6UocachpCTq-M513g-DeF7aGIOof7M7nh0udyRm-gOJVR_PCcfz0-7btWsNy-v3XLdJGB0aNAj9sZ6K6V06KPzKvbcWuXRRKMcMATldfTBg-mjUGNzFoSB6CICcD4n91PuxRV0h5jdCVPZX3IaW_zsQQtDx1mjbzH5UgjhX54u4L_zDE9l</recordid><startdate>2004</startdate><enddate>2004</enddate><creator>Hu Li</creator><creator>Maozhong Jin</creator><creator>Chao Liu</creator><creator>Zhongyi Gao</creator><general>IEEE</general><general>IEEE Computer Society Press</general><scope>6IE</scope><scope>6IH</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIO</scope><scope>IQODW</scope></search><sort><creationdate>2004</creationdate><title>Test criteria for context-free grammars</title><author>Hu Li ; Maozhong Jin ; Chao Liu ; Zhongyi Gao</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i120t-cbccd89b9555acbfab6fd3996bc8f86a12c16b7fbeb18df462002e481fafc1133</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2004</creationdate><topic>Application software</topic><topic>Applied sciences</topic><topic>Chaos</topic><topic>Computer applications</topic><topic>Computer science; control theory; systems</topic><topic>Exact sciences and technology</topic><topic>Extraterrestrial measurements</topic><topic>Production</topic><topic>Software</topic><topic>Software engineering</topic><topic>Software testing</topic><topic>System testing</topic><topic>Terminology</topic><topic>Vocabulary</topic><toplevel>online_resources</toplevel><creatorcontrib>Hu Li</creatorcontrib><creatorcontrib>Maozhong Jin</creatorcontrib><creatorcontrib>Chao Liu</creatorcontrib><creatorcontrib>Zhongyi Gao</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan (POP) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP) 1998-present</collection><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Hu Li</au><au>Maozhong Jin</au><au>Chao Liu</au><au>Zhongyi Gao</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Test criteria for context-free grammars</atitle><btitle>Proceedings of the 28th Annual International Computer Software and Applications Conference, 2004. COMPSAC 2004</btitle><stitle>CMPSAC</stitle><date>2004</date><risdate>2004</risdate><spage>300</spage><epage>305 vol.1</epage><pages>300-305 vol.1</pages><issn>0730-3157</issn><isbn>9780769522098</isbn><isbn>0769522092</isbn><abstract>This paper discusses the formalization of the test adequacy criterion for context-free grammars. The basic concept of grammar-based testing is introduced and the grammar-based test criterion is formally defined. This paper also proposes a family of grammar-based structural test criteria whose subsume relations and test set sizes are analyzed, which are used to assess the proposed criteria. Some basic properties based on Weyuker's axiom systems are generalized and some fundamental properties specific to grammar-based testing are proposed We believe the concepts developed in this paper will contribute to the classical theory of software testing adequacy and are very valuable for software test practice</abstract><cop>Los Alamitos CA</cop><pub>IEEE</pub><doi>10.1109/CMPSAC.2004.1342847</doi></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 0730-3157 |
| ispartof | Proceedings of the 28th Annual International Computer Software and Applications Conference, 2004. COMPSAC 2004, 2004, p.300-305 vol.1 |
| issn | 0730-3157 |
| language | eng |
| recordid | cdi_ieee_primary_1342847 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Application software Applied sciences Chaos Computer applications Computer science control theory systems Exact sciences and technology Extraterrestrial measurements Production Software Software engineering Software testing System testing Terminology Vocabulary |
| title | Test criteria for context-free grammars |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-03T05%3A42%3A56IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Test%20criteria%20for%20context-free%20grammars&rft.btitle=Proceedings%20of%20the%2028th%20Annual%20International%20Computer%20Software%20and%20Applications%20Conference,%202004.%20COMPSAC%202004&rft.au=Hu%20Li&rft.date=2004&rft.spage=300&rft.epage=305%20vol.1&rft.pages=300-305%20vol.1&rft.issn=0730-3157&rft.isbn=9780769522098&rft.isbn_list=0769522092&rft_id=info:doi/10.1109/CMPSAC.2004.1342847&rft_dat=%3Cpascalfrancis_6IE%3E17480220%3C/pascalfrancis_6IE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=1342847&rfr_iscdi=true |