View source for Publications:Exploiting Algebraic Laws to Improve Mechanized Axiomatizations

<div style='display: none'>
== Do not edit this section ==
</div>
{{PublicationSetupTemplate|Author=Luca Aceto, Eugen-Ioan Goriac, Anna Ingolfsdottir, Mohammad Reza Mousavi, Michel A Reniers
|PID=619611
|Name=Aceto, Luca (ICE-TCS, School of Computer Science, Reykjavik University,Reykjavik, Iceland);Goriac, Eugen-Ioan (ICE-TCS, School of Computer Science, Reykjavik University, Reykjavik, Iceland);Ingolfsdottir, Anna (ICE-TCS, School of Computer Science, Reykjavik University, Reykjavik, Iceland);Mousavi, Mohammad Reza [mohmou] (Högskolan i Halmstad [2804], Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE) [3905], Halmstad Embedded and Intelligent Systems Research (EIS) [3938], Centrum för forskning om inbyggda system (CERES) [6702]);Reniers, Michel A (Department of Mechanical Engineering, Eindhoven University of Technology, Eindhoven, The Netherlands)
|Title=Exploiting Algebraic Laws to Improve Mechanized Axiomatizations
|PublicationType=Conference Paper
|ContentType=Refereegranskat
|Language=eng
|Journal=
|JournalISSN=
|Status=
|Volume=
|Issue=
|HostPublication=Algebra and Coalgebra in Computer Science: 5th International Conference, Calco 2013, Warsaw, Poland, September 2013, Proceedings
|Conference=CALCO 2013, The 5th Conference on Algebra and Coalgebra in Computer Science, Warsaw, Poland
|StartPage=36
|EndPage=50
|Year=2013
|Edition=
|Pages=
|City=Berlin
|Publisher=Springer Berlin/Heidelberg
|Series=Lecture Notes in Computer Science ; 8089
|SeriesISSN=0302-9743
|ISBN=9783642402067;9783642402050
|Urls=
|ISRN=
|DOI=http://dx.doi.org/10.1007/978-3-642-40206-7_5
|ISI=
|PMID=
|ScopusId=
|NBN=urn:nbn:se:hh:diva-22060
|LocalId=
|ArchiveNumber=
|Keywords=Process Algebra;Structural Operational Semantics;Bisimulation;Ground Complete Axiomatization;Algebraic Properties;Rule Formats
|Categories=Data- och informationsvetenskap (102)
|ResearchSubjects=
|Projects=
|Notes=
|Abstract=<p>In the field of structural operational semantics (SOS), there have beenseveral proposals both for syntactic rule formats guaranteeing the validity ofalgebraic laws, and for algorithms for automatically generatingground-complete axiomatizations. However, there has been no synergybetween these two types of results. This paper takes the first stepsin marrying these two areas of research in the meta-theory of SOS%structural operational semanticsand shows that taking algebraic laws into account in the mechanicalgeneration of axiomatizations results in simpler axiomatizations. Theproposed theory is applied to a paradigmatic example from the literature,showing that, in this case, the generated axiomatization coincideswith a classic hand-crafted one.</p>
|Opponents=
|Supervisors=
|Examiners=
|Patent=
|ThesisLevel=
|Credits=
|Programme=
|Subject=
|Uppsok=
|DefencePlace=
|DefenceLanguage=
|DefenceDate=
|CreatedDate=2013-05-06
|PublicationDate=2013-05-06
|LastUpdated=2013-09-25
|diva=http://hh.diva-portal.org/smash/record.jsf?searchId=1&pid=diva2:619611}}
<div style='display: none'>

== Keep all hand-made modifications below ==
</div>{{PublicationDisplayTemplate}}