Specification Coverage for Testing in Circus
Identifieur interne : 001369 ( Main/Corpus ); précédent : 001368; suivant : 001370Specification Coverage for Testing in Circus
Auteurs : Ana Cavalcanti ; Marie-Claude GaudelSource :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2010.
Abstract
Abstract: The Unifying Theories of Programming underpins the development of Circus , a state-rich process algebra for refinement. We have previously presented a theory of testing for Circus ; it gives a symbolic characterisation of tests. Each symbolic test specifies constraints that capture the effect of the possibly nondeterministic state operations, and their interaction. This is a sound basis for testing techniques based on constraint solving for generation of concrete tests, but does not support well selection criteria based on the structure of the specification. We present here a labelled transition system that captures information about a Circus model and its structure. It is useful for testing techniques based on specification coverage. The soundness argument for the new transition system follows the UTP style, but relates the new transition relation to the Circus relational model and its operational semantics.
Url:
DOI: 10.1007/978-3-642-16690-7_1
Links to Exploration step
ISTEX:206B9490DC3C618867802A21D6FB5466F20990E4Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Specification Coverage for Testing in Circus</title><author><name sortKey="Cavalcanti, Ana" sort="Cavalcanti, Ana" uniqKey="Cavalcanti A" first="Ana" last="Cavalcanti">Ana Cavalcanti</name><affiliation><mods:affiliation>Department of Computer Science, University of York, YO10 5DD, York, UK</mods:affiliation></affiliation></author><author><name sortKey="Gaudel, Marie Claude" sort="Gaudel, Marie Claude" uniqKey="Gaudel M" first="Marie-Claude" last="Gaudel">Marie-Claude Gaudel</name><affiliation><mods:affiliation>LRI, Université de Paris-Sud, France</mods:affiliation></affiliation><affiliation><mods:affiliation>CNRS, 91405, Orsay, France</mods:affiliation></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:206B9490DC3C618867802A21D6FB5466F20990E4</idno><date when="2010" year="2010">2010</date><idno type="doi">10.1007/978-3-642-16690-7_1</idno><idno type="url">https://api.istex.fr/document/206B9490DC3C618867802A21D6FB5466F20990E4/fulltext/pdf</idno><idno type="wicri:Area/Main/Corpus">001369</idno><idno type="wicri:explorRef" wicri:stream="Main" wicri:step="Corpus" wicri:corpus="ISTEX">001369</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Specification Coverage for Testing in Circus</title><author><name sortKey="Cavalcanti, Ana" sort="Cavalcanti, Ana" uniqKey="Cavalcanti A" first="Ana" last="Cavalcanti">Ana Cavalcanti</name><affiliation><mods:affiliation>Department of Computer Science, University of York, YO10 5DD, York, UK</mods:affiliation></affiliation></author><author><name sortKey="Gaudel, Marie Claude" sort="Gaudel, Marie Claude" uniqKey="Gaudel M" first="Marie-Claude" last="Gaudel">Marie-Claude Gaudel</name><affiliation><mods:affiliation>LRI, Université de Paris-Sud, France</mods:affiliation></affiliation><affiliation><mods:affiliation>CNRS, 91405, Orsay, France</mods:affiliation></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>2010</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series><idno type="istex">206B9490DC3C618867802A21D6FB5466F20990E4</idno><idno type="DOI">10.1007/978-3-642-16690-7_1</idno><idno type="ChapterID">Chap1</idno><idno type="ChapterID">1</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: The Unifying Theories of Programming underpins the development of Circus , a state-rich process algebra for refinement. We have previously presented a theory of testing for Circus ; it gives a symbolic characterisation of tests. Each symbolic test specifies constraints that capture the effect of the possibly nondeterministic state operations, and their interaction. This is a sound basis for testing techniques based on constraint solving for generation of concrete tests, but does not support well selection criteria based on the structure of the specification. We present here a labelled transition system that captures information about a Circus model and its structure. It is useful for testing techniques based on specification coverage. The soundness argument for the new transition system follows the UTP style, but relates the new transition relation to the Circus relational model and its operational semantics.</div></front></TEI><istex><corpusName>springer</corpusName><author><json:item><name>Ana Cavalcanti</name><affiliations><json:string>Department of Computer Science, University of York, YO10 5DD, York, UK</json:string></affiliations></json:item><json:item><name>Marie-Claude Gaudel</name><affiliations><json:string>LRI, Université de Paris-Sud, France</json:string><json:string>CNRS, 91405, Orsay, France</json:string></affiliations></json:item></author><genre><json:string>Original Paper</json:string></genre><serie><editor><json:item><name>David Hutchison</name><affiliations><json:string>Lancaster University, Lancaster, UK</json:string></affiliations></json:item><json:item><name>Takeo Kanade</name><affiliations><json:string>Carnegie Mellon University, Pittsburgh, PA, USA</json:string></affiliations></json:item><json:item><name>Josef Kittler</name><affiliations><json:string>University of Surrey, Guildford, UK</json:string></affiliations></json:item><json:item><name>Jon M. Kleinberg</name><affiliations><json:string>Cornell University, Ithaca, NY, USA</json:string></affiliations></json:item><json:item><name>Friedemann Mattern</name><affiliations><json:string>ETH Zurich, Zurich, Switzerland</json:string></affiliations></json:item><json:item><name>John C. Mitchell</name><affiliations><json:string>Stanford University, Stanford, CA, USA</json:string></affiliations></json:item><json:item><name>Moni Naor</name><affiliations><json:string>Weizmann Institute of Science, Rehovot, Israel</json:string></affiliations></json:item><json:item><name>Oscar Nierstrasz</name><affiliations><json:string>University of Bern, Bern, Switzerland</json:string></affiliations></json:item><json:item><name>C. Pandu Rangan</name><affiliations><json:string>Indian Institute of Technology, Madras, India</json:string></affiliations></json:item><json:item><name>Bernhard Steffen</name><affiliations><json:string>University of Dortmund, Dortmund, Germany</json:string></affiliations></json:item><json:item><name>Madhu Sudan</name><affiliations><json:string>Massachusetts Institute of Technology, MA, USA</json:string></affiliations></json:item><json:item><name>Demetri Terzopoulos</name><affiliations><json:string>University of California, Los Angeles, CA, USA</json:string></affiliations></json:item><json:item><name>Doug Tygar</name><affiliations><json:string>University of California, Berkeley, CA, USA</json:string></affiliations></json:item><json:item><name>Moshe Y. Vardi</name><affiliations><json:string>Rice University, Houston, TX, USA</json:string></affiliations></json:item><json:item><name>Gerhard Weikum</name><affiliations><json:string>Max-Planck Institute of Computer Science, Saarbrücken, Germany</json:string></affiliations></json:item></editor><issn><json:string>0302-9743</json:string></issn><genre></genre><language><json:string>unknown</json:string></language><title>Lecture Notes in Computer Science</title><copyrightDate>2010</copyrightDate></serie><host><volume>6445</volume><editor><json:item><name>Shengchao Qin</name><affiliations><json:string>School of Computing, University of Teesside, Borough Road, TS1 3BA, Middlesbrough, UK</json:string><json:string>E-mail: s.qin@tees.ac.uk</json:string></affiliations></json:item></editor><pages><last>45</last><first>1</first></pages><subject><json:item><value>Computer Science</value></json:item><json:item><value>Computer Science</value></json:item><json:item><value>Logics and Meanings of Programs</value></json:item><json:item><value>Software Engineering</value></json:item><json:item><value>Programming Languages, Compilers, Interpreters</value></json:item><json:item><value>Mathematical Logic and Formal Languages</value></json:item><json:item><value>Programming Techniques</value></json:item><json:item><value>Artificial Intelligence (incl. Robotics)</value></json:item></subject><isbn><json:string>978-3-642-16689-1</json:string></isbn><genre><json:string>Proceedings</json:string><json:string>eBook</json:string></genre><language><json:string>unknown</json:string></language><title>Unifying Theories of Programming</title><copyrightDate>2010</copyrightDate><doi><json:string>10.1007/978-3-642-16690-7</json:string></doi></host><language><json:string>eng</json:string></language><abstract>Abstract: The Unifying Theories of Programming underpins the development of Circus , a state-rich process algebra for refinement. We have previously presented a theory of testing for Circus ; it gives a symbolic characterisation of tests. Each symbolic test specifies constraints that capture the effect of the possibly nondeterministic state operations, and their interaction. This is a sound basis for testing techniques based on constraint solving for generation of concrete tests, but does not support well selection criteria based on the structure of the specification. We present here a labelled transition system that captures information about a Circus model and its structure. It is useful for testing techniques based on specification coverage. The soundness argument for the new transition system follows the UTP style, but relates the new transition relation to the Circus relational model and its operational semantics.</abstract><qualityIndicators><score>8.168</score><pdfVersion>1.6</pdfVersion><pdfPageSize>429.725 x 659.895 pts</pdfPageSize><refBibsNative>false</refBibsNative><abstractCharCount>932</abstractCharCount><pdfWordCount>19050</pdfWordCount><pdfCharCount>81533</pdfCharCount><pdfPageCount>45</pdfPageCount><abstractWordCount>139 </abstractWordCount></qualityIndicators><title>Specification Coverage for Testing in Circus</title><copyrightDate>2010</copyrightDate><doi><json:string>10.1007/978-3-642-16690-7_1</json:string></doi><id>206B9490DC3C618867802A21D6FB5466F20990E4</id><fulltext><json:item><original>true</original><mimetype>application/pdf</mimetype><extension>pdf</extension><uri>https://api.istex.fr/document/206B9490DC3C618867802A21D6FB5466F20990E4/fulltext/pdf</uri></json:item><json:item><original>false</original><mimetype>application/zip</mimetype><extension>zip</extension><uri>https://api.istex.fr/document/206B9490DC3C618867802A21D6FB5466F20990E4/fulltext/zip</uri></json:item><istex:fulltextTEI uri="https://api.istex.fr/document/206B9490DC3C618867802A21D6FB5466F20990E4/fulltext/tei"><teiHeader type="text"><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">Specification Coverage for Testing in Circus</title></titleStmt><publicationStmt><authority>ISTEX</authority><publisher>Springer Berlin Heidelberg</publisher><pubPlace>Berlin, Heidelberg</pubPlace><date>2010</date></publicationStmt><sourceDesc><biblStruct type="inbook"><analytic><title level="a" type="main" xml:lang="en">Specification Coverage for Testing in Circus</title><author><persName><forename type="first">Ana </forename><surname>Cavalcanti</surname></persName><affiliation>Department of Computer Science, University of York, YO10 5DD, York, UK</affiliation></author><author><persName><forename type="first">Marie-Claude </forename><surname>Gaudel</surname></persName><affiliation>LRI, Université de Paris-Sud, France</affiliation><affiliation>CNRS, 91405, Orsay, France</affiliation></author></analytic><monogr><title level="m">Unifying Theories of Programming</title><title level="m" type="sub">Third International Symposium, UTP 2010, Shanghai, China, November 15-16, 2010. Proceedings</title><idno type="pISBN">978-3-642-16689-1</idno><idno type="eISBN">978-3-642-16690-7</idno><idno type="DOI">10.1007/978-3-642-16690-7</idno><idno type="BookID">978-3-642-16690-7</idno><idno type="BookTitleID">214761</idno><idno type="BookSequenceNumber">6445</idno><idno type="BookVolumeNumber">6445</idno><idno type="BookChapterCount">15</idno><editor><persName><forename type="first">Shengchao </forename><surname>Qin</surname></persName><email>s.qin@tees.ac.uk</email><affiliation>School of Computing, University of Teesside, Borough Road, TS1 3BA, Middlesbrough, UK</affiliation></editor><imprint><publisher>Springer Berlin Heidelberg</publisher><pubPlace>Berlin, Heidelberg</pubPlace><date>2010</date><biblScope unit="vol">6445</biblScope><biblScope unit="page" from="1">1</biblScope><biblScope unit="page" to="45">45</biblScope></imprint></monogr><series><title level="s">Lecture Notes in Computer Science</title><editor><persName><forename type="first">David </forename><surname>Hutchison</surname></persName><affiliation>Lancaster University, Lancaster, UK</affiliation></editor><editor><persName><forename type="first">Takeo </forename><surname>Kanade</surname></persName><affiliation>Carnegie Mellon University, Pittsburgh, PA, USA</affiliation></editor><editor><persName><forename type="first">Josef </forename><surname>Kittler</surname></persName><affiliation>University of Surrey, Guildford, UK</affiliation></editor><editor><persName><forename type="first">Jon M. </forename><surname>Kleinberg</surname></persName><affiliation>Cornell University, Ithaca, NY, USA</affiliation></editor><editor><persName><forename type="first">Friedemann </forename><surname>Mattern</surname></persName><affiliation>ETH Zurich, Zurich, Switzerland</affiliation></editor><editor><persName><forename type="first">John C. </forename><surname>Mitchell</surname></persName><affiliation>Stanford University, Stanford, CA, USA</affiliation></editor><editor><persName><forename type="first">Moni </forename><surname>Naor</surname></persName><affiliation>Weizmann Institute of Science, Rehovot, Israel</affiliation></editor><editor><persName><forename type="first">Oscar </forename><surname>Nierstrasz</surname></persName><affiliation>University of Bern, Bern, Switzerland</affiliation></editor><editor><persName><forename type="first">C. </forename><surname>Pandu Rangan</surname></persName><affiliation>Indian Institute of Technology, Madras, India</affiliation></editor><editor><persName><forename type="first">Bernhard </forename><surname>Steffen</surname></persName><affiliation>University of Dortmund, Dortmund, Germany</affiliation></editor><editor><persName><forename type="first">Madhu </forename><surname>Sudan</surname></persName><affiliation>Massachusetts Institute of Technology, MA, USA</affiliation></editor><editor><persName><forename type="first">Demetri </forename><surname>Terzopoulos</surname></persName><affiliation>University of California, Los Angeles, CA, USA</affiliation></editor><editor><persName><forename type="first">Doug </forename><surname>Tygar</surname></persName><affiliation>University of California, Berkeley, CA, USA</affiliation></editor><editor><persName><forename type="first">Moshe Y. </forename><surname>Vardi</surname></persName><affiliation>Rice University, Houston, TX, USA</affiliation></editor><editor><persName><forename type="first">Gerhard </forename><surname>Weikum</surname></persName><affiliation>Max-Planck Institute of Computer Science, Saarbrücken, Germany</affiliation></editor><biblScope><date>2010</date></biblScope><idno type="pISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="seriesId">558</idno></series><idno type="istex">206B9490DC3C618867802A21D6FB5466F20990E4</idno><idno type="DOI">10.1007/978-3-642-16690-7_1</idno><idno type="ChapterID">Chap1</idno><idno type="ChapterID">1</idno></biblStruct></sourceDesc></fileDesc><profileDesc><creation><date>2010</date></creation><langUsage><language ident="en">en</language></langUsage><abstract xml:lang="en"><p>Abstract: The Unifying Theories of Programming underpins the development of Circus , a state-rich process algebra for refinement. We have previously presented a theory of testing for Circus ; it gives a symbolic characterisation of tests. Each symbolic test specifies constraints that capture the effect of the possibly nondeterministic state operations, and their interaction. This is a sound basis for testing techniques based on constraint solving for generation of concrete tests, but does not support well selection criteria based on the structure of the specification. We present here a labelled transition system that captures information about a Circus model and its structure. It is useful for testing techniques based on specification coverage. The soundness argument for the new transition system follows the UTP style, but relates the new transition relation to the Circus relational model and its operational semantics.</p></abstract><textClass><keywords scheme="Book Subject Collection"><list><label>SUCO11645</label><item><term>Computer Science</term></item></list></keywords></textClass><textClass><keywords scheme="Book Subject Group"><list><label>I</label><item><term>Computer Science</term></item><label>I1603X</label><item><term>Logics and Meanings of Programs</term></item><label>I14029</label><item><term>Software Engineering</term></item><label>I14037</label><item><term>Programming Languages, Compilers, Interpreters</term></item><label>I16048</label><item><term>Mathematical Logic and Formal Languages</term></item><label>I14010</label><item><term>Programming Techniques</term></item><label>I21017</label><item><term>Artificial Intelligence (incl. Robotics)</term></item></list></keywords></textClass></profileDesc></teiHeader></istex:fulltextTEI><json:item><original>false</original><mimetype>text/plain</mimetype><extension>txt</extension><uri>https://api.istex.fr/document/206B9490DC3C618867802A21D6FB5466F20990E4/fulltext/txt</uri></json:item></fulltext><metadata><istex:metadataXml wicri:clean="Springer, Publisher found" wicri:toSee="no header"><istex:xmlDeclaration>version="1.0" encoding="UTF-8"</istex:xmlDeclaration><istex:docType PUBLIC="-//Springer-Verlag//DTD A++ V2.4//EN" URI="http://devel.springer.de/A++/V2.4/DTD/A++V2.4.dtd" name="istex:docType"></istex:docType><istex:document><Publisher><PublisherInfo><PublisherName>Springer Berlin Heidelberg</PublisherName><PublisherLocation>Berlin, Heidelberg</PublisherLocation></PublisherInfo><Series><SeriesInfo SeriesType="Series" TocLevels="0"><SeriesID>558</SeriesID><SeriesPrintISSN>0302-9743</SeriesPrintISSN><SeriesElectronicISSN>1611-3349</SeriesElectronicISSN><SeriesTitle Language="En">Lecture Notes in Computer Science</SeriesTitle></SeriesInfo><SeriesHeader><EditorGroup><Editor AffiliationIDS="Aff1"><EditorName DisplayOrder="Western"><GivenName>David</GivenName><FamilyName>Hutchison</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff2"><EditorName DisplayOrder="Western"><GivenName>Takeo</GivenName><FamilyName>Kanade</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff3"><EditorName DisplayOrder="Western"><GivenName>Josef</GivenName><FamilyName>Kittler</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff4"><EditorName DisplayOrder="Western"><GivenName>Jon</GivenName><GivenName>M.</GivenName><FamilyName>Kleinberg</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff5"><EditorName DisplayOrder="Western"><GivenName>Friedemann</GivenName><FamilyName>Mattern</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff6"><EditorName DisplayOrder="Western"><GivenName>John</GivenName><GivenName>C.</GivenName><FamilyName>Mitchell</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff7"><EditorName DisplayOrder="Western"><GivenName>Moni</GivenName><FamilyName>Naor</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff8"><EditorName DisplayOrder="Western"><GivenName>Oscar</GivenName><FamilyName>Nierstrasz</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff9"><EditorName DisplayOrder="Western"><GivenName>C.</GivenName><FamilyName>Pandu Rangan</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff10"><EditorName DisplayOrder="Western"><GivenName>Bernhard</GivenName><FamilyName>Steffen</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff11"><EditorName DisplayOrder="Western"><GivenName>Madhu</GivenName><FamilyName>Sudan</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff12"><EditorName DisplayOrder="Western"><GivenName>Demetri</GivenName><FamilyName>Terzopoulos</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff13"><EditorName DisplayOrder="Western"><GivenName>Doug</GivenName><FamilyName>Tygar</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff14"><EditorName DisplayOrder="Western"><GivenName>Moshe</GivenName><GivenName>Y.</GivenName><FamilyName>Vardi</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff15"><EditorName DisplayOrder="Western"><GivenName>Gerhard</GivenName><FamilyName>Weikum</FamilyName></EditorName></Editor><Affiliation ID="Aff1"><OrgName>Lancaster University</OrgName><OrgAddress><City>Lancaster</City><Country>UK</Country></OrgAddress></Affiliation><Affiliation ID="Aff2"><OrgName>Carnegie Mellon University</OrgName><OrgAddress><City>Pittsburgh</City><State>PA</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff3"><OrgName>University of Surrey</OrgName><OrgAddress><City>Guildford</City><Country>UK</Country></OrgAddress></Affiliation><Affiliation ID="Aff4"><OrgName>Cornell University</OrgName><OrgAddress><City>Ithaca</City><State>NY</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff5"><OrgName>ETH Zurich</OrgName><OrgAddress><City>Zurich</City><Country>Switzerland</Country></OrgAddress></Affiliation><Affiliation ID="Aff6"><OrgName>Stanford University</OrgName><OrgAddress><City>Stanford</City><State>CA</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff7"><OrgName>Weizmann Institute of Science</OrgName><OrgAddress><City>Rehovot</City><Country>Israel</Country></OrgAddress></Affiliation><Affiliation ID="Aff8"><OrgName>University of Bern</OrgName><OrgAddress><City>Bern</City><Country>Switzerland</Country></OrgAddress></Affiliation><Affiliation ID="Aff9"><OrgName>Indian Institute of Technology</OrgName><OrgAddress><City>Madras</City><Country>India</Country></OrgAddress></Affiliation><Affiliation ID="Aff10"><OrgName>University of Dortmund</OrgName><OrgAddress><City>Dortmund</City><Country>Germany</Country></OrgAddress></Affiliation><Affiliation ID="Aff11"><OrgName>Massachusetts Institute of Technology</OrgName><OrgAddress><State>MA</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff12"><OrgName>University of California</OrgName><OrgAddress><City>Los Angeles</City><State>CA</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff13"><OrgName>University of California</OrgName><OrgAddress><City>Berkeley</City><State>CA</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff14"><OrgName>Rice University</OrgName><OrgAddress><City>Houston</City><State>TX</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff15"><OrgName>Max-Planck Institute of Computer Science</OrgName><OrgAddress><City>Saarbrücken</City><Country>Germany</Country></OrgAddress></Affiliation></EditorGroup></SeriesHeader><Book Language="En"><BookInfo BookProductType="Proceedings" ContainsESM="No" Language="En" MediaType="eBook" NumberingDepth="2" NumberingStyle="ContentOnly" OutputMedium="All" TocLevels="0"><BookID>978-3-642-16690-7</BookID><BookTitle>Unifying Theories of Programming</BookTitle><BookSubTitle>Third International Symposium, UTP 2010, Shanghai, China, November 15-16, 2010. Proceedings</BookSubTitle><BookVolumeNumber>6445</BookVolumeNumber><BookSequenceNumber>6445</BookSequenceNumber><BookDOI>10.1007/978-3-642-16690-7</BookDOI><BookTitleID>214761</BookTitleID><BookPrintISBN>978-3-642-16689-1</BookPrintISBN><BookElectronicISBN>978-3-642-16690-7</BookElectronicISBN><BookChapterCount>15</BookChapterCount><BookCopyright><CopyrightHolderName>Springer Berlin Heidelberg</CopyrightHolderName><CopyrightYear>2010</CopyrightYear></BookCopyright><BookSubjectGroup><BookSubject Code="I" Type="Primary">Computer Science</BookSubject><BookSubject Code="I1603X" Priority="1" Type="Secondary">Logics and Meanings of Programs</BookSubject><BookSubject Code="I14029" Priority="2" Type="Secondary">Software Engineering</BookSubject><BookSubject Code="I14037" Priority="3" Type="Secondary">Programming Languages, Compilers, Interpreters</BookSubject><BookSubject Code="I16048" Priority="4" Type="Secondary">Mathematical Logic and Formal Languages</BookSubject><BookSubject Code="I14010" Priority="5" Type="Secondary">Programming Techniques</BookSubject><BookSubject Code="I21017" Priority="6" Type="Secondary">Artificial Intelligence (incl. Robotics)</BookSubject><SubjectCollection Code="SUCO11645">Computer Science</SubjectCollection></BookSubjectGroup><BookContext><SeriesID>558</SeriesID></BookContext></BookInfo><BookHeader><EditorGroup><Editor AffiliationIDS="Aff16"><EditorName DisplayOrder="Western"><GivenName>Shengchao</GivenName><FamilyName>Qin</FamilyName></EditorName><Contact><Email>s.qin@tees.ac.uk</Email></Contact></Editor><Affiliation ID="Aff16"><OrgDivision>School of Computing</OrgDivision><OrgName>University of Teesside</OrgName><OrgAddress><Street>Borough Road</Street><Postcode>TS1 3BA</Postcode><City>Middlesbrough</City><Country>UK</Country></OrgAddress></Affiliation></EditorGroup></BookHeader><Chapter ID="Chap1" Language="En"><ChapterInfo ChapterType="OriginalPaper" ContainsESM="No" NumberingDepth="2" NumberingStyle="ContentOnly" TocLevels="0"><ChapterID>1</ChapterID><ChapterDOI>10.1007/978-3-642-16690-7_1</ChapterDOI><ChapterSequenceNumber>1</ChapterSequenceNumber><ChapterTitle Language="En">Specification Coverage for Testing in <Emphasis FontCategory="SansSerif" Type="Italic">Circus</Emphasis></ChapterTitle><ChapterFirstPage>1</ChapterFirstPage><ChapterLastPage>45</ChapterLastPage><ChapterCopyright><CopyrightHolderName>Springer-Verlag Berlin Heidelberg</CopyrightHolderName><CopyrightYear>2010</CopyrightYear></ChapterCopyright><ChapterGrants Type="Regular"><MetadataGrant Grant="OpenAccess"></MetadataGrant><AbstractGrant Grant="OpenAccess"></AbstractGrant><BodyPDFGrant Grant="Restricted"></BodyPDFGrant><BodyHTMLGrant Grant="Restricted"></BodyHTMLGrant><BibliographyGrant Grant="Restricted"></BibliographyGrant><ESMGrant Grant="Restricted"></ESMGrant></ChapterGrants><ChapterContext><SeriesID>558</SeriesID><BookID>978-3-642-16690-7</BookID><BookTitle>Unifying Theories of Programming</BookTitle></ChapterContext></ChapterInfo><ChapterHeader><AuthorGroup><Author AffiliationIDS="Aff17"><AuthorName DisplayOrder="Western"><GivenName>Ana</GivenName><FamilyName>Cavalcanti</FamilyName></AuthorName></Author><Author AffiliationIDS="Aff18 Aff19"><AuthorName DisplayOrder="Western"><GivenName>Marie-Claude</GivenName><FamilyName>Gaudel</FamilyName></AuthorName></Author><Affiliation ID="Aff17"><OrgDivision>Department of Computer Science</OrgDivision><OrgName>University of York</OrgName><OrgAddress><City>York</City><Postcode>YO10 5DD</Postcode><Country>UK</Country></OrgAddress></Affiliation><Affiliation ID="Aff18"><OrgDivision>LRI</OrgDivision><OrgName>Université de Paris-Sud</OrgName><OrgAddress><Country>France</Country></OrgAddress></Affiliation><Affiliation ID="Aff19"><OrgName>CNRS</OrgName><OrgAddress><City>Orsay</City><Postcode>91405</Postcode><Country>France</Country></OrgAddress></Affiliation></AuthorGroup><Abstract ID="Abs1" Language="En"><Heading>Abstract</Heading><Para>The Unifying Theories of Programming underpins the development of <Emphasis FontCategory="SansSerif" Type="Italic">Circus</Emphasis>, a state-rich process algebra for refinement. We have previously presented a theory of testing for <Emphasis FontCategory="SansSerif" Type="Italic">Circus</Emphasis>; it gives a symbolic characterisation of tests. Each symbolic test specifies constraints that capture the effect of the possibly nondeterministic state operations, and their interaction. This is a sound basis for testing techniques based on constraint solving for generation of concrete tests, but does not support well selection criteria based on the structure of the specification. We present here a labelled transition system that captures information about a <Emphasis FontCategory="SansSerif" Type="Italic">Circus</Emphasis> model and its structure. It is useful for testing techniques based on specification coverage. The soundness argument for the new transition system follows the UTP style, but relates the new transition relation to the <Emphasis FontCategory="SansSerif" Type="Italic">Circus</Emphasis> relational model and its operational semantics.</Para></Abstract></ChapterHeader><NoBody></NoBody></Chapter></Book></Series></Publisher></istex:document></istex:metadataXml><!--Version 0.11 générée le 11-8-2015--><mods version="3.6"><titleInfo lang="en"><title>Specification Coverage for Testing in Circus</title></titleInfo><titleInfo type="alternative" contentType="CDATA" lang="en"><title>Specification Coverage for Testing in Circus</title></titleInfo><name type="personal"><namePart type="given">Ana</namePart><namePart type="family">Cavalcanti</namePart><affiliation>Department of Computer Science, University of York, YO10 5DD, York, UK</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Marie-Claude</namePart><namePart type="family">Gaudel</namePart><affiliation>LRI, Université de Paris-Sud, France</affiliation><affiliation>CNRS, 91405, Orsay, France</affiliation><role><roleTerm type="text">author</roleTerm></role></name><typeOfResource>text</typeOfResource><genre>Original Paper</genre><originInfo><publisher>Springer Berlin Heidelberg</publisher><place><placeTerm type="text">Berlin, Heidelberg</placeTerm></place><copyrightDate encoding="w3cdtf">2010</copyrightDate></originInfo><language><languageTerm type="code" authority="rfc3066">en</languageTerm><languageTerm type="code" authority="iso639-2b">eng</languageTerm></language><physicalDescription><internetMediaType>text/html</internetMediaType></physicalDescription><abstract lang="en">Abstract: The Unifying Theories of Programming underpins the development of Circus , a state-rich process algebra for refinement. We have previously presented a theory of testing for Circus ; it gives a symbolic characterisation of tests. Each symbolic test specifies constraints that capture the effect of the possibly nondeterministic state operations, and their interaction. This is a sound basis for testing techniques based on constraint solving for generation of concrete tests, but does not support well selection criteria based on the structure of the specification. We present here a labelled transition system that captures information about a Circus model and its structure. It is useful for testing techniques based on specification coverage. The soundness argument for the new transition system follows the UTP style, but relates the new transition relation to the Circus relational model and its operational semantics.</abstract><relatedItem type="series"><titleInfo><title>Lecture Notes in Computer Science</title></titleInfo><name type="personal"><namePart type="given">David</namePart><namePart type="family">Hutchison</namePart><affiliation>Lancaster University, Lancaster, UK</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Takeo</namePart><namePart type="family">Kanade</namePart><affiliation>Carnegie Mellon University, Pittsburgh, PA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Josef</namePart><namePart type="family">Kittler</namePart><affiliation>University of Surrey, Guildford, UK</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Jon M.</namePart><namePart type="family">Kleinberg</namePart><affiliation>Cornell University, Ithaca, NY, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Friedemann</namePart><namePart type="family">Mattern</namePart><affiliation>ETH Zurich, Zurich, Switzerland</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">John C.</namePart><namePart type="family">Mitchell</namePart><affiliation>Stanford University, Stanford, CA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Moni</namePart><namePart type="family">Naor</namePart><affiliation>Weizmann Institute of Science, Rehovot, Israel</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Oscar</namePart><namePart type="family">Nierstrasz</namePart><affiliation>University of Bern, Bern, Switzerland</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">C.</namePart><namePart type="family">Pandu Rangan</namePart><affiliation>Indian Institute of Technology, Madras, India</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Bernhard</namePart><namePart type="family">Steffen</namePart><affiliation>University of Dortmund, Dortmund, Germany</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Madhu</namePart><namePart type="family">Sudan</namePart><affiliation>Massachusetts Institute of Technology, MA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Demetri</namePart><namePart type="family">Terzopoulos</namePart><affiliation>University of California, Los Angeles, CA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Doug</namePart><namePart type="family">Tygar</namePart><affiliation>University of California, Berkeley, CA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Moshe Y.</namePart><namePart type="family">Vardi</namePart><affiliation>Rice University, Houston, TX, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Gerhard</namePart><namePart type="family">Weikum</namePart><affiliation>Max-Planck Institute of Computer Science, Saarbrücken, Germany</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><originInfo><copyrightDate encoding="w3cdtf">2010</copyrightDate><issuance>serial</issuance></originInfo><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="SeriesID">558</identifier><recordInfo><recordOrigin>Springer Berlin Heidelberg, 2010</recordOrigin></recordInfo></relatedItem><relatedItem type="host"><titleInfo><title>Unifying Theories of Programming</title><subTitle>Third International Symposium, UTP 2010, Shanghai, China, November 15-16, 2010. Proceedings</subTitle></titleInfo><name type="personal"><namePart type="given">Shengchao</namePart><namePart type="family">Qin</namePart><affiliation>School of Computing, University of Teesside, Borough Road, TS1 3BA, Middlesbrough, UK</affiliation><affiliation>E-mail: s.qin@tees.ac.uk</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><genre>Proceedings</genre><genre>eBook</genre><originInfo><copyrightDate encoding="w3cdtf">2010</copyrightDate><issuance>monographic</issuance></originInfo><subject><genre>Book Subject Collection</genre><topic authority="SpringerSubjectCodes" authorityURI="SUCO11645">Computer Science</topic></subject><subject><genre>Book Subject Group</genre><topic authority="SpringerSubjectCodes" authorityURI="I">Computer Science</topic><topic authority="SpringerSubjectCodes" authorityURI="I1603X">Logics and Meanings of Programs</topic><topic authority="SpringerSubjectCodes" authorityURI="I14029">Software Engineering</topic><topic authority="SpringerSubjectCodes" authorityURI="I14037">Programming Languages, Compilers, Interpreters</topic><topic authority="SpringerSubjectCodes" authorityURI="I16048">Mathematical Logic and Formal Languages</topic><topic authority="SpringerSubjectCodes" authorityURI="I14010">Programming Techniques</topic><topic authority="SpringerSubjectCodes" authorityURI="I21017">Artificial Intelligence (incl. Robotics)</topic></subject><identifier type="DOI">10.1007/978-3-642-16690-7</identifier><identifier type="ISBN">978-3-642-16689-1</identifier><identifier type="eISBN">978-3-642-16690-7</identifier><identifier type="BookTitleID">214761</identifier><identifier type="BookID">978-3-642-16690-7</identifier><identifier type="BookChapterCount">15</identifier><identifier type="BookVolumeNumber">6445</identifier><identifier type="BookSequenceNumber">6445</identifier><part><date>2010</date><detail type="volume"><number>6445</number><caption>vol.</caption></detail><extent unit="pages"><start>1</start><end>45</end></extent></part><recordInfo><recordOrigin>Springer Berlin Heidelberg, 2010</recordOrigin></recordInfo></relatedItem><identifier type="istex">206B9490DC3C618867802A21D6FB5466F20990E4</identifier><identifier type="DOI">10.1007/978-3-642-16690-7_1</identifier><identifier type="ChapterID">Chap1</identifier><identifier type="ChapterID">1</identifier><accessCondition type="use and reproduction" contentType="MetadataGrant">OpenAccess</accessCondition><accessCondition type="use and reproduction" contentType="AbstractGrant">OpenAccess</accessCondition><accessCondition type="use and reproduction" contentType="BodyPDFGrant">Restricted</accessCondition><accessCondition type="use and reproduction" contentType="BodyHTMLGrant">Restricted</accessCondition><accessCondition type="use and reproduction" contentType="BibliographyGrant">Restricted</accessCondition><accessCondition type="use and reproduction" contentType="ESMGrant">Restricted</accessCondition><recordInfo><recordOrigin>Springer-Verlag Berlin Heidelberg, 2010</recordOrigin></recordInfo></mods></metadata></istex></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Wicri/explor/CircusV2/Data/Main/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001369 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Corpus/biblio.hfd -nk 001369 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Wicri
|area= CircusV2
|flux= Main
|étape= Corpus
|type= RBID
|clé= ISTEX:206B9490DC3C618867802A21D6FB5466F20990E4
|texte= Specification Coverage for Testing in Circus
}}
| This area was generated with Dilib version V0.6.31. |  |