Change search
ReferencesLink to record
Permanent link

Direct link
Approximating the Shuffle of Context-free Languages to Find Bugs in Concurrent Recursive Programs
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology.
2011 (English)Independent thesis Advanced level (degree of Master (One Year)), 20 credits / 30 HE creditsStudent thesis
Place, publisher, year, edition, pages
IT, 11 062
National Category
Engineering and Technology
URN: urn:nbn:se:uu:diva-159134OAI: diva2:442518
Educational program
Master Programme in Computer Science
Available from: 2011-09-21 Created: 2011-09-21 Last updated: 2011-09-21Bibliographically approved

Open Access in DiVA

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

By organisation
Department of Information Technology
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar
Total: 739 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: 287 hits
ReferencesLink to record
Permanent link

Direct link