{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:45:08Z","timestamp":1725893108493},"publisher-location":"Berlin, Heidelberg","reference-count":36,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642322105"},{"type":"electronic","value":"9783642322112"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32211-2_8","type":"book-chapter","created":{"date-parts":[[2012,7,20]],"date-time":"2012-07-20T20:27:23Z","timestamp":1342816043000},"page":"106-122","source":"Crossref","is-referenced-by-count":0,"title":["Using Real Relaxations during Program Specialization"],"prefix":"10.1007","author":[{"given":"Fabio","family":"Fioravanti","sequence":"first","affiliation":[]},{"given":"Alberto","family":"Pettorossi","sequence":"additional","affiliation":[]},{"given":"Maurizio","family":"Proietti","sequence":"additional","affiliation":[]},{"given":"Valerio","family":"Senni","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/3-540-44585-4_34","volume-title":"Computer Aided Verification","author":"A. Annichini","year":"2001","unstructured":"Annichini, A., Bouajjani, A., Sighireanu, M.: TReX: A Tool for Reachability Analysis of Complex Systems. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol.\u00a02102, pp. 368\u2013372. Springer, Heidelberg (2001)"},{"key":"8_CR2","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/0743-1066(94)90024-8","volume":"19","author":"K.R. Apt","year":"1994","unstructured":"Apt, K.R., Bol, R.N.: Logic programming and negation: A survey. Journal of Logic Programming\u00a019\/20, 9\u201371 (1994)","journal-title":"Journal of Logic Programming"},{"issue":"1-2","key":"8_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.M., Zaffanella, E.: The Parma Polyhedra Library: Toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems. Science of Computer Programming\u00a072(1-2), 3\u201321 (2008)","journal-title":"Science of Computer Programming"},{"key":"8_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-642-00515-2_5","volume-title":"Logic-Based Program Synthesis and Transformation","author":"G. Banda","year":"2009","unstructured":"Banda, G., Gallagher, J.P.: Analysis of Linear Hybrid Systems in CLP. In: Hanus, M. (ed.) LOPSTR 2008. LNCS, vol.\u00a05438, pp. 55\u201370. Springer, Heidelberg (2009)"},{"key":"8_CR5","series-title":"LNCS(LNAI)","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-642-17511-4_3","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"G. Banda","year":"2010","unstructured":"Banda, G., Gallagher, J.P.: Constraint-Based Abstract Semantics for Temporal Logic: A Direct Approach to Design and Implementation. In: Clarke, E.M., Voronkov, A. (eds.) LPAR-16 2010. LNCS(LNAI), vol.\u00a06355, pp. 27\u201345. Springer, Heidelberg (2010)"},{"issue":"5","key":"8_CR6","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/s10009-008-0064-3","volume":"10","author":"S. Bardin","year":"2008","unstructured":"Bardin, S., Finkel, A., Leroux, J., Petrucci, L.: FAST: Acceleration from theory to practice. International Journal on Software Tools for Technology Transfer\u00a010(5), 401\u2013424 (2008)","journal-title":"International Journal on Software Tools for Technology Transfer"},{"key":"8_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/3-540-48320-9_14","volume-title":"CONCUR\u201999. Concurrency Theory","author":"B. B\u00e9rard","year":"1999","unstructured":"B\u00e9rard, B., Fribourg, L.: Reachability Analysis of (Timed) Petri Nets Using Real Arithmetic. In: Baeten, J.C.M., Mauw, S. (eds.) CONCUR 1999. LNCS, vol.\u00a01664, pp. 178\u2013193. Springer, Heidelberg (1999)"},{"doi-asserted-by":"crossref","unstructured":"Chen, W., Warren, D.S.: Tabled evaluation with delaying for general logic programs. JACM\u00a043(1) (1996)","key":"8_CR8","DOI":"10.1145\/227595.227597"},{"unstructured":"Clarke, E.M., Grumberg, O., Peled, D.: Model Checking. MIT Press (1999)","key":"8_CR9"},{"doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation: A unified lattice model for static analysis of programs by construction of approximation of fixpoints. In: Proceedings of the 4th ACM-SIGPLAN POPL 1977, pp. 238\u2013252. ACM Press (1977)","key":"8_CR10","DOI":"10.1145\/512950.512973"},{"doi-asserted-by":"crossref","unstructured":"Cousot, P., Halbwachs, N.: Automatic discovery of linear restraints among variables of a program. In: Proceedings of the Fifth ACM Symposium on Principles of Programming Languages (POPL 1978), pp. 84\u201396. ACM Press (1978)","key":"8_CR11","DOI":"10.1145\/512760.512770"},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/978-3-540-39866-0_17","volume-title":"Perspectives of System Informatics","author":"S.-J. Craig","year":"2003","unstructured":"Craig, S.-J., Leuschel, M.: A Compiler Generator for Constraint Logic Programs. In: Broy, M., Zamulin, A.V. (eds.) PSI 2003. LNCS, vol.\u00a02890, pp. 148\u2013161. Springer, Heidelberg (2003)"},{"issue":"3","key":"8_CR13","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1007\/s100090100049","volume":"3","author":"G. Delzanno","year":"2001","unstructured":"Delzanno, G., Podelski, A.: Constraint-based deductive model checking. International Journal on Software Tools for Technology Transfer\u00a03(3), 250\u2013270 (2001)","journal-title":"International Journal on Software Tools for Technology Transfer"},{"key":"8_CR14","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/0304-3975(95)00148-4","volume":"166","author":"S. Etalle","year":"1996","unstructured":"Etalle, S., Gabbrielli, M.: Transformations of CLP modules. Theoretical Computer Science\u00a0166, 101\u2013146 (1996)","journal-title":"Theoretical Computer Science"},{"unstructured":"Fioravanti, F.: Transformation of Constraint Logic Programs for Software Specialization and Verification. PhD thesis, Universit\u00e0 di Roma \u201cLa Sapienza\u201d, Italy (2002)","key":"8_CR15"},{"key":"8_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/3-540-45142-0_8","volume-title":"Logic Based Program Synthesis and Transformation","author":"F. Fioravanti","year":"2001","unstructured":"Fioravanti, F., Pettorossi, A., Proietti, M.: Automated Strategies for Specializing Constraint Logic Programs. In: Lau, K.-K. (ed.) LOPSTR 2000. LNCS, vol.\u00a02042, pp. 125\u2013146. Springer, Heidelberg (2001)"},{"unstructured":"Fioravanti, F., Pettorossi, A., Proietti, M.: Verifying CTL properties of infinite state systems by specializing constraint logic programs. In: Proceedings of the ACM SIGPLAN Workshop on Verification and Computational Logic, VCL 2001, Florence, Italy, Technical Report DSSE-TR-2001-3, pp. 85\u201396. University of Southampton, UK (2001)","key":"8_CR17"},{"key":"8_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/978-3-540-25951-0_10","volume-title":"Program Development in Computational Logic","author":"F. Fioravanti","year":"2004","unstructured":"Fioravanti, F., Pettorossi, A., Proietti, M.: Transformation Rules for Locally Stratified Constraint Logic Programs. In: Bruynooghe, M., Lau, K.-K. (eds.) Program Development in CL. LNCS, vol.\u00a03049, pp. 291\u2013339. Springer, Heidelberg (2004)"},{"key":"8_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/978-3-642-20551-4_11","volume-title":"Logic-Based Program Synthesis and Transformation","author":"F. Fioravanti","year":"2011","unstructured":"Fioravanti, F., Pettorossi, A., Proietti, M., Senni, V.: Program Specialization for Verifying Infinite State Systems: An Experimental Evaluation. In: Alpuente, M. (ed.) LOPSTR 2010. LNCS, vol.\u00a06564, pp. 164\u2013183. Springer, Heidelberg (2011)"},{"key":"8_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/10720327_3","volume-title":"Logic-Based Program Synthesis and Transformation","author":"L. Fribourg","year":"2000","unstructured":"Fribourg, L.: Constraint Logic Programming Applied to Model Checking. In: Bossi, A. (ed.) LOPSTR 1999. LNCS, vol.\u00a01817, pp. 30\u201341. Springer, Heidelberg (2000)"},{"issue":"3\/4","key":"8_CR21","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1023\/A:1009747629591","volume":"2","author":"L. Fribourg","year":"1997","unstructured":"Fribourg, L., Ols\u00e9n, H.: A decompositional approach for computing least fixed-points of Datalog programs with Z-counters. Constraints\u00a02(3\/4), 305\u2013335 (1997)","journal-title":"Constraints"},{"key":"8_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/3-540-60630-0_5","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"J.G. Henriksen","year":"1995","unstructured":"Henriksen, J.G., Jensen, J.L., J\u00f8rgensen, M.E., Klarlund, N., Paige, R., Rauhe, T., Sandholm, A.: Mona: Monadic Second-Order Logic in Practice. In: Brinksma, E., Steffen, B., Cleaveland, W.R., Larsen, K.G., Margaria, T. (eds.) TACAS 1995. LNCS, vol.\u00a01019, pp. 89\u2013110. Springer, Heidelberg (1995)"},{"doi-asserted-by":"crossref","unstructured":"Hickey, T.J., Smith, D.A.: Towards the partial evaluation of CLP languages. In: Proceedings of the 1991 ACM Symposium PEPM 1991, New Haven, CT, USA. SIGPLAN Notices, vol.\u00a026(9), pp. 43\u201351. ACM Press (1991)","key":"8_CR23","DOI":"10.1145\/115866.115871"},{"unstructured":"Jones, N.D., Gomard, C.K., Sestoft, P.: Partial Evaluation and Automatic Program Generation. Prentice Hall (1993)","key":"8_CR24"},{"unstructured":"LASH, homepage: http:\/\/www.montefiore.ulg.ac.be\/~boigelot\/research\/lash","key":"8_CR25"},{"doi-asserted-by":"crossref","unstructured":"Leroux, J.: Vector addition system reachability problem: a short self-contained proof. In: Proceedings of the 38th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2011, Austin, TX, USA, January 26-28, pp. 307\u2013316. ACM (2011)","key":"8_CR26","DOI":"10.1145\/1926385.1926421"},{"key":"8_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/11562948_36","volume-title":"Automated Technology for Verification and Analysis","author":"J. Leroux","year":"2005","unstructured":"Leroux, J., Sutre, G.: Flat Counter Automata Almost Everywhere! In: Peled, D.A., Tsay, Y.-K. (eds.) ATVA 2005. LNCS, vol.\u00a03707, pp. 489\u2013503. Springer, Heidelberg (2005)"},{"issue":"4&5","key":"8_CR28","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1017\/S147106840200145X","volume":"2","author":"M. Leuschel","year":"2002","unstructured":"Leuschel, M., Bruynooghe, M.: Logic program specialisation through partial deduction: Control issues. Theory and Practice of Logic Programming\u00a02(4&5), 461\u2013515 (2002)","journal-title":"Theory and Practice of Logic Programming"},{"key":"8_CR29","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/3-540-44957-4_7","volume-title":"Computational Logic - CL 2000","author":"M. Leuschel","year":"2000","unstructured":"Leuschel, M., Lehmann, H.: Coverability of Reset Petri Nets and Other Well-Structured Transition Systems by Partial Deduction. 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 (LNAI), vol.\u00a01861, pp. 101\u2013115. Springer, Heidelberg (2000)"},{"key":"8_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","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 Specialization. In: Bossi, A. (ed.) LOPSTR 1999. LNCS, vol.\u00a01817, pp. 62\u201381. Springer, Heidelberg (2000)"},{"key":"8_CR31","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. (ed.) LOPSTR 2002. LNCS, vol.\u00a02664, pp. 90\u2013108. Springer, Heidelberg (2003)"},{"issue":"8","key":"8_CR32","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1145\/135226.135233","volume":"35","author":"W. Pugh","year":"1992","unstructured":"Pugh, W.: A practical algorithm for exact array dependence analysis. Communications of the ACM\u00a035(8), 102\u2013114 (1992)","journal-title":"Communications of the ACM"},{"unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. John Wiley & Sons (1986)","key":"8_CR33"},{"key":"8_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/978-3-642-00515-2_12","volume-title":"Logic-Based Program Synthesis and Transformation","author":"H. Seki","year":"2009","unstructured":"Seki, H.: On Negative Unfolding in the Answer Set Semantics. In: Hanus, M. (ed.) LOPSTR 2008. LNCS, vol.\u00a05438, pp. 168\u2013184. Springer, Heidelberg (2009)"},{"key":"8_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/3-540-61286-6_135","volume-title":"Foundations of Intelligent Systems","author":"A. Wrzos-Kaminska","year":"1996","unstructured":"Wrzos-Kaminska, A.: Partial Evaluation in Constraint Logic Programming. In: Michalewicz, M., Ra\u015b, Z.W. (eds.) ISMIS 1996. LNCS, vol.\u00a01079, pp. 98\u2013107. Springer, Heidelberg (1996)"},{"issue":"3","key":"8_CR36","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/s10703-009-0081-1","volume":"35","author":"T. Yavuz-Kahveci","year":"2009","unstructured":"Yavuz-Kahveci, T., Bultan, T.: Action Language Verifier: An infinite-state model checker for reactive software specifications. Formal Methods in System Design\u00a035(3), 325\u2013367 (2009)","journal-title":"Formal Methods in System Design"}],"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-32211-2_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T07:57:28Z","timestamp":1620115048000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32211-2_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642322105","9783642322112"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32211-2_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}