乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T00:51:24Z","timestamp":1743036684816,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642243097"},{"type":"electronic","value":"9783642243103"}],"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-24310-3_19","type":"book-chapter","created":{"date-parts":[[2011,9,24]],"date-time":"2011-09-24T00:14:55Z","timestamp":1316823295000},"page":"271-285","source":"Crossref","is-referenced-by-count":4,"title":["Incremental Computation of Succinct Abstractions for Hybrid Systems"],"prefix":"10.1007","author":[{"given":"Tom\u00e1\u0161","family":"Dzetkuli\u010d","sequence":"first","affiliation":[]},{"given":"Stefan","family":"Ratschan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"19_CR1","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. Trans. on Embedded Computing Sys.\u00a05(1), 152\u2013199 (2006)","journal-title":"Trans. on Embedded Computing Sys."},{"issue":"1\u20132","key":"19_CR2","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/S0304-3975(99)00032-8","volume":"221","author":"K.R. Apt","year":"1999","unstructured":"Apt, K.R.: The essence of constraint propagation. Theoretical Computer Science\u00a0221(1\u20132), 179\u2013210 (1999)","journal-title":"Theoretical Computer Science"},{"issue":"6","key":"19_CR3","doi-asserted-by":"publisher","first-page":"1002","DOI":"10.1145\/371880.371884","volume":"22","author":"K.R. Apt","year":"2000","unstructured":"Apt, K.R.: The role of commutativity in constraint propagation algorithms. ACM Transactions on Programming Languages and Systems\u00a022(6), 1002\u20131036 (2000)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"19_CR4","series-title":"ch.16","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1016\/S1574-6526(06)80020-9","volume-title":"Handbook of Constraint Programming","author":"F. Benhamou","year":"2006","unstructured":"Benhamou, F., Granvilliers, L.: Continuous and interval constraints. In: Rossi, F., van Beek, P., Walsh, T. (eds.) Handbook of Constraint Programming. ch.16, pp. 571\u2013603. Elsevier, Amsterdam (2006)"},{"key":"19_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/BFb0039704","volume-title":"Formal Methods in Programming and Their Applications","author":"F. Bourdoncle","year":"1993","unstructured":"Bourdoncle, F.: Efficient chaotic iteration strategies with widenings. In: Bj\u00f8rner, D., Broy, M., Pottosin, I. (eds.) FMP&TA 1993. LNCS, vol.\u00a0735, pp. 128\u2013141. Springer, Heidelberg (1993)"},{"issue":"4","key":"19_CR6","first-page":"369","volume":"89","author":"I. Br\u00fcckner","year":"2008","unstructured":"Br\u00fcckner, I., Dr\u00e4ger, K., Finkbeiner, B., Wehrheim, H.: Slicing abstractions. Fundamenta Informaticae\u00a089(4), 369\u2013392 (2008)","journal-title":"Fundamenta Informaticae"},{"issue":"4","key":"19_CR7","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. of Foundations of Comp. Sc.\u00a014(4), 583\u2013604 (2003)","journal-title":"Int. J. of Foundations of Comp. Sc."},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R.: Automatic synthesis of optimal invariant assertions: Mathematical foundations. In: Proceedings of the 1977 Symposium on Artificial Intelligence and Programming Languages, pp. 1\u201312 (1977)","DOI":"10.1145\/800228.806926"},{"issue":"1","key":"19_CR9","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1142\/S0129054107004577","volume":"18","author":"W. Damm","year":"2007","unstructured":"Damm, W., Pinto, G., Ratschan, S.: Guaranteed termination in the verification of LTL properties of non-linear robust discrete time hybrid systems. International Journal of Foundations of Computer Science (IJFCS)\u00a018(1), 63\u201386 (2007)","journal-title":"International Journal of Foundations of Computer Science (IJFCS)"},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"Dzetkuli\u010d, T., Ratschan, S.: How to capture hybrid systems evolution into slices of parallel hyperplanes. In: ADHS 2009: 3rd IFAC Conference on Analysis and Design of Hybrid Systems, pp. 274\u2013279 (2009)","DOI":"10.3182\/20090916-3-ES-3003.00048"},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"Frehse, G., Krogh, B.H., Rutenbar, R.A.: Verifying analog oscillator circuits using forward\/backward abstraction refinement. In: DATE 2006: Design, Automation and Test in Europe (2006)","DOI":"10.1109\/DATE.2006.244113"},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"Henzinger, T.A., Ho, P.-H.: A note on abstract interpretation strategies for hybrid automata. LNCS, vol.\u00a0999, pp. 252\u2013264 (1995)","DOI":"10.1007\/3-540-60472-3_13"},{"key":"19_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03811-6","volume-title":"Principles of Program Analysis","author":"F. Nielson","year":"1999","unstructured":"Nielson, F., Nielson, H.R., Hankin, C.: Principles of Program Analysis. Springer, Heidelberg (1999)"},{"issue":"4","key":"19_CR14","doi-asserted-by":"publisher","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_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/978-3-642-13562-0_36","volume-title":"Theory and Applications of Models of Computation","author":"S. Ratschan","year":"2010","unstructured":"Ratschan, S.: Safety verification of non-linear hybrid systems is quasi-semidecidable. In: Kratochv\u00edl, J., Li, A., Fiala, J., Kolman, P. (eds.) TAMC 2010. LNCS, vol.\u00a06108, pp. 397\u2013408. Springer, Heidelberg (2010)"},{"key":"19_CR16","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 6(1) (2007)","DOI":"10.1145\/1210268.1210276"},{"key":"19_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/978-3-642-02949-3_12","volume-title":"Tests and Proofs","author":"S. Ratschan","year":"2009","unstructured":"Ratschan, S., Smaus, J.-G.: Finding errors of hybrid systems by optimising an abstraction-based quality estimate. In: Dubois, C. (ed.) TAP 2009. LNCS, vol.\u00a05668, pp. 153\u2013168. Springer, Heidelberg (2009)"},{"key":"19_CR18","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/978-3-540-73595-3_11","volume-title":"Automated Deduction \u2013 CADE-21","author":"A. Tiwari","year":"2007","unstructured":"Tiwari, A., Gulwani, S.: Logical interpretation: Static program analysis using theorem proving. In: Pfenning, F. (ed.) CADE 2007. LNCS (LNAI), vol.\u00a04603, pp. 147\u2013166. Springer, Heidelberg (2007)"}],"container-title":["Lecture Notes in Computer Science","Formal Modeling and Analysis of Timed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-24310-3_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,16]],"date-time":"2019-06-16T05:42:45Z","timestamp":1560663765000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24310-3_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642243097","9783642243103"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24310-3_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}