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

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • 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
Invariant synthesis for programs manipulating lists with unbounded data
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
Show others and affiliations
2010 (English)In: Computer Aided Verification, Berlin: Springer-Verlag , 2010, 72-88 p.Conference paper, Published paper (Refereed)
Place, publisher, year, edition, pages
Berlin: Springer-Verlag , 2010. 72-88 p.
Series
Lecture Notes in Computer Science, 6174
National Category
Computer Science
Identifiers
URN: urn:nbn:se:uu:diva-130921DOI: 10.1007/978-3-642-14295-6_8ISBN: 978-3-642-14294-9 (print)OAI: oai:DiVA.org:uu-130921DiVA: diva2:352103
Available from: 2010-09-17 Created: 2010-09-17 Last updated: 2011-01-04Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Authority records BETA

Rezine, Ahmed

Search in DiVA

By author/editor
Rezine, Ahmed
By organisation
Computer Systems
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

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

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • 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