Model checking graph representation of precise boolean inter-procedural flow analysis

Abstract

A new representation for inter-procedural analysis is presented. The representation only uses regular graph theory with guarded edges and variables for easy integration with model checkers but is limited to binary lattice inter-procedural analysis only.

BibTeX

@inproceedings{Letarte:ASE10,
  author    = {Dominic Letarte},
  title     = {Model checking graph representation of precise boolean inter-procedural flow analysis},
  booktitle = {ASE},
  pages     = {511--516},
  publisher = {{ACM}},
  year      = {2010},
}

Model checking graph representation of precise boolean inter-procedural flow analysis

Abstract

Related papers