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
Verifying quantitative temporal properties of procedural programs
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
2018 (English)In: 29th International Conference on Concurrency Theory, Dagstuhl, Germany: Leibniz-Zentrum für Informatik , 2018, p. 15:1-17Conference paper, Published paper (Refereed)
Place, publisher, year, edition, pages
Dagstuhl, Germany: Leibniz-Zentrum für Informatik , 2018. p. 15:1-17
Series
Leibniz International Proceedings in Informatics ; 118
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:uu:diva-367963DOI: 10.4230/LIPIcs.CONCUR.2018.15ISBN: 978-3-95977-087-3 (electronic)OAI: oai:DiVA.org:uu-367963DiVA, id: diva2:1267284
Conference
CONCUR 2018
Available from: 2018-11-30 Created: 2018-11-30 Last updated: 2018-12-07Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full text

Authority records BETA

Atig, Mohamed Faouzi

Search in DiVA

By author/editor
Atig, Mohamed Faouzi
By organisation
Computer Systems
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

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