{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,23]],"date-time":"2025-02-23T05:13:09Z","timestamp":1740287589064,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642141270"},{"type":"electronic","value":"9783642141287"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","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-14128-7_19","type":"book-chapter","created":{"date-parts":[[2010,6,29]],"date-time":"2010-06-29T10:45:36Z","timestamp":1277808336000},"page":"219-233","source":"Crossref","is-referenced-by-count":5,"title":["Formally Verified Conditions for Regularity of Interval Matrices"],"prefix":"10.1007","author":[{"given":"Ioana","family":"Pa\u015fca","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","volume-title":"Coq\u2019Art:the Calculus of Inductive Constructions","author":"Y. Bertot","year":"2004","unstructured":"Bertot, Y., Cast\u00e9ran, P.: Interactive Theorem Proving and Program Development. In: Coq\u2019Art:the Calculus of Inductive Constructions. Springer, Heidelberg (2004)"},{"key":"19_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/978-3-540-71067-7_11","volume-title":"Theorem Proving in Higher Order Logics","author":"Y. Bertot","year":"2008","unstructured":"Bertot, Y., Gonthier, G., Biha, S.O., Pa\u015fca, I.: Canonical Big Operators. In: Mohamed, O.A., Mu\u00f1oz, C., Tahar, S. (eds.) TPHOLs 2008. LNCS, vol.\u00a05170, pp. 86\u2013101. Springer, Heidelberg (2008)"},{"key":"19_CR3","unstructured":"Biha, S.O.: Formalisation des math\u00e9matiques: une preuve du th\u00e9or\u00e8me de Cayley-Hamilton. In: Journ\u00e9es Francophones des Langages Applicatifs, pp. 1\u201314 (2008)"},{"key":"19_CR4","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/978-3-642-02614-0_10","volume-title":"Intelligent Computer Mathematics","author":"S. Boldo","year":"2009","unstructured":"Boldo, S., Filli\u00e2tre, J.-C., Melquiond, G.: Combining Coq and Gappa for Certifying Floating-Point Programs. In: Carette, J., Dixon, L., Coen, C.S., Watt, S.M. (eds.) Calculemus 2009, MKM 2009. LNCS (LNAI), vol.\u00a05625, pp. 59\u201374. Springer, Heidelberg (2009)"},{"key":"19_CR5","unstructured":"Coq development team. The Coq Proof Assistant Reference Manual, version 8.2 (2009)"},{"issue":"2","key":"19_CR6","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1109\/TC.2008.213","volume":"58","author":"M. Daumas","year":"2009","unstructured":"Daumas, M., Lester, D., Mu\u00f1oz, C.: Verified real number calculations: A library for interval arithmetic. IEEE Trans. Computers\u00a058(2), 226\u2013237 (2009)","journal-title":"IEEE Trans. Computers"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Daumas, M., Melquiond, G., Mu\u00f1oz, C.: Guaranteed proofs using interval arithmetic. In: Montuschi, P., Schwarz, E. (eds.) Proceedings of the 17th IEEE Symposium on Computer Arithmetic, Cape Cod, MA, USA, pp. 188\u2013195 (2005)","DOI":"10.1109\/ARITH.2005.25"},{"key":"19_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/978-3-642-03359-9_23","volume-title":"Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics (TPHOLs)","author":"F. Garillot","year":"2009","unstructured":"Garillot, F., Gonthier, G., Mahboubi, A., Rideau, L.: Packaging mathematical structures. In: Urban, C. (ed.) TPHOLs 2009. LNCS, vol.\u00a05674, pp. 327\u2013342. Springer, Heidelberg (2009)"},{"key":"19_CR9","unstructured":"Gonthier, G., Mahboubi, A.: A small scale reflection extension for the coq system. INRIA Technical report, http:\/\/hal.inria.fr\/inria-00258384"},{"key":"19_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1007\/11541868_8","volume-title":"Theorem Proving in Higher Order Logics","author":"J. Harrison","year":"2005","unstructured":"Harrison, J.: A HOL theory of euclidean space. In: Hurd, J., Melham, T.F. (eds.) TPHOLs 2005. LNCS, vol.\u00a03603, pp. 114\u2013129. Springer, Heidelberg (2005)"},{"issue":"4","key":"19_CR11","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1017\/S0956796898003153","volume":"8","author":"M. Hedberg","year":"1998","unstructured":"Hedberg, M.: A Coherence Theorem for Martin-L\u00f6f\u2019s Type Theory. Journal of Functional Programming\u00a08(4), 413\u2013436 (1998)","journal-title":"Journal of Functional Programming"},{"key":"19_CR12","unstructured":"Holzl, J.: Proving Inequalities over Reals with Computation in Isabelle\/HOL. In: International Workshop on Programming Languages for Mechanized Mathematics Systems, pp. 38\u201345 (2009)"},{"key":"19_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1007\/978-3-642-03359-9_28","volume-title":"Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics (TPHOLs)","author":"N. Julien","year":"2009","unstructured":"Julien, N., Pa\u015fca, I.: Formal Verification of Exact Computations Using Newton\u2019s Method. In: Urban, C. (ed.) TPHOLs 2009. LNCS, vol.\u00a05674, pp. 408\u2013423. Springer, Heidelberg (2009)"},{"key":"19_CR14","unstructured":"Magaud, N.: Programming with Dependent Types in Coq: a Study of Square Matrices (January 2005) (Unpublished); A preliminary version appeared in Coq contributions"},{"key":"19_CR15","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/978-3-540-71070-7_2","volume-title":"Automated Reasoning","author":"G. Melquiond","year":"2008","unstructured":"Melquiond, G.: Proving bounds on real-valued functions with computations. In: Armando, A., Baumgartner, P., Dowek, G. (eds.) IJCAR 2008. LNCS (LNAI), vol.\u00a05195, pp. 2\u201317. Springer, Heidelberg (2008)"},{"key":"19_CR16","doi-asserted-by":"publisher","first-page":"399","DOI":"10.2478\/v10006-009-0033-3","volume":"19","author":"J.-P. Merlet","year":"2009","unstructured":"Merlet, J.-P.: Interval analysis for certified numerical solution of problems in robotics. International Journal of Applied Mathematics and Computer Science\u00a019, 399\u2013412 (2009)","journal-title":"International Journal of Applied Mathematics and Computer Science"},{"key":"19_CR17","volume-title":"Interval Methods for Systems of Equations","author":"A. Neumaier","year":"1990","unstructured":"Neumaier, A.: Interval Methods for Systems of Equations. Cambridge University Press, Cambridge (1990)"},{"key":"19_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/11541868_15","volume-title":"Theorem Proving in Higher Order Logics","author":"S. Obua","year":"2005","unstructured":"Obua, S.: Proving bounds for real linear programs in isabelle\/hol. In: Hurd, J., Melham, T. (eds.) TPHOLs 2005. LNCS, vol.\u00a03603, pp. 227\u2013244. Springer, Heidelberg (2005)"},{"key":"19_CR19","unstructured":"Pasca, I.: Formal Proofs for Theoretical Properties of Newton\u2019s Method (2010), INRIA Research Report RR-7228, http:\/\/hal.inria.fr\/inria-00463150\/en\/"},{"key":"19_CR20","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1137\/S0895479896310743","volume":"20","author":"G. Rex","year":"1998","unstructured":"Rex, G., Rohn, J.: Sufficient conditions for regularity and singularity of interval matrices. SIAM Journal on Matrix Analysis and Applications\u00a020, 437\u2013445 (1998)","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"key":"19_CR21","first-page":"500","volume":"18","author":"J. Rohn","year":"2009","unstructured":"Rohn, J.: Forty necessary and sufficient conditions for regularity of interval matrices: A survey. Electronic Journal of Linear Algebra\u00a018, 500\u2013512 (2009)","journal-title":"Electronic Journal of Linear Algebra"}],"container-title":["Lecture Notes in Computer Science","Intelligent Computer Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14128-7_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T09:24:16Z","timestamp":1740216256000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14128-7_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642141270","9783642141287"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14128-7_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}