{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T08:03:26Z","timestamp":1743149006423,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642162640"},{"type":"electronic","value":"9783642162657"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-16265-7_23","type":"book-chapter","created":{"date-parts":[[2010,9,30]],"date-time":"2010-09-30T21:45:41Z","timestamp":1285883141000},"page":"320-335","source":"Crossref","is-referenced-by-count":4,"title":["Integrating Implicit Induction Proofs into Certified Proof Environments"],"prefix":"10.1007","author":[{"given":"Sorin","family":"Stratulat","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"23_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139172752","volume-title":"Term Rewriting and All That","author":"F. Baader","year":"1998","unstructured":"Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)"},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"Barthe, G., Courtieu, P.: Efficient reasoning about executable specifications in Coq. In: Theorem Proving in Higher Order Logics, p. 64 (2002)","DOI":"10.1007\/3-540-45685-6_4"},{"key":"23_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/3-540-44881-0_24","volume-title":"Rewriting Techniques and Applications","author":"G. Barthe","year":"2003","unstructured":"Barthe, G., Stratulat, S.: Validation of the JavaCard platform with implicit induction techniques. In: Nieuwenhuis, R. (ed.) RTA 2003. LNCS, vol.\u00a02706, pp. 337\u2013351. Springer, Heidelberg (2003)"},{"key":"23_CR4","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/978-3-540-75560-9_13","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"R. Bonichon","year":"2007","unstructured":"Bonichon, R., Delahaye, D., Doligez, D.: Zenon: An extensible automated theorem prover producing checkable proofs. In: Dershowitz, N., Voronkov, A. (eds.) LPAR 2007. LNCS (LNAI), vol.\u00a04790, pp. 151\u2013165. Springer, Heidelberg (2007)"},{"issue":"2","key":"23_CR5","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/BF00881856","volume":"14","author":"A. Bouhoula","year":"1995","unstructured":"Bouhoula, A., Rusinowitch, M.: Implicit induction in conditional theories. Journal of Automated Reasoning\u00a014(2), 189\u2013235 (1995)","journal-title":"Journal of Automated Reasoning"},{"key":"23_CR6","unstructured":"Brotherston, J.: Sequent Calculus Proof Systems for Inductive Definitions. PhD thesis, University of Edinburgh (November 2006)"},{"key":"23_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1007\/3-540-52885-7_123","volume-title":"10th International Conference on Automated Deduction","author":"A. Bundy","year":"1990","unstructured":"Bundy, A., van Harmelen, F., Horn, C., Smaill, A.: The Oyster-Clam system. In: Stickel, M.E. (ed.) CADE 1990. LNCS, vol.\u00a0449, pp. 647\u2013648. Springer, Heidelberg (1990)"},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"Contejean, E., Courtieu, P., Forest, J., Pons, O., Urbain, X.: Certification of automated termination proofs. In: Frontiers of Combining Systems, pp. 148\u2013162 (2007)","DOI":"10.1007\/978-3-540-74621-8_10"},{"key":"23_CR9","unstructured":"Courant, J.: Proof reconstruction. Research Report RR96-26, LIP, Preliminary version (1996)"},{"key":"23_CR10","unstructured":"Dixon, L.: A Proof Planning Framework for Isabelle. PhD thesis, University of Edinburgh (2005)"},{"issue":"2","key":"23_CR11","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/j.tcs.2005.09.066","volume":"351","author":"A. Imine","year":"2006","unstructured":"Imine, A., Rusinowitch, M., Oster, G., Molli, P.: Formal design and verification of operational transformation algorithms for copies convergence. Theoretical Computer Science\u00a0351(2), 167\u2013183 (2006)","journal-title":"Theoretical Computer Science"},{"key":"23_CR12","unstructured":"Kaliszyk, C.: Validation des preuves par r\u00e9currence implicite avec des outils bas\u00e9s sur le calcul des constructions inductives. Master\u2019s thesis, Universit\u00e9 Paul Verlaine - Metz (2005)"},{"issue":"6","key":"23_CR13","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1145\/1743546.1743574","volume":"53","author":"G. Klein","year":"2010","unstructured":"Klein, G., Andronick, J., Elphinstone, K., Heiser, G., Cock, D., Derrin, P., Elkaduwe, D., Engelhardt, K., Kolanski, R., Norrish, M., Sewell, T., Tuch, H., Winwood, S.: seL4: Formal verification of an operating-system kernel. Communications of the ACM\u00a053(6), 107\u2013115 (2010)","journal-title":"Communications of the ACM"},{"key":"23_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/11617990_10","volume-title":"Types for Proofs and Programs","author":"F. Lindblad","year":"2006","unstructured":"Lindblad, F., Benke, M.: A tool for automated theorem proving in Agda. In: Filli\u00e2tre, J.-C., Paulin-Mohring, C., Werner, B. (eds.) TYPES 2004. LNCS, vol.\u00a03839, pp. 154\u2013169. Springer, Heidelberg (2006)"},{"issue":"1-2","key":"23_CR15","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/s10472-009-9154-5","volume":"55","author":"F. Nahon","year":"2009","unstructured":"Nahon, F., Kirchner, C., Kirchner, H., Brauner, P.: Inductive proof search modulo. Annals of Mathematics and Artificial Intelligence\u00a055(1-2), 123\u2013154 (2009)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"issue":"2","key":"23_CR16","first-page":"182","volume":"1","author":"B. Pientka","year":"1998","unstructured":"Pientka, B., Kreitz, C.: Automating inductive specification proofs in NuPrL. Fundamenta Informaticae\u00a01(2), 182\u2013209 (1998)","journal-title":"Fundamenta Informaticae"},{"key":"23_CR17","unstructured":"The\u00a0Spike prover, http:\/\/code.google.com\/p\/spike-prover"},{"key":"23_CR18","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1109\/ICWS.2007.150","volume-title":"ICWS, IEEE International Conference on Web Services","author":"M. Rouached","year":"2007","unstructured":"Rouached, M., Godart, C.: Reasoning about events to specify authorization policies for web services composition. In: ICWS, IEEE International Conference on Web Services, pp. 481\u2013488. IEEE Computer Society, Los Alamitos (2007)"},{"issue":"2","key":"23_CR19","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1023\/A:1023251327012","volume":"30","author":"M. Rusinowitch","year":"2003","unstructured":"Rusinowitch, M., Stratulat, S., Klay, F.: Mechanical verification of an ideal incremental ABR conformance algorithm. J. Autom. Reasoning\u00a030(2), 53\u2013177 (2003)","journal-title":"J. Autom. Reasoning"},{"issue":"4","key":"23_CR20","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1006\/jsco.2000.0469","volume":"32","author":"S. Stratulat","year":"2001","unstructured":"Stratulat, S.: A general framework to build contextual cover set induction provers. J. Symb. Comput.\u00a032(4), 403\u2013445 (2001)","journal-title":"J. Symb. Comput."},{"key":"23_CR21","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/11554554_20","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"S. Stratulat","year":"2005","unstructured":"Stratulat, S.: Automatic \u2018Descente Infinie\u2019 induction reasoning. In: Beckert, B. (ed.) TABLEAUX 2005. LNCS (LNAI), vol.\u00a03702, pp. 262\u2013276. Springer, Heidelberg (2005)"},{"key":"23_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/978-3-540-70590-1_24","volume-title":"Rewriting Techniques and Applications","author":"S. Stratulat","year":"2008","unstructured":"Stratulat, S.: Combining rewriting with Noetherian induction to reason on non-orientable equalities. In: Voronkov, A. (ed.) RTA 2008. LNCS, vol.\u00a05117, pp. 351\u2013365. Springer, Heidelberg (2008)"},{"key":"23_CR23","doi-asserted-by":"crossref","unstructured":"Stratulat, S., Demange, V.: Validating implicit induction proofs using certified proof environments. In: Poster Session of 2010 Grande Region Security and Reliability Day, Saarbrucken (March 2010)","DOI":"10.1007\/978-3-642-16265-7_23"},{"key":"23_CR24","unstructured":"The Coq\u00a0Development Team. The Coq reference manual - version 8.2 (2009), http:\/\/coq.inria.fr\/doc"},{"key":"23_CR25","unstructured":"Wilson, S., Fleuriot, J., Smaill, A.: Inductive proof automation for Coq. In: Coq Workshop (to appear 2010)"}],"container-title":["Lecture Notes in Computer Science","Integrated Formal Methods"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16265-7_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,5]],"date-time":"2019-06-05T01:00:08Z","timestamp":1559696408000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16265-7_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642162640","9783642162657"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16265-7_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}