Verification by abstract interpretation, soundness and abstract induction

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Automatic program verification tools have to cope with programming language and machine semantics, undecidability, and mathematical induction, and so are all complex and imperfect. The ins and outs of automatic program verification will be discussed in light of the theory and practice of abstract interpretation [18, 19, 22].

Original languageEnglish (US)
Title of host publicationProceedings of the 17th International Symposium on Principles and Practice of Declarative Programming, PPDP 2015
PublisherAssociation for Computing Machinery, Inc
Pages1-4
Number of pages4
ISBN (Electronic)9781450335164
DOIs
StatePublished - Jul 14 2015
Event17th International Symposium on Principles and Practice of Declarative Programming, PPDP 2015 - Siena, Italy
Duration: Jul 14 2015Jul 16 2015

Publication series

NameProceedings of the 17th International Symposium on Principles and Practice of Declarative Programming, PPDP 2015

Other

Other17th International Symposium on Principles and Practice of Declarative Programming, PPDP 2015
CountryItaly
CitySiena
Period7/14/157/16/15

ASJC Scopus subject areas

  • Computer Science Applications
  • Software
  • Computational Theory and Mathematics

Fingerprint Dive into the research topics of 'Verification by abstract interpretation, soundness and abstract induction'. Together they form a unique fingerprint.

Cite this