Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Cardinality of UDP Transmission Outcomes
Show others and affiliations
2015 (English)In: Proc. Dependable Software Engineering: Theories, Tools, and Applications — First International Symposium, SETTA 2015, Springer, 2015, Vol. 9409, p. 120-134Conference paper, Published paper (Refereed)
Abstract [en]

This paper examines the cost of testing network applications using the User Datagram Protocol (UDP). Such applications must deal with packet loss, duplication, and reordering. Ideally, a UDP application should be tested against all possible outcomes of unreliable UDP transmissions. Their number, however, grows at least exponentially in the number of transmitted packets. To estimate the cost of the exhaustive testing of UDP applications, we determine the number of UDP transmission outcomes analytically. Based on this combinatorial analysis, we derive a sound, complete, and optimal algorithm for generating outcomes of unreliable UDP transmissions. The algorithm is implemented in the net-iocache extension of the software model checker Java Pathfinder (JPF). Experimental results confirm the consistency of the implementation with the analytical results. In addition, we found that JPF's state matching reduces the explored state space significantly and ensures the practicability of the approach despite of its exponential complexity.

Place, publisher, year, edition, pages
Springer, 2015. Vol. 9409, p. 120-134
Series
Lecture Notes in Computer Science, ISSN 0302-9743 ; 9409
Keyword [en]
User datagram protocol, Software model checking, Java Pathfinder, Combinatorial analysis
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:kth:diva-199106DOI: 10.1007/978-3-319-25942-0_8ISI: 000374099200008Scopus ID: 2-s2.0-84951133906ISBN: 978-3-319-25942-0 (print)ISBN: 978-3-319-25941-3 (print)OAI: oai:DiVA.org:kth-199106DiVA, id: diva2:1060482
Conference
1st International Symposium on Dependable Software Engineering: Theories, Tools, and Applications, SETTA 2015; Nanjing; China; 4 November 2015 through 6 November 2015
Note

QC 20170202

Available from: 2016-12-28 Created: 2016-12-28 Last updated: 2018-01-13Bibliographically approved

Open Access in DiVA

fulltext(1057 kB)11 downloads
File information
File name FULLTEXT01.pdfFile size 1057 kBChecksum SHA-512
b6d0e13f4ff4c09264396949c36627b8ee0e9ba6213cb55e08c438bdded8683d3c1e9564334625bc0f8ee49e68a49507a907edcbb5738e2816f16d42fed38271
Type fulltextMimetype application/pdf

Other links

Publisher's full textScopusThe final publication is available at http://link.springer.com/chapter/10.1007%2F978-3-319-25942-0_8

Search in DiVA

By author/editor
Artho, Cyrille
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar
Total: 11 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 36 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf