uu.seUppsala University Publications
Change search
ReferencesLink to record
Permanent link

Direct link
Algorithmic Analysis of Lossy Channel Machines Using Small Models
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology.
2016 (English)Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
Abstract [en]

Verification of infinite-state systems is in general an undecidable problem, but nevertheless, solid correctness results are important in many real-life applications. It is commonly the case that such algorithms rely on unbounded buffers for their operation, communication protocols being a typical example. Building upon abstract interpretation techniques, this project presents a verification algorithm capable of verifying the correctness of algorithms relying on unbounded lossy buffers. We have implemented our approach and used it to verify a number of well-known communication protocols. The experimental results are mixed, but in most cases comparable to that of other existing tools, justifying further research on the topic.

Place, publisher, year, edition, pages
2016. , 44 p.
UPTEC IT, ISSN 1401-5749 ; 16006
National Category
Engineering and Technology
URN: urn:nbn:se:uu:diva-301502OAI: oai:DiVA.org:uu-301502DiVA: diva2:954769
Educational program
Master of Science Programme in Information Technology Engineering
Available from: 2016-08-23 Created: 2016-08-23 Last updated: 2016-08-23Bibliographically approved

Open Access in DiVA

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

By organisation
Department of Information Technology
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar
Total: 7 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

Total: 22 hits
ReferencesLink to record
Permanent link

Direct link