{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T13:58:51Z","timestamp":1726408731009},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319062501"},{"type":"electronic","value":"9783319062518"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-06251-8_6","type":"book-chapter","created":{"date-parts":[[2014,4,8]],"date-time":"2014-04-08T01:32:39Z","timestamp":1396920759000},"page":"83-100","source":"Crossref","is-referenced-by-count":0,"title":["A Modified Completeness Theorem of KAT and Decidability of Term Reducibility"],"prefix":"10.1007","author":[{"given":"Takeo","family":"Uramoto","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","unstructured":"Angus, A., Kozen, D.: Kleene algebra with tests and program schematology. Technical Report TR2001-1844, Computer Science Department, Cornell University (2001)"},{"key":"6_CR2","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/S0012-365X(73)80005-6","volume":"4","author":"J.A. Brzozowski","year":"1972","unstructured":"Brzozowski, J.A., Simon, I.: Characterizations of locally testable events. Discrete Mathematics\u00a04, 243\u2013271 (1972)","journal-title":"Discrete Mathematics"},{"key":"6_CR3","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.tcs.2004.07.020","volume":"327","author":"H. Chen","year":"2004","unstructured":"Chen, H., Pucella, R.: A coalgebraic approach to Kleene algebra with tests. Theoret. Comput. Sci.\u00a0327, 23\u201344 (2004)","journal-title":"Theoret. Comput. Sci."},{"key":"6_CR4","unstructured":"Cohen, E.: Hypotheses in Kleene algebra (1994), \n                    \n                      ftp:\/\/ftp.bellcore.com\/pub\/ernie\/research\/homepage.html"},{"key":"6_CR5","unstructured":"Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation, 3rd edn. Prentice Hall (2006)"},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"9","DOI":"10.3166\/jancl.16.9-33","volume":"16","author":"A.-H. Kamal","year":"2006","unstructured":"Kamal, A.-H., Kozen, D.: KAT-ML: An interactive theorem prover for Kleene algebra with tests. Journal of Applied Non-Classical Logics\u00a016, 9\u201333 (2006)","journal-title":"Journal of Applied Non-Classical Logics"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Kozen, D., Tiuryn, J.: Logics of programs. In: Handbook of Theoretical Computer Science. Elsevier (1990)","DOI":"10.1016\/B978-0-444-88074-1.50019-6"},{"key":"6_CR8","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1006\/inco.1994.1037","volume":"110","author":"D. Kozen","year":"1994","unstructured":"Kozen, D.: A completeness theorem for Kleene algebras and the algebra of regular events. Infor. and Comput.\u00a0110, 366\u2013390 (1994)","journal-title":"Infor. and Comput."},{"key":"6_CR9","unstructured":"Kozen, D., Cohen, E., Smith, F.: The complexity of Kleene algebra with tests. Technical Report TR96-1598, Computer Science Department, Cornell University (1996)"},{"key":"6_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/3-540-63172-0_43","volume-title":"Computer Science Logic","author":"D. Kozen","year":"1997","unstructured":"Kozen, D., Smith, F.: Kleene algebra with tests: Completeness and decidability. In: van Dalen, D., Bezem, M. (eds.) CSL 1996. LNCS, vol.\u00a01258, pp. 244\u2013259. Springer, Heidelberg (1997)"},{"key":"6_CR11","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1145\/256167.256195","volume":"19","author":"D. Kozen","year":"1997","unstructured":"Kozen, D.: Kleene algebra with tests. Transactions on Programming Languages and Systems\u00a019, 427\u2013443 (1997)","journal-title":"Transactions on Programming Languages and Systems"},{"key":"6_CR12","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1145\/343369.343378","volume":"1","author":"D. Kozen","year":"2000","unstructured":"Kozen, D.: On Hoare logic and Kleene algebra with tests. Trans. Computational Logic\u00a01, 60\u201376 (2000)","journal-title":"Trans. Computational Logic"},{"key":"6_CR13","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1007\/3-540-44957-4_38","volume-title":"Computational Logic - CL 2000","author":"D. Kozen","year":"2000","unstructured":"Kozen, D., Patron, M.-C.: Certification of compiler optimizations using Kleene algebra with tests. In: Lloyd, J., et al. (eds.) CL 2000. LNCS (LNAI), vol.\u00a01861, pp. 568\u2013582. Springer, Heidelberg (2000)"},{"key":"6_CR14","first-page":"117","volume":"24","author":"D. Kozen","year":"2003","unstructured":"Kozen, D.: Automata on guarded strings and applications. Mat\u00e9matica Contempor\u00e2nea\u00a024, 117\u2013139 (2003)","journal-title":"Mat\u00e9matica Contempor\u00e2nea"},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"Kozen, D.: Nonlocal flow of control and Kleene algebra with tests. In: Proc. 23rd IEEE Symp. Logic in Computer Science (LICS 2008), pp. 105\u2013117 (2008)","DOI":"10.1109\/LICS.2008.32"},{"key":"6_CR16","unstructured":"Kozen, D.: On the coalgebraic theory of Kleene algebra with tests. Technical Report Computer Science Department, Cornell University (2008), \n                    \n                      http:\/\/hdl.handle.com\/1813\/10173"},{"key":"6_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-540-70594-9_11","volume-title":"Mathematics of Program Construction","author":"D. Kozen","year":"2008","unstructured":"Kozen, D., Tseng, W.-L.D.: The B\u00f6hm-Jacopini theorem is false, propositionally. In: Audebaud, P., Paulin-Mohring, C. (eds.) MPC 2008. LNCS, vol.\u00a05133, pp. 177\u2013192. Springer, Heidelberg (2008)"},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"Pin, J.E.: Varieties of Formal Languages. Foundations of Computer Science. Springer (1986)","DOI":"10.1007\/978-1-4613-2215-3"},{"key":"6_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/3-540-44977-9_17","volume-title":"Implementation and Application of Automata","author":"L. Pol\u00e1k","year":"2003","unstructured":"Pol\u00e1k, L.: Syntactic semiring and language equations. In: Champarnaud, J.-M., Maurel, D. (eds.) CIAA 2002. LNCS, vol.\u00a02608, pp. 182\u2013193. Springer, Heidelberg (2003)"},{"key":"6_CR20","first-page":"395","volume":"40","author":"L. Pol\u00e1k","year":"2004","unstructured":"Pol\u00e1k, L.: A classification of rational languages by semilattice-ordered monoids. Archivum Mathematium\u00a040, 395\u2013406 (2004)","journal-title":"Archivum Mathematium"},{"key":"6_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1007\/978-3-540-28629-5_49","volume-title":"Mathematical Foundations of Computer Science 2004","author":"L. Pol\u00e1k","year":"2004","unstructured":"Pol\u00e1k, L.: On Pseudovarieties of Semiring Homomorphisms. In: Fiala, J., Koubek, V., Kratochv\u00edl, J. (eds.) MFCS 2004. LNCS, vol.\u00a03153, pp. 635\u2013647. Springer, Heidelberg (2004)"},{"key":"6_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/BFb0055624","volume-title":"CONCUR \u201998 Concurrency Theory","author":"J.J.M.M. Rutten","year":"1998","unstructured":"Rutten, J.J.M.M.: Automata and coinduction (an exercise in coalgebra). In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol.\u00a01466, pp. 194\u2013218. Springer, Heidelberg (1998)"},{"key":"6_CR23","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1016\/S0019-9958(65)90108-7","volume":"8","author":"M.-P. Sch\u00fctzenberger","year":"1965","unstructured":"Sch\u00fctzenberger, M.-P.: On finite monoids having only trivial subgroups. Information and Control\u00a08, 190\u2013194 (1965)","journal-title":"Information and Control"},{"key":"6_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1007\/3-540-07407-4_23","volume-title":"Automata Theory and Formal Languages","author":"I. Simon","year":"1975","unstructured":"Simon, I.: Piecewise testable events. In: Brakhage, H. (ed.) GI-Fachtagung 1975. LNCS, vol.\u00a033, pp. 214\u2013222. Springer, Heidelberg (1975)"}],"container-title":["Lecture Notes in Computer Science","Relational and Algebraic Methods in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-06251-8_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,20]],"date-time":"2019-01-20T22:59:44Z","timestamp":1548025184000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-06251-8_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319062501","9783319062518"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-06251-8_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}