Practical ultra-reliability for abstract data types.
Saved in:
| Title: | Practical ultra-reliability for abstract data types. |
|---|---|
| Authors: | Nikolik, Borislav1 boris@vidakquality.com, Hamlet, Dick2 |
| Source: | Software Testing: Verification & Reliability. Sep2007, Vol. 17 Issue 3, p183-203. 21p. 8 Charts. |
| Subjects: | Computer software, Abstract data types (Computer science), Programming languages, Aircraft accidents, Computer files |
| Abstract: | The Term Redundancy Method (TRM) is a novel approach for obtaining ultra-reliable programs through specification-based testing. Current specification-based testing schemes need a prohibitively large number of test cases for estimating ultra-reliability. They assume the availability of an accurate program-usage distribution prior to testing, and they assume the availability of a test oracle. This paper shows how to obtain ultra-reliable abstract data types specified with equational specifications, with a practical number of test cases, without an accurate usage distribution, and without the usual test oracle. The effectiveness of the TRM in failure detection and recovery is demonstrated on the aircraft collision avoidance system TCAS. Copyright © 2007 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR] |
| Copyright of Software Testing: Verification & Reliability is the property of Wiley-Blackwell and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
| FullText | Links: – Type: pdflink Text: Availability: 0 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 26368978 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Practical ultra-reliability for abstract data types. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Nikolik%2C+Borislav%22">Nikolik, Borislav</searchLink><relatesTo>1</relatesTo><i> boris@vidakquality.com</i><br /><searchLink fieldCode="AR" term="%22Hamlet%2C+Dick%22">Hamlet, Dick</searchLink><relatesTo>2</relatesTo> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Software+Testing%3A+Verification+%26+Reliability%22">Software Testing: Verification & Reliability</searchLink>. Sep2007, Vol. 17 Issue 3, p183-203. 21p. 8 Charts. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Computer+software%22">Computer software</searchLink><br /><searchLink fieldCode="DE" term="%22Abstract+data+types+%28Computer+science%29%22">Abstract data types (Computer science)</searchLink><br /><searchLink fieldCode="DE" term="%22Programming+languages%22">Programming languages</searchLink><br /><searchLink fieldCode="DE" term="%22Aircraft+accidents%22">Aircraft accidents</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+files%22">Computer files</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: The Term Redundancy Method (TRM) is a novel approach for obtaining ultra-reliable programs through specification-based testing. Current specification-based testing schemes need a prohibitively large number of test cases for estimating ultra-reliability. They assume the availability of an accurate program-usage distribution prior to testing, and they assume the availability of a test oracle. This paper shows how to obtain ultra-reliable abstract data types specified with equational specifications, with a practical number of test cases, without an accurate usage distribution, and without the usual test oracle. The effectiveness of the TRM in failure detection and recovery is demonstrated on the aircraft collision avoidance system TCAS. Copyright © 2007 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>Copyright of Software Testing: Verification & Reliability is the property of Wiley-Blackwell and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=26368978 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1002/stvr.367 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 21 StartPage: 183 Subjects: – SubjectFull: Computer software Type: general – SubjectFull: Abstract data types (Computer science) Type: general – SubjectFull: Programming languages Type: general – SubjectFull: Aircraft accidents Type: general – SubjectFull: Computer files Type: general Titles: – TitleFull: Practical ultra-reliability for abstract data types. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Nikolik, Borislav – PersonEntity: Name: NameFull: Hamlet, Dick IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 09 Text: Sep2007 Type: published Y: 2007 Identifiers: – Type: issn-print Value: 09600833 Numbering: – Type: volume Value: 17 – Type: issue Value: 3 Titles: – TitleFull: Software Testing: Verification & Reliability Type: main |
| ResultId | 1 |
