{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T22:00:32Z","timestamp":1725746432965},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642402050"},{"type":"electronic","value":"9783642402067"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40206-7_5","type":"book-chapter","created":{"date-parts":[[2013,8,27]],"date-time":"2013-08-27T03:29:41Z","timestamp":1377574181000},"page":"36-50","source":"Crossref","is-referenced-by-count":2,"title":["Exploiting Algebraic Laws to Improve Mechanized Axiomatizations"],"prefix":"10.1007","author":[{"given":"Luca","family":"Aceto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eugen-Ioan","family":"Goriac","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anna","family":"Ingolfsdottir","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammad Reza","family":"Mousavi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michel A.","family":"Reniers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1994.1040","volume":"111","author":"L. Aceto","year":"1994","unstructured":"Aceto, L., Bloom, B., Vaandrager, F.W.: Turning SOS rules into equations. Information and Computation\u00a0111, 1\u201352 (1994)","journal-title":"Information and Computation"},{"key":"5_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1007\/978-3-642-22944-2_27","volume-title":"Algebra and Coalgebra in Computer Science","author":"L. Aceto","year":"2011","unstructured":"Aceto, L., Caltais, G., Goriac, E.-I., Ingolfsdottir, A.: PREG Axiomatizer - a ground bisimilarity checker for GSOS with predicates. In: Corradini, A., Klin, B., C\u00eerstea, C. (eds.) CALCO 2011. LNCS, vol.\u00a06859, pp. 378\u2013385. Springer, Heidelberg (2011)"},{"key":"5_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1007\/11601548_18","volume-title":"Processes, Terms and Cycles: Steps on the Road to Infinity","author":"L. Aceto","year":"2005","unstructured":"Aceto, L., Fokkink, W., Ing\u00f3lfsd\u00f3ttir, 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.\u00a03838, pp. 338\u2013367. Springer, Heidelberg (2005)"},{"key":"5_CR4","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/B978-044482830-9\/50021-7","volume-title":"Handbook of Process Algebra","author":"L. Aceto","year":"2001","unstructured":"Aceto, L., Fokkink, W., Verhoef, C.: Structural operational semantics. In: Bergstra, J.A., Ponse, A., Smolka, S.A. (eds.) Handbook of Process Algebra, ch. 3, pp. 197\u2013292. Elsevier Science, Dordrecht (2001)"},{"key":"5_CR5","first-page":"81","volume":"99","author":"L. Aceto","year":"2009","unstructured":"Aceto, L., Ingolfsdottir, A., Mousavi, M., Reniers, M.A.: Algebraic properties for free! Bulletin of the European Association for Theoretical Computer Science\u00a099, 81\u2013104 (2009)","journal-title":"Bulletin of the European Association for Theoretical Computer Science"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Baeten, J., Basten, T., Reniers, M.: Process Algebra: Equational Theories of Communicating Processes. Cambridge Tracts in Theoretical Computer Science, vol.\u00a050. Cambridge University Press (2009)","DOI":"10.1017\/CBO9781139195003"},{"key":"5_CR7","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/j.jlap.2004.03.001","volume":"60-61","author":"J.J. Baeten","year":"2004","unstructured":"Baeten, J.J., de Vink, E.P.: Axiomatizing GSOS with termination. Journal of Logic and Algebraic Programming\u00a060-61, 323\u2013351 (2004)","journal-title":"Journal of Logic and Algebraic Programming"},{"key":"5_CR8","unstructured":"Bergstra, J.A., Klop, J.W.: Fixedpoint semantics in process algebra. Technical Report IW 206\/82, Center for Mathematics, Amsterdam, The Netherlands (1982)"},{"issue":"1-3","key":"5_CR9","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/S0019-9958(84)80025-X","volume":"60","author":"J.A. Bergstra","year":"1984","unstructured":"Bergstra, J.A., Klop, J.W.: Process algebra for synchronous communication. Information and Control\u00a060(1-3), 109\u2013137 (1984)","journal-title":"Information and Control"},{"issue":"1","key":"5_CR10","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1145\/200836.200876","volume":"42","author":"B. Bloom","year":"1995","unstructured":"Bloom, B., Istrail, S., Meyer, A.R.: Bisimulation can\u2019t be traced. Journal of the ACM\u00a042(1), 232\u2013268 (1995)","journal-title":"Journal of the ACM"},{"key":"5_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/3-540-57887-0_108","volume-title":"Theoretical Aspects of Computer Software","author":"D. Bosscher","year":"1994","unstructured":"Bosscher, D.: Term rewriting properties of SOS axiomatisations. In: Hagiya, M., Mitchell, J.C. (eds.) TACS 1994. LNCS, vol.\u00a0789, pp. 425\u2013439. Springer, Heidelberg (1994)"},{"key":"5_CR12","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/B978-044482830-9\/50019-9","volume-title":"Handbook of Process Algebra","author":"R.J. Glabbeek van","year":"2001","unstructured":"van Glabbeek, R.J.: The linear time - branching time spectrum I. In: Bergstra, J.A., Ponse, A., Smolka, S.A. (eds.) Handbook of Process Algebra, ch. 1, pp. 3\u2013100. Elsevier Science, Dordrecht (2001)"},{"issue":"1","key":"5_CR13","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1145\/2455.2460","volume":"32","author":"M. Hennessy","year":"1985","unstructured":"Hennessy, M., Milner, A.R.: Algebraic laws for non-determinism and concurrency. Journal of the ACM\u00a032(1), 137\u2013161 (1985)","journal-title":"Journal of the ACM"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Hoare, C.A.R.: Communicating Sequential Processes. Prentice-Hall (1985)","DOI":"10.1007\/978-3-642-82921-5_4"},{"key":"5_CR15","unstructured":"Milner, A.R.: Communication and Concurrency. Prentice-Hall (1989)"},{"key":"5_CR16","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/j.ipl.2004.11.007","volume":"93","author":"M. Mousavi","year":"2005","unstructured":"Mousavi, M., Reniers, M., Groote, J.F.: A syntactic commutativity format for SOS. Information Processing Letters\u00a093, 217\u2013223 (2005)","journal-title":"Information Processing Letters"},{"key":"5_CR17","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1016\/j.tcs.2006.12.019","volume":"373","author":"M. Mousavi","year":"2007","unstructured":"Mousavi, M., Reniers, M.A., Groote, J.F.: SOS formats and meta-theory: 20 years after. Theoretical Computer Science\u00a0373, 238\u2013272 (2007)","journal-title":"Theoretical Computer Science"},{"key":"5_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BFb0017309","volume-title":"Theoretical Computer Science","author":"D.M. Park","year":"1981","unstructured":"Park, D.M.: Concurrency and automata on infinite sequences. In: Deussen, P. (ed.) GI-TCS 1981. LNCS, vol.\u00a0104, pp. 167\u2013183. Springer, Heidelberg (1981)"},{"key":"5_CR19","first-page":"17","volume":"60","author":"G.D. Plotkin","year":"2004","unstructured":"Plotkin, G.D.: A structural approach to operational semantics. Journal of Logic and Algebraic Progamming\u00a060, 17\u2013139 (2004)","journal-title":"Journal of Logic and Algebraic Progamming"},{"issue":"1","key":"5_CR20","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/S0304-3975(99)00214-5","volume":"239","author":"I. Ulidowski","year":"2000","unstructured":"Ulidowski, I.: Finite axiom systems for testing preorder and De Simone process languages. Theoretical Computer Science\u00a0239(1), 97\u2013139 (2000)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Algebra and Coalgebra in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40206-7_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,4]],"date-time":"2022-03-04T22:30:22Z","timestamp":1646433022000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40206-7_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642402050","9783642402067"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40206-7_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}