hig.sePublications
System disruptions
We are currently experiencing disruptions on the search portals due to high traffic. We are working to resolve the issue, you may temporarily encounter an error message.
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard-cite-them-right
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • sv-SE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • de-DE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Refinement Algebra with Operators for Enabledness and Termination
Åbo Akademi.
Åbo Akademi.
2006 (English)In: Mathematics of Program Construction, 8th International Conference, MPC 2006, Kuressaare, Estonia, July 3-5, 2006, Proceedings, Springer , 2006, p. 397-415Conference paper, Published paper (Refereed)
Place, publisher, year, edition, pages
Springer , 2006. p. 397-415
Series
Lecture Notes in Computer Science ; 4014
National Category
Philosophy Computer Sciences
Identifiers
URN: urn:nbn:se:hig:diva-45168DOI: 10.1007/11783596_23OAI: oai:DiVA.org:hig-45168DiVA, id: diva2:1881521
Conference
Mathematics of Program Construction, 8th International Conference
Available from: 2020-05-29 Created: 2024-07-03 Last updated: 2024-11-07Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full text

Authority records

Solin, Kim

Search in DiVA

By author/editor
Solin, Kim
PhilosophyComputer Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

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

Direct link
Cite
Citation style
  • apa
  • harvard-cite-them-right
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • sv-SE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • de-DE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf