Summary-Based Inter-Procedural Analysis via Modular Trace Refinement. Cassez, F., Müller, C., & Burnett, K. In 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, FSTTCS 2014, December 15-17, 2014, New Delhi, India, pages 545–556, 2014.
Summary-Based Inter-Procedural Analysis via Modular Trace Refinement [link]Link  doi  abstract   bibtex   
We propose a generalisation of trace refinement for the verification of inter-procedural programs. Our method is a top-down modular, summary-based approach, and analyses inter-procedural programs by building function summaries on-demand and improving the summaries each time a function is analysed. Our method is sound, and complete relative to the existence of a modular Hoare proof for a non-recursive program. We have implemented a prototype analyser that demonstrates the main features of our approach and yields promising results.
@inproceedings{fsttcs-14,
  author    = {Franck Cassez and
               Christian Müller and
               Karla Burnett},
  title     = {Summary-Based Inter-Procedural Analysis via Modular Trace Refinement},
  booktitle = {34th International Conference on Foundation of Software Technology
               and Theoretical Computer Science, {FSTTCS} 2014, December 15-17, 2014,
               New Delhi, India},
  pages     = {545--556},
  year      = {2014},
  mywebpage = {soft-verif},
  category = {Software verification},
  keywords = {trace refinement, software verification, Hoare logic},
  url_link       = {http://dx.doi.org/10.4230/LIPIcs.FSTTCS.2014.545},
  doi       = {10.4230/LIPIcs.FSTTCS.2014.545},
  abstract = {We propose a generalisation of trace refinement for the verification of inter-procedural programs.
  Our method is a top-down modular, summary-based approach, and analyses inter-procedural programs by building function summaries on-demand
  and improving the summaries each time a function is analysed. Our method is sound, and complete relative to the existence of a
  modular Hoare proof for a non-recursive program. We have implemented a prototype analyser that demonstrates the
  main features of our approach and yields promising results.
  },
  Type = {B - International Conferences},
}

Downloads: 0