{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T11:02:31Z","timestamp":1740135751858,"version":"3.37.3"},"reference-count":18,"publisher":"Cambridge University Press (CUP)","issue":"2","license":[{"start":{"date-parts":[[2018,5,11]],"date-time":"2018-05-11T00:00:00Z","timestamp":1525996800000},"content-version":"unspecified","delay-in-days":71,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory and Practice of Logic Programming"],"published-print":{"date-parts":[[2018,3]]},"abstract":"<jats:p>Logic underlies many fundamental techniques in computer science. It helps us to rigorously formalize these techniques and prove them correct. The last decade has witnessed a growing interest in the use of computational logic methods for program verification. It has attracted researchers from both computational logic and program verification communities, giving rise to a fruitful exchange of ideas and experiences.<\/jats:p>","DOI":"10.1017\/s1471068418000029","type":"journal-article","created":{"date-parts":[[2018,5,11]],"date-time":"2018-05-11T07:57:51Z","timestamp":1526025471000},"page":"122-125","source":"Crossref","is-referenced-by-count":0,"title":["Introduction to the special issue on computational logic for verification"],"prefix":"10.1017","volume":"18","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1857-6951","authenticated-orcid":false,"given":"GERM\u00c1N","family":"VIDAL","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2018,5,11]]},"reference":[{"volume-title":"Programming XC on XMOS Devices","year":"2009","author":"Watt","key":"S1471068418000029_ref17"},{"key":"S1471068418000029_ref16","unstructured":"Tamaki H. and Sato T. 1984. Unfold\/fold transformation of logic programs. In Proc. of 2nd International Logic Programming Conference (ICLP'84), S. T\u00e4rnlund , Ed. Uppsala University, Uppsala, Sweden, 127\u2013138."},{"key":"S1471068418000029_ref15","doi-asserted-by":"publisher","DOI":"10.1145\/72551.72555"},{"key":"S1471068418000029_ref7","doi-asserted-by":"publisher","DOI":"10.1006\/inco.2000.3002"},{"key":"S1471068418000029_ref3","doi-asserted-by":"crossref","unstructured":"De Angelis E. , Fioravanti F. , Pettorossi A. and Proietti M. 2014. VeriMAP: A tool for verifying programs through transformations. In Proc. of 20th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2014), E. \u00c1brah\u00e1m and K. Havelund , Eds. Lecture Notes in Computer Science, vol. 8413. Springer, 568\u2013574.","DOI":"10.1007\/978-3-642-54862-8_47"},{"key":"S1471068418000029_ref10","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(94)90033-7"},{"key":"S1471068418000029_ref4","doi-asserted-by":"crossref","unstructured":"de Moura L. M. and Bj\u00f8rner N. 2008. Z3: an efficient SMT solver. In Proc. of 14th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2008), C. R. Ramakrishnan and J. Rehof , Eds. Lecture Notes in Computer Science, vol. 4963. Springer, Verlag Berlin Heidelberg, 337\u2013340.","DOI":"10.1007\/978-3-540-78800-3_24"},{"key":"S1471068418000029_ref14","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/2086.001.0001","volume-title":"Concurrent Constraint Programming","author":"Saraswat","year":"1993"},{"key":"#cr-split#-S1471068418000029_ref11.1","unstructured":"4. M??ndez-Lojo M., Navas J. A. and Hermenegildo M. V. 2008. A flexible,"},{"key":"#cr-split#-S1471068418000029_ref11.2","unstructured":"5. (C)LP-based approach to the analysis of object-oriented programs. In Proc. of 17th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2007). Revised Selected Papers, A. King, Ed. Lecture Notes in Computer Science, vol. 4915. Springer, Verlag Berlin Heidelberg, 154-168."},{"key":"S1471068418000029_ref2","doi-asserted-by":"crossref","unstructured":"Boyland J. , Noble J. and Retert W. 2001. Capabilities for sharing: A generalisation of uniqueness and read-only. In Proc. of 15th European Conference on Object-Oriented Programming (ECOOP 2001), J. L. Knudsen , Ed. Lecture Notes in Computer Science, vol. 2072. Springer, Verlag Berlin Heidelberg, 2\u201327.","DOI":"10.1007\/3-540-45337-7_2"},{"key":"S1471068418000029_ref5","doi-asserted-by":"publisher","DOI":"10.1145\/1857914.1857917"},{"key":"S1471068418000029_ref12","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(94)90028-0"},{"key":"S1471068418000029_ref1","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1007\/978-3-319-23534-9_2","volume-title":"Fields of Logic and Computation II \u2013 Essays Dedicated to Yuri Gurevich on the Occasion of His 75th Birthday","author":"Bj\u00f8rner","year":"2015"},{"key":"S1471068418000029_ref6","doi-asserted-by":"crossref","unstructured":"Esparza J. , Luttenberger M. and Schlund M. 2014. A brief history of Strahler numbers. In Proc. of 8th International Conference Language and Automata Theory and Applications (LATA 2014), A. Dediu , C. Mart\u00edn-Vide , J. L. Sierra-Rodr\u00edguez , and B. Truthe , Eds. Lecture Notes in Computer Science, vol. 8370. Springer, International Publishing Switzerland, 1\u201313.","DOI":"10.1007\/978-3-319-04921-2_1"},{"key":"S1471068418000029_ref8","unstructured":"Gallagher J. P. and Kafle B. 2014. Analysis and transformation tools for constrained Horn clause verification. In Proc. of 30th International Conference on Logic Programming (Technical Communications), ICLP 2014. Available from http:\/\/arxiv.org\/abs\/1405.3883"},{"key":"S1471068418000029_ref9","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068415000204"},{"key":"S1471068418000029_ref13","doi-asserted-by":"crossref","unstructured":"Reps T. W. , Turetsky E. and Prabhu P. 2016. Newtonian program analysis via tensor product. In Proc. of 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL 2016), R. Bod\u00edk and R. Majumdar , Eds. ACM, New York, NY, USA, 663\u2013677.","DOI":"10.1145\/2837614.2837659"}],"container-title":["Theory and Practice of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1471068418000029","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,17]],"date-time":"2019-10-17T18:50:29Z","timestamp":1571338229000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068418000029\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,3]]}},"alternative-id":["S1471068418000029"],"URL":"https:\/\/doi.org\/10.1017\/s1471068418000029","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"type":"print","value":"1471-0684"},{"type":"electronic","value":"1475-3081"}],"subject":[],"published":{"date-parts":[[2018,3]]}}}