Post-Hoc Separation Policy Analysis with Graph Algorithms

• ABSTRACT:
  
  We present graph algorithms for analyzing potential information flow in systems, modeled as labeled directed graphs, particularly focusing on discovering and analyzing separation policies that require minimal changes to an existing system. We have implemented the algorithms in an open-source publicly-available tool.

• BIBTEX:
  

  @InProceedings{pike-infoflow,
    author =    {Lee Pike},
    title =     {Post-Hoc Separation Policy Analysis with Graph Algorithms},
    booktitle = {Workshop on Foundations of Computer Security (FCS'09).  Affiliated with Logic in Computer Science (LICS)},
    year =      {2009},
    month =     {August},
    note =      {Participants' proceedings.  Paper available at \url{https://leepike.github.io/pub_pages/infoflow.html}},
  }
  

• PAPER DOWNLOAD: infoFlow.pdf

• SLIDES DOWNLOAD: pike-infoflow.pdf

• SOURCE CODE: Graph Abstractor Toolkit (GAT) gat.tgz
  The tool is released under a BSD3 license and is released as a collection of Haskell source files. You will need to compile it using GHC. At the command line, execute
  

   > ghc --make -O Main

  (-O turns on optimizations), then you can execute the program with
  

   > ./main

  This package will soon be officially released on Hackage.