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
Generating Models of Infinite-State Communication Protocols Using Regular Inference with Abstraction
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
2010 (English)In: Testing Software and Systems: ICTSS 2010, Berlin: Springer-Verlag , 2010, 188-204 p.Conference paper, Published paper (Refereed)
Place, publisher, year, edition, pages
Berlin: Springer-Verlag , 2010. 188-204 p.
Series
Lecture Notes in Computer Science, ISSN 0302-9743 ; 6435
National Category
Computer Science
Identifiers
URN: urn:nbn:se:uu:diva-143805DOI: 10.1007/978-3-642-16573-3_14ISBN: 978-3-642-16572-6 (print)OAI: oai:DiVA.org:uu-143805DiVA: diva2:391514
Projects
Connect
Available from: 2011-01-25 Created: 2011-01-25 Last updated: 2011-03-11Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Jonsson, Bengt
By organisation
Computer Systems
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 846 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