hh.sePublications
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
Exploiting Algebraic Laws to Improve Mechanized Axiomatizations
ICE-TCS, School of Computer Science, Reykjavik University, Reykjavik, Iceland.
ICE-TCS, School of Computer Science, Reykjavik University, Reykjavik, Iceland.
ICE-TCS, School of Computer Science, Reykjavik University, Reykjavik, Iceland.
Halmstad University, School of Information Science, Computer and Electrical Engineering (IDE), Halmstad Embedded and Intelligent Systems Research (EIS), Centre for Research on Embedded Systems (CERES).ORCID iD: 0000-0002-4869-6794
Show others and affiliations
2013 (English)In: Algebra and Coalgebra in Computer Science: 5th International Conference, Calco 2013, Warsaw, Poland, September 2013, Proceedings, Berlin: Springer Berlin/Heidelberg, 2013, p. 36-50Conference paper, Published paper (Refereed)
Abstract [en]

In the field of structural operational semantics (SOS), there have been several proposals both for syntactic rule formats guaranteeing the validity of algebraic laws, and for algorithms for automatically generating ground-complete axiomatizations. However, there has been no synergy between these two types of results. This paper takes the first steps in marrying these two areas of research in the meta-theory of SOS and shows that taking algebraic laws into account in the mechanical generation of axiomatizations results in simpler axiomatizations. The proposed theory is applied to a paradigmatic example from the literature, showing that, in this case, the generated axiomatization coincides with a classic hand-crafted one. © 2013 Springer-Verlag Berlin Heidelberg.

Place, publisher, year, edition, pages
Berlin: Springer Berlin/Heidelberg, 2013. p. 36-50
Series
Lecture Notes in Computer Science, ISSN 0302-9743 ; 8089
Keywords [en]
Process Algebra, Structural Operational Semantics, Bisimulation, Ground Complete Axiomatization, Algebraic Properties, Rule Formats
National Category
Computer and Information Sciences
Identifiers
URN: urn:nbn:se:hh:diva-22060DOI: 10.1007/978-3-642-40206-7_5Scopus ID: 2-s2.0-84885981989Libris ID: 14699888ISBN: 9783642402067 ISBN: 9783642402050 OAI: oai:DiVA.org:hh-22060DiVA, id: diva2:619611
Conference
CALCO 2013, The 5th Conference on Algebra and Coalgebra in Computer Science, Warsaw, Poland, September 3-6, 2013
Projects
Meta-theory of Algebraic Process TheoriesExtending and Axiomatizing Structural Operational Semantics: Theory and Tools
Funder
eLLIIT - The Linköping‐Lund Initiative on IT and Mobile CommunicationsAvailable from: 2013-05-06 Created: 2013-05-06 Last updated: 2018-01-11Bibliographically approved

Open Access in DiVA

fulltext(246 kB)316 downloads
File information
File name FULLTEXT02.pdfFile size 246 kBChecksum SHA-512
5045eb8bb61f681d5a1fd5979314494f849a513652d925233d73c4fa25e5ce3b03395633e689184de2d0fdd76843bab06cb29d3f855ec7dae4a4fe61ad2035b2
Type fulltextMimetype application/pdf

Other links

Publisher's full textScopus

Authority records

Mousavi, Mohammad Reza

Search in DiVA

By author/editor
Mousavi, Mohammad Reza
By organisation
Centre for Research on Embedded Systems (CERES)
Computer and Information Sciences

Search outside of DiVA

GoogleGoogle Scholar
Total: 341 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

doi
isbn
urn-nbn

Altmetric score

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