Skip to main content
×
×
Home

Introduction to the special issue on computational logic for verification

  • GERMÁN VIDAL (a1)
Extract

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.

    • Send article to Kindle

      To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

      Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

      Find out more about the Kindle Personal Document Service.

      Introduction to the special issue on computational logic for verification
      Available formats
      ×
      Send article to Dropbox

      To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

      Introduction to the special issue on computational logic for verification
      Available formats
      ×
      Send article to Google Drive

      To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

      Introduction to the special issue on computational logic for verification
      Available formats
      ×
Copyright
References
Hide All
Bjørner, N., Gurfinkel, A., McMillan, K. L. and Rybalchenko, A. 2015. Horn clause solvers for program verification. In Fields of Logic and Computation II – Essays Dedicated to Yuri Gurevich on the Occasion of His 75th Birthday, Beklemishev, L. D., Blass, A., Dershowitz, N., Finkbeiner, B. and Schulte, W., Eds. Lecture Notes in Computer Science, vol. 9300. Springer, Springer International Publishing Switzerland, 2451.
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), Knudsen, J. L., Ed. Lecture Notes in Computer Science, vol. 2072. Springer, Verlag Berlin Heidelberg, 2–27.
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., Ábrahám and Havelund, K., Eds. Lecture Notes in Computer Science, vol. 8413. Springer, 568–574.
de Moura, L. M. and Bjørner, 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), Ramakrishnan, C. R. and Rehof, J., Eds. Lecture Notes in Computer Science, vol. 4963. Springer, Verlag Berlin Heidelberg, 337–340.
Esparza, J., Kiefer, S. and Luttenberger, M. 2010. Newtonian program analysis. Journal of the ACM 57, 6, 33:133:47.
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, Martín-Vide, C., Sierra-Rodríguez, J. L., and Truthe, B., Eds. Lecture Notes in Computer Science, vol. 8370. Springer, International Publishing Switzerland, 1–13.
Fages, F., Ruet, P. and Soliman, S. 2001. Linear concurrent constraint programming: Operational and phase semantics. Information and Computation 165, 1, 1441.
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
Gange, G., Navas, J. A., Schachte, P., Søndergaard, H. and Stuckey, P. J. 2015. Horn clauses as an intermediate representation for program analysis and transformation. Theory and Practice of Logic Programming 15, 4–5, 526542.
Jaffar, J. and Maher, M. J. 1994. Constraint logic programming: A survey. Journal of Logic Programming 19/20, 503581.
Méndez-Lojo, M., Navas, J. A. and Hermenegildo, M. V. 2008. A flexible, (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.
Pettorossi, A. and Proietti, M. 1994. Transformation of logic programs: Foundations and techniques. Journal of Logic Programming 19/20, 261320.
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ík and Majumdar, R., Eds. ACM, New York, NY, USA, 663–677.
Saraswat, V. A. 1993. Concurrent Constraint Programming. ACM Doctoral dissertation awards. MIT Press, Cambridge, MA, USA.
Shapiro, E. Y. 1989. The family of concurrent logic programming languages. ACM Computing Surveys 21, 3, 413510.
Tamaki, H. and Sato, T. 1984. Unfold/fold transformation of logic programs. In Proc. of 2nd International Logic Programming Conference (ICLP'84), S., Tärnlund, Ed. Uppsala University, Uppsala, Sweden, 127–138.
Watt, D. 2009. Programming XC on XMOS Devices. XMOS Limited. Antony Row, Chippenham, UK.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Theory and Practice of Logic Programming
  • ISSN: 1471-0684
  • EISSN: 1475-3081
  • URL: /core/journals/theory-and-practice-of-logic-programming
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed