{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T11:48:11Z","timestamp":1763466491562,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642140518"},{"type":"electronic","value":"9783642140525"}],"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-14052-5_19","type":"book-chapter","created":{"date-parts":[[2010,7,12]],"date-time":"2010-07-12T14:23:14Z","timestamp":1278944594000},"page":"259-274","source":"Crossref","is-referenced-by-count":6,"title":["Automated Machine-Checked Hybrid System Safety Proofs"],"prefix":"10.1007","author":[{"given":"Herman","family":"Geuvers","sequence":"first","affiliation":[]},{"given":"Adam","family":"Koprowski","sequence":"additional","affiliation":[]},{"given":"Dan","family":"Synek","sequence":"additional","affiliation":[]},{"given":"Eelis","family":"van der Weegen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/3-540-45654-6_8","volume-title":"Computer Aided Systems Theory - EUROCAST 2001","author":"E. \u00c1brah\u00e1m-Mumm","year":"2001","unstructured":"\u00c1brah\u00e1m-Mumm, E., Hannemann, U., Steffen, M.: Assertion-based analysis of hybrid systems with PVS. In: Moreno-D\u00edaz Jr., R., Buchberger, B., Freire, J.-L. (eds.) EUROCAST 2001. LNCS, vol.\u00a02178, pp. 94\u2013109. Springer, Heidelberg (2001)"},{"key":"19_CR2","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1145\/1132357.1132363","volume":"5","author":"R. Alur","year":"2006","unstructured":"Alur, R., Dang, T., Ivan\u010di\u0107, F.: Predicate abstraction for reachability analysis of hybrid systems. ACM Trans. Embedded Comput. Syst.\u00a05, 152\u2013199 (2006)","journal-title":"ACM Trans. Embedded Comput. Syst."},{"issue":"1-2","key":"19_CR3","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.scico.2007.08.001","volume":"72","author":"R. Bagnara","year":"2008","unstructured":"Bagnara, R., Hill, P., Zaffanella, E.: The parma polyhedra library: Toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems. Sci. Comput. Program.\u00a072(1-2), 3\u201321 (2008)","journal-title":"Sci. Comput. Program."},{"issue":"1","key":"19_CR4","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/S0304-3975(00)00088-8","volume":"253","author":"N. Bj\u00f8rner","year":"2001","unstructured":"Bj\u00f8rner, N., Manna, Z., Sipma, H., Uribe, T.: Deductive verification of real-time systems using STeP. Theor. Comput. Sci.\u00a0253(1), 27\u201360 (2001)","journal-title":"Theor. Comput. Sci."},{"key":"19_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/3-540-48983-5_10","volume-title":"Hybrid Systems: Computation and Control","author":"A. Chutinan","year":"1999","unstructured":"Chutinan, A., Krogh, B.: Verification of polyhedral-invariant hybrid automata using polygonal flow pipe approximations. In: Vaandrager, F.W., van Schuppen, J.H. (eds.) HSCC 1999. LNCS, vol.\u00a01569, pp. 76\u201390. Springer, Heidelberg (1999)"},{"issue":"4","key":"19_CR6","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1142\/S012905410300190X","volume":"14","author":"E. Clarke","year":"2003","unstructured":"Clarke, E., Fehnker, A., Han, Z., Krogh, B., Ouaknine, J., Stursberg, O., Theobald, M.: Abstraction and counterexample-guided refinement in model checking of hybrid systems. Int. J. Found. Comput. Sci.\u00a014(4), 583\u2013604 (2003)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"19_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/978-3-540-27818-4_7","volume-title":"Mathematical Knowledge Management","author":"L. Cruz-Filipe","year":"2004","unstructured":"Cruz-Filipe, L., Geuvers, H., Wiedijk, F.: C-CoRN, the constructive Coq repository at Nijmegen. In: Asperti, A., Bancerek, G., Trybulec, A. (eds.) MKM 2004. LNCS, vol.\u00a03119, pp. 88\u2013103. Springer, Heidelberg (2004)"},{"key":"19_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1007\/978-3-540-31954-2_17","volume-title":"Hybrid Systems: Computation and Control","author":"G. Frehse","year":"2005","unstructured":"Frehse, G.: PHAVer: Algorithmic verification of hybrid systems past HyTech. In: Morari, M., Thiele, L. (eds.) HSCC 2005. LNCS, vol.\u00a03414, pp. 258\u2013273. Springer, Heidelberg (2005)"},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"Henzinger, T.: The theory of hybrid automata. pp. 278\u2013292 (1996)","DOI":"10.1109\/LICS.1996.561342"},{"key":"19_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1007\/3-540-64358-3_40","volume-title":"Hybrid Systems: Computation and Control","author":"T. Henzinger","year":"1998","unstructured":"Henzinger, T., Rusu, V.: Reachability verification for hybrid automata. In: Henzinger, T.A., Sastry, S.S. (eds.) HSCC 1998. LNCS, vol.\u00a01386, pp. 190\u2013204. Springer, Heidelberg (1998)"},{"issue":"1","key":"19_CR11","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/S0890-5401(03)00067-1","volume":"185","author":"N. Lynch","year":"2003","unstructured":"Lynch, N., Segala, R., Vaandrager, F.: Hybrid I\/O automata. Inf. Comput.\u00a0185(1), 105\u2013157 (2003)","journal-title":"Inf. Comput."},{"key":"19_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/3-540-64358-3_47","volume-title":"Hybrid Systems: Computation and Control","author":"Z. Manna","year":"1998","unstructured":"Manna, Z., Sipma, H.: Deductive verification of hybrid systems using STeP. In: Henzinger, T.A., Sastry, S.S. (eds.) HSCC 1998. LNCS, vol.\u00a01386, pp. 305\u2013318. Springer, Heidelberg (1998)"},{"key":"19_CR13","unstructured":"The MathWorks. MATLAB, http:\/\/www.mathworks.com\/products\/matlab\/"},{"key":"19_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/978-3-540-71067-7_21","volume-title":"Theorem Proving in Higher Order Logics","author":"R. O\u2019Connor","year":"2008","unstructured":"O\u2019Connor, R.: Certified exact transcendental real number computation in Coq. In: Mohamed, O.A., Mu\u00f1oz, C., Tahar, S. (eds.) TPHOLs 2008. LNCS, vol.\u00a05170, pp. 246\u2013261. Springer, Heidelberg (2008)"},{"key":"19_CR15","unstructured":"Pappas, G.: Hybrid system tools, http:\/\/wiki.grasp.upenn.edu\/hst\/"},{"key":"19_CR16","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/978-3-540-71070-7_15","volume-title":"Automated Reasoning","author":"A. Platzer","year":"2008","unstructured":"Platzer, A., Quesel, J.-D.: Keymaera: A hybrid theorem prover for hybrid systems. In: Armando, A., Baumgartner, P., Dowek, G. (eds.) IJCAR 2008. LNCS (LNAI), vol.\u00a05195, pp. 171\u2013178. Springer, Heidelberg (2008)"},{"key":"19_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/BFb0055350","volume-title":"Formal Techniques in Real-Time and Fault-Tolerant Systems","author":"J. Preu\u00dfig","year":"1998","unstructured":"Preu\u00dfig, J., Kowalewski, S., Wong-Toi, H., Henzinger, T.: An algorithm for the approximative analysis of rectangular automata. In: Ravn, A.P., Rischel, H. (eds.) FTRTFT 1998. LNCS, vol.\u00a01486, pp. 228\u2013240. Springer, Heidelberg (1998)"},{"issue":"4","key":"19_CR18","doi-asserted-by":"crossref","first-page":"723","DOI":"10.1145\/1183278.1183282","volume":"7","author":"S. Ratschan","year":"2006","unstructured":"Ratschan, S.: Efficient solving of quantified inequality constraints over the real numbers. ACM Transactions on Computational Logic\u00a07(4), 723\u2013748 (2006)","journal-title":"ACM Transactions on Computational Logic"},{"key":"19_CR19","doi-asserted-by":"crossref","unstructured":"Ratschan, S., She, Z.: Safety verification of hybrid systems by constraint propagation based abstraction refinement. ACM Transactions in Embedded Computing Systems\u00a06(1) (2007)","DOI":"10.1145\/1210268.1210276"},{"key":"19_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/BFb0031569","volume-title":"Hybrid Systems IV","author":"O. Stursberg","year":"1997","unstructured":"Stursberg, O., Kowalewski, S., Hoffmann, I., Preu\u00dfig, J.: Comparing timed and hybrid automata as approximations of continuous systems. In: Antsaklis, P.J., Kohn, W., Nerode, A., Sastry, S.S. (eds.) HS 1996. LNCS, vol.\u00a01273, pp. 361\u2013377. Springer, Heidelberg (1997)"},{"key":"19_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1007\/3-540-59451-5_2","volume-title":"Advanced Functional Programming","author":"P. Wadler","year":"1995","unstructured":"Wadler, P.: Monads for functional programming. In: Jeuring, J., Meijer, E. (eds.) AFP 1995. LNCS, vol.\u00a0925, pp. 24\u201352. Springer, Heidelberg (1995)"},{"key":"19_CR22","unstructured":"van der Weegen, E.: Automated machine-checked hybrid system safety proofs, an implementation of the abstraction method in Coq. Technical report, Radboud University Nijmegen (2009), http:\/\/www.eelis.net\/research\/hybrid\/"}],"container-title":["Lecture Notes in Computer Science","Interactive Theorem Proving"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14052-5_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T21:14:18Z","timestamp":1740258858000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14052-5_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642140518","9783642140525"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14052-5_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}