{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,3]],"date-time":"2025-03-03T05:37:21Z","timestamp":1740980241327,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642180972"},{"type":"electronic","value":"9783642180989"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-18098-9_7","type":"book-chapter","created":{"date-parts":[[2011,2,4]],"date-time":"2011-02-04T13:56:14Z","timestamp":1296827774000},"page":"59-68","source":"Crossref","is-referenced-by-count":9,"title":["Partial Derivative Automata Formalized in Coq"],"prefix":"10.1007","author":[{"given":"Jos\u00e9 Bacelar","family":"Almeida","sequence":"first","affiliation":[]},{"given":"Nelma","family":"Moreira","sequence":"additional","affiliation":[]},{"given":"David","family":"Pereira","sequence":"additional","affiliation":[]},{"given":"Sim\u00e3o Melo","family":"de Sousa","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"7_CR1","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/0304-3975(95)80024-4","volume":"143","author":"V.M. Antimirov","year":"1995","unstructured":"Antimirov, V.M., Mosses, P.D.: Rewriting extended regular expressions. Theor. Comput. Sci.\u00a0143(1), 51\u201372 (1995)","journal-title":"Theor. Comput. Sci."},{"issue":"04","key":"7_CR2","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1142\/S0129054109006802","volume":"20","author":"M. Almeida","year":"2009","unstructured":"Almeida, M., Moreira, N., Reis, R.: Antimirov and Mosses\u2019s rewrite system revisited. International Journal Of Foundations Of Computer Science\u00a020(04), 669\u2013684 (2009)","journal-title":"International Journal Of Foundations Of Computer Science"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Almeida, M., Moreira, N., Reis, R.: Testing equivalence of regular languages. In: DCFS 2009, Magdeburg, Germany (2009)","DOI":"10.4204\/EPTCS.3.4"},{"issue":"2","key":"7_CR4","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/0304-3975(95)00182-4","volume":"155","author":"V.M. Antimirov","year":"1996","unstructured":"Antimirov, V.M.: Partial derivatives of regular expressions and finite automaton constructions. Theoret. Comput. Sci.\u00a0155(2), 291\u2013319 (1996)","journal-title":"Theoret. Comput. Sci."},{"key":"7_CR5","series-title":"Texts in Theoretical Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-07964-5","volume-title":"Interactive Theorem Proving and Program Development","author":"Y. Bertot","year":"2004","unstructured":"Bertot, Y., Cast\u00e9ran, P.: Interactive Theorem Proving and Program Development. Texts in Theoretical Computer Science. Springer, Heidelberg (2004)"},{"key":"7_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/978-3-642-14455-4_12","volume-title":"Developments in Language Theory","author":"S. Broda","year":"2010","unstructured":"Broda, S., Machiavelo, A., Moreira, N., Reis, R.: On the average number of states of partial derivative automata. In: Gao, Y., Lu, H., Seki, S., Yu, S. (eds.) DLT 2010. LNCS, vol.\u00a06224, pp. 112\u2013123. Springer, Heidelberg (2010)"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Braibant, T., Pous, D.: A tactic for deciding Kleene algebras. In: First Coq Workshop (Available as a HAL report) (August 2009)","DOI":"10.1007\/978-3-642-14052-5_13"},{"key":"7_CR8","unstructured":"Briais, S.: Finite automata theory in Coq (2008), http:\/\/www.prism.uvsq.fr\/~bris\/tools\/Automata_080708.tar.gz"},{"issue":"4","key":"7_CR9","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1145\/321239.321249","volume":"11","author":"J.A. Brzozowski","year":"1964","unstructured":"Brzozowski, J.A.: Derivatives of regular expressions. JACM\u00a011(4), 481\u2013494 (1964)","journal-title":"JACM"},{"issue":"3","key":"7_CR10","doi-asserted-by":"crossref","first-page":"195","DOI":"10.3233\/FUN-2001-45303","volume":"45","author":"J.M. Champarnaud","year":"2001","unstructured":"Champarnaud, J.M., Ziadi, D.: From Mirkin\u2019s prebases to Antimirov\u2019s word partial derivatives. Fundam. Inform.\u00a045(3), 195\u2013205 (2001)","journal-title":"Fundam. Inform."},{"key":"7_CR11","unstructured":"Filli\u00e2tre, J.-C.: Finite automata theory in Coq - a constructive proof of Kleene\u2019s theorem (1997)"},{"key":"7_CR12","first-page":"479","volume-title":"The formulae-as-types notion of construction","author":"W.A. Howard","year":"1980","unstructured":"Howard, W.A.: The formulae-as-types notion of construction, pp. 479\u2013490. Academic Press, London (1980)"},{"key":"7_CR13","first-page":"3","volume-title":"Automata Studies","author":"S.C. Kleene","year":"1956","unstructured":"Kleene, S.C.: Representation of events in nerve nets and finite automata. In: Shannon, C.E., McCarthy, J. (eds.) Automata Studies, pp. 3\u201341. Princeton University Press, Princeton (1956)"},{"issue":"2","key":"7_CR14","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(2), 366\u2013390 (1994)","journal-title":"Infor. and Comput."},{"issue":"3","key":"7_CR15","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(3), 427\u2013443 (1997)","journal-title":"Transactions on Programming Languages and Systems"},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"Kozen, D., Tiuryn, J.: On the completeness of propositional Hoare logic. In: RelMiCS, pp. 195\u2013202 (2000)","DOI":"10.1016\/S0020-0255(01)00164-5"},{"key":"7_CR17","first-page":"51","volume":"5","author":"B.G. Mirkin","year":"1966","unstructured":"Mirkin, B.G.: An algorithm for constructing a base in a language of regular expressions. Engineering Cybernetics\u00a05, 51\u201357 (1966)","journal-title":"Engineering Cybernetics"},{"key":"7_CR18","unstructured":"Moreira, N., Pereira, D., de Sousa, S.M.: On the mechanization of Kleene algebra in Coq. Technical Report DCC-2009-03, DCC-FC&LIACC, Universidade do Porto (2009)"},{"key":"7_CR19","first-page":"106","volume-title":"Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of Programming Languages POPL 1997","author":"G.C. Necula","year":"1997","unstructured":"Necula, G.C.: Proof-carrying code. In: Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of Programming Languages POPL 1997, pp. 106\u2013119. ACM, New York (1997)"},{"key":"7_CR20","unstructured":"Pereira, D., Moreira, N.: KAT and PHL in Coq. Computer Science and Information Systems\u00a005(02) (December 2008) ISSN: 1820-0214"},{"key":"7_CR21","unstructured":"Razet, B.: Simulating Eilenberg Machines with a Reactive Engine: Formal Specification, Proof and Program Extraction. Research Report (2008)"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-18098-9_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,2]],"date-time":"2025-03-02T11:03:19Z","timestamp":1740913399000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-18098-9_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642180972","9783642180989"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18098-9_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}