{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T19:51:36Z","timestamp":1762458696893},"publisher-location":"Berlin, Heidelberg","reference-count":35,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642005145"},{"type":"electronic","value":"9783642005152"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-00515-2_5","type":"book-chapter","created":{"date-parts":[[2009,3,3]],"date-time":"2009-03-03T05:38:40Z","timestamp":1236058720000},"page":"55-70","source":"Crossref","is-referenced-by-count":9,"title":["Analysis of Linear Hybrid Systems in CLP"],"prefix":"10.1007","author":[{"given":"Gourinath","family":"Banda","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John P.","family":"Gallagher","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"5_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0304-3975(94)00202-T","volume":"138","author":"R. Alur","year":"1995","unstructured":"Alur, R., Courcoubetis, C., Halbwachs, N., Henzinger, T.A., Ho, P.-H., Nicollin, X., Olivero, A., Sifakis, J., Yovine, S.: The algorithmic analysis of hybrid systems. Theoretical Computer Science\u00a0138(1), 3\u201334 (1995)","journal-title":"Theoretical Computer Science"},{"key":"5_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/3-540-57318-6_30","volume-title":"Hybrid Systems","author":"R. Alur","year":"1993","unstructured":"Alur, R., Courcoubetis, C., Henzinger, T.A., Ho, P.-H.: Hybrid automata: An algorithmic approach to the specification and verification of hybrid systems. In: Grossman, R.L., Ravn, A.P., Rischel, H., Nerode, A. (eds.) HS 1991 and HS 1992. LNCS, vol.\u00a0736, pp. 209\u2013229. Springer, Heidelberg (1993)"},{"issue":"2","key":"5_CR3","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","volume":"126","author":"R. Alur","year":"1994","unstructured":"Alur, R., Dill, D.L.: A theory of timed automata. Theor. Comput. Sci.\u00a0126(2), 183\u2013235 (1994)","journal-title":"Theor. Comput. Sci."},{"issue":"4-5","key":"5_CR4","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/s10009-005-0215-8","volume":"8","author":"R. Bagnara","year":"2006","unstructured":"Bagnara, R., Hill, P.M., Zaffanella, E.: Widening operators for powerset domains. J. Software Tools for Technology Transfer\u00a08(4-5), 449\u2013466 (2006)","journal-title":"J. Software Tools for Technology Transfer"},{"key":"5_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/3-540-45789-5_17","volume-title":"Static Analysis","author":"R. Bagnara","year":"2002","unstructured":"Bagnara, R., Ricci, E., Zaffanella, E., Hill, P.M.: Possibly not closed convex polyhedra and the Parma Polyhedra Library. In: Hermenegildo, M.V., Puebla, G. (eds.) SAS 2002. LNCS, vol.\u00a02477, pp. 213\u2013229. Springer, Heidelberg (2002)"},{"key":"5_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/978-3-540-30080-9_7","volume-title":"Formal Methods for the Design of Real-Time Systems","author":"G. Behrmann","year":"2004","unstructured":"Behrmann, G., David, A., Larsen, K.G.: A tutorial on Uppaal. In: Bernardo, M., Corradini, F. (eds.) SFM-RT 2004. LNCS, vol.\u00a03185, pp. 200\u2013236. Springer, Heidelberg (2004)"},{"key":"5_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1007\/3-540-62718-9_12","volume-title":"Logic Program Synthesis and Transformation","author":"F. Benoy","year":"1997","unstructured":"Benoy, F., King, A.: Inferring argument size relationships with CLP(R). In: Gallagher, J.P. (ed.) LOPSTR 1996. LNCS, vol.\u00a01207, pp. 204\u2013223. Springer, Heidelberg (1997)"},{"key":"5_CR8","first-page":"303","volume-title":"ILPS","author":"C. Brzoska","year":"1995","unstructured":"Brzoska, C.: Temporal logic programming in dense time. In: ILPS, pp. 303\u2013317. MIT Press, Cambridge (1995)"},{"issue":"1\/2","key":"5_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/1000000001","volume":"1","author":"L.P. Carloni","year":"2006","unstructured":"Carloni, L.P., Passerone, R., Pinto, A., Sangiovanni-Vincentelli, A.L.: Languages and tools for hybrid systems design. Found. Trends Electron. Des. Autom.\u00a01(1\/2), 1\u2013193 (2006)","journal-title":"Found. Trends Electron. Des. Autom."},{"issue":"1","key":"5_CR10","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/S0743-1066(99)00006-0","volume":"41","author":"M. Codish","year":"1999","unstructured":"Codish, M., Taboch, C.: A semantic basic for the termination analysis of logic programs. The Journal of Logic Programming\u00a041(1), 103\u2013123 (1999)","journal-title":"The Journal of Logic Programming"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Cousot, P., Halbwachs, N.: Automatic discovery of linear restraints among variables of a program. In: Proceedings of the 5th Annual ACM Symposium on Principles of Programming Languages, pp. 84\u201396 (1978)","DOI":"10.1145\/512760.512770"},{"key":"5_CR12","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0743-1066(94)90050-7","volume":"18","author":"S. Debray","year":"1994","unstructured":"Debray, S., Ramakrishnan, R.: Abstract Interpretation of Logic Programs Using Magic Transformations. Journal of Logic Programming\u00a018, 149\u2013176 (1994)","journal-title":"Journal of Logic Programming"},{"key":"5_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/3-540-49059-0_16","volume-title":"Tools and Algorithms for the Construction of Analysis of Systems","author":"G. Delzanno","year":"1999","unstructured":"Delzanno, G., Podelski, A.: Model checking in CLP. In: Cleaveland, W.R. (ed.) TACAS 1999. LNCS, vol.\u00a01579, pp. 223\u2013239. Springer, Heidelberg (1999)"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Du, X., Ramakrishnan, C.R., Smolka, S.A.: Real-time verification techniques for untimed systems. Electr. Notes Theor. Comput. Sci.\u00a039(3) (2000)","DOI":"10.1016\/S1571-0661(05)01222-3"},{"key":"5_CR15","unstructured":"Fioravanti, F., Pettorossi, A., Proietti, M.: Verifying CTL properties of infinite-state systems by specializing constraint logic programs. In: Leuschel, M., Podelski, A., Ramakrishnan, C., Ultes-Nitsche, U. (eds.) Proceedings of the Second International Workshop on Verification and Computational Logic (VCL 2001), pp. 85\u201396 (2001); tech. Report DSSE-TR-2001-3, University of Southampton"},{"key":"5_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-540-27775-0_3","volume-title":"Logic Programming","author":"J.P. Gallagher","year":"2004","unstructured":"Gallagher, J.P., Henriksen, K.S.: Abstract domains based on regular types. In: Demoen, B., Lifschitz, V. (eds.) ICLP 2004. LNCS, vol.\u00a03132, pp. 27\u201342. Springer, Heidelberg (2004)"},{"key":"5_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/11562931_22","volume-title":"Logic Programming","author":"J.P. Gallagher","year":"2005","unstructured":"Gallagher, J.P., Henriksen, K.S., Banda, G.: Techniques for scaling up analyses based on pre-interpretations. In: Gabbrielli, M., Gupta, G. (eds.) ICLP 2005. LNCS, vol.\u00a03668, pp. 280\u2013296. Springer, Heidelberg (2005)"},{"key":"5_CR18","series-title":"Lecture Notes in Computer Science","first-page":"681","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"S. Genaim","year":"2001","unstructured":"Genaim, S., Codish, M.: Inferring termination conditions of logic programs by backwards analysis. In: Nieuwenhuis, R., Voronkov, A. (eds.) LPAR 2001. LNCS, vol.\u00a02250, pp. 681\u2013690. Springer, Heidelberg (2001)"},{"key":"5_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-540-74610-2_4","volume-title":"Logic Programming","author":"G. Gupta","year":"2007","unstructured":"Gupta, G., Bansal, A., Min, R., Simon, L., Mallya, A.: Coinductive logic programming and its applications. In: Dahl, V., Niemel\u00e4, I. (eds.) ICLP 2007. LNCS, vol.\u00a04670, pp. 27\u201344. Springer, Heidelberg (2007)"},{"key":"5_CR20","doi-asserted-by":"crossref","unstructured":"Gupta, G., Pontelli, E.: A constraint-based approach for specification and verification of real-time systems. In: IEEE Real-Time Systems Symposium, pp. 230\u2013239 (1997)","DOI":"10.1109\/REAL.1997.641285"},{"key":"5_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/3-540-58485-4_43","volume-title":"Static Analysis","author":"N. Halbwachs","year":"1994","unstructured":"Halbwachs, N., Proy, Y.E., Raymound, P.: Verification of linear hybrid systems by means of convex approximations. In: LeCharlier, B. (ed.) SAS 1994. LNCS, vol.\u00a0864, pp. 223\u2013237. Springer, Heidelberg (1994)"},{"key":"5_CR22","unstructured":"Henriksen, K.S., Banda, G., Gallagher, J.P.: Experiments with a convex polyhedral analysis tool for logic programs. In: Workshop on Logic Programming Environments, Porto (2007)"},{"key":"5_CR23","doi-asserted-by":"crossref","unstructured":"Henriksen, K.S., Gallagher, J.P.: Abstract interpretation of PIC programs through logic programming. In: Proceedings of SCAM 2006, Sixth IEEE International Workshop on Source Code Analysis and Manipulation (2006)","DOI":"10.1109\/SCAM.2006.1"},{"key":"5_CR24","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1109\/LICS.1996.561342","volume-title":"Proceedings, 11th Annual IEEE Symposium on Logic in Computer Science","author":"T.A. Henzinger","year":"1996","unstructured":"Henzinger, T.A.: The theory of hybrid automata. In: Clarke, E.M. (ed.) Proceedings, 11th Annual IEEE Symposium on Logic in Computer Science, pp. 278\u2013292. IEEE Computer Society Press, Los Alamitos (1996)"},{"key":"5_CR25","doi-asserted-by":"crossref","unstructured":"Jaffar, J., Maher, M.: Constraint Logic Programming: A Survey. Journal of Logic Programming 19\/20, 503\u2013581 (1994)","DOI":"10.1016\/0743-1066(94)90033-7"},{"key":"5_CR26","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1109\/REAL.2004.5","volume-title":"The 25th IEEE International Real-Time Systems Symposium","author":"J. Jaffar","year":"2004","unstructured":"Jaffar, J., Santosa, A.E., Voicu, R.: A CLP proof method for timed automata. In: Anderson, J., Sztipanovits, J. (eds.) The 25th IEEE International Real-Time Systems Symposium, pp. 175\u2013186. IEEE Computer Society, Los Alamitos (2004)"},{"key":"5_CR27","unstructured":"Katoen, J.-P.: Concepts, algorithms, and tools for model checking. A lecture notes of the course \u201cMechanised Validation of Parallel Systems\u201d for 1998\/99 at Friedrich-Alexander Universitat, Erlangen-Nurnberg, p. 195 (1999)"},{"key":"5_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1007\/978-3-540-88194-0_18","volume-title":"ICFEM 2008","author":"M. Leuschel","year":"2008","unstructured":"Leuschel, M., Fontaine, M.: Probing the depths of CSP-M: A new fdr-compliant validation tool. In: Liu, S., Maibaum, T., Araki, K. (eds.) ICFEM 2008. LNCS, vol.\u00a05256, pp. 278\u2013297. Springer, Heidelberg (2008)"},{"key":"5_CR29","doi-asserted-by":"crossref","unstructured":"Leuschel, M., J\u00f8rgensen, J.: Efficient specialisation in Prolog using the hand-written compiler generator LOGEN. Elec. Notes Theor. Comp. Sci.\u00a030(2) (1999)","DOI":"10.1016\/S1571-0661(05)80636-X"},{"key":"5_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/10720327_5","volume-title":"Logic-Based Program Synthesis and Transformation","author":"M. Leuschel","year":"2000","unstructured":"Leuschel, M., Massart, T.: Infinite state model checking by abstract interpretation and program specialisation. In: Bossi, A. (ed.) LOPSTR 1999. LNCS, vol.\u00a01817, pp. 63\u201382. Springer, Heidelberg (2000)"},{"key":"5_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/3-540-60939-3_8","volume-title":"Logic Program Synthesis and Transformation","author":"F. Mesnard","year":"1996","unstructured":"Mesnard, F.: Towards automatic control for CLP(\u03c7) programs. In: Proietti, M. (ed.) LOPSTR 1995. LNCS, vol.\u00a01048, pp. 106\u2013119. Springer, Heidelberg (1996)"},{"key":"5_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1007\/3-540-44957-4_26","volume-title":"Computational Logic - CL 2000","author":"U. Nilsson","year":"2000","unstructured":"Nilsson, U., L\u00fcbcke, J.: Constraint logic programming for local and symbolic model-checking. In: Palamidessi, C., Moniz Pereira, L., Lloyd, J.W., Dahl, V., Furbach, U., Kerber, M., Lau, K.-K., Sagiv, Y., Stuckey, P.J. (eds.) CL 2000. LNCS, vol.\u00a01861, pp. 384\u2013398. Springer, Heidelberg (2000)"},{"key":"5_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/3-540-45619-8_8","volume-title":"Logic Programming","author":"G. Pemmasani","year":"2002","unstructured":"Pemmasani, G., Ramakrishnan, C.R., Ramakrishnan, I.V.: Efficient real-time model checking using tabled logic programming and constraints. In: Stuckey, P.J. (ed.) ICLP 2002. LNCS, vol.\u00a02401, pp. 100\u2013114. Springer, Heidelberg (2002)"},{"key":"5_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/3-540-45013-0_8","volume-title":"Logic Based Program Synthesis and Transformation","author":"J.C. Peralta","year":"2003","unstructured":"Peralta, J.C., Gallagher, J.P.: Convex hull abstractions in specialization of CLP programs. In: Leuschel, M.A. (ed.) LOPSTR 2002. LNCS, vol.\u00a02664, pp. 90\u2013108. Springer, Heidelberg (2003)"},{"key":"5_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/978-3-540-45099-3_2","volume-title":"Static Analysis","author":"A. Podelski","year":"2000","unstructured":"Podelski, A.: Model checking as constraint solving. In: Palsberg, J. (ed.) SAS 2000. LNCS, vol.\u00a01824, pp. 22\u201337. Springer, Heidelberg (2000)"}],"container-title":["Lecture Notes in Computer Science","Logic-Based Program Synthesis and Transformation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00515-2_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,18]],"date-time":"2019-05-18T07:00:33Z","timestamp":1558162833000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00515-2_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642005145","9783642005152"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00515-2_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}