Exploiting Algebraic Laws to Improve Mechanized Axiomatizations
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.
KeywordsAxiom System Parallel Composition Deduction Rule Closed Term Head Normal Form
Unable to display preview. Download preview PDF.
- 3.Aceto, L., Fokkink, W., Ingólfsdóttir, A., Luttik, B.: Finite equational bases in process algebra: Results and open questions. In: Middeldorp, A., van Oostrom, V., van Raamsdonk, F., de Vrijer, R. (eds.) Processes... (Klop Festschrift). LNCS, vol. 3838, pp. 338–367. Springer, Heidelberg (2005)CrossRefGoogle Scholar
- 5.Aceto, L., Ingolfsdottir, A., Mousavi, M., Reniers, M.A.: Algebraic properties for free! Bulletin of the European Association for Theoretical Computer Science 99, 81–104 (2009)Google Scholar
- 6.Baeten, J., Basten, T., Reniers, M.: Process Algebra: Equational Theories of Communicating Processes. Cambridge Tracts in Theoretical Computer Science, vol. 50. Cambridge University Press (2009)Google Scholar
- 8.Bergstra, J.A., Klop, J.W.: Fixedpoint semantics in process algebra. Technical Report IW 206/82, Center for Mathematics, Amsterdam, The Netherlands (1982)Google Scholar
- 14.Hoare, C.A.R.: Communicating Sequential Processes. Prentice-Hall (1985)Google Scholar
- 15.Milner, A.R.: Communication and Concurrency. Prentice-Hall (1989)Google Scholar