@inproceedings{chadha_et_al:LIPIcs:2012:3887,
    Address = {Dagstuhl, Germany},
    Annote = {Keywords: quantitative information flow, recursive programs, program analysis, verification, computational complexity},
    Author = {Chadha, Rohit and Ummels, Michael},
    BookTitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012)},
    Editor = {D'Souza, Deepak and Kavitha, Telikepalli and Radhakrishnan, Jaikumar},
    File = {The Complexity of Quantitative Information Flow in Recursive Programs - Chadha, Ummels (0) (0) - a - a - d.pdf},
    ISBN = {978-3-939897-47-7},
    ISSN = {1868-8969},
    Pages = {534--545},
    Publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
    Series = {Leibniz International Proceedings in Informatics (LIPIcs)},
    Title = {{The Complexity of Quantitative Information Flow in Recursive Programs}},
    URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3887},
    Volume = {18},
    Year = {2012},
    bdsk-url-1 = {http://drops.dagstuhl.de/opus/volltexte/2012/3887},
    bdsk-url-2 = {http://dx.doi.org/10.4230/LIPIcs.FSTTCS.2012.534},
    date-added = {2013-01-28 15:24:48 +0000},
    date-modified = {2013-01-28 15:24:48 +0000},
    urn = {urn:nbn:de:0030-drops-38872},
    doi = {10.4230/LIPIcs.FSTTCS.2012.534}
}

@inproceedings{chadha_et_al:LIPIcs:2012:3887, Address = {Dagstuhl, Germany}, Annote = {Keywords: quantitative information flow, recursive programs, program analysis, verification, computational complexity}, Author = {Chadha, Rohit and Ummels, Michael}, BookTitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012)}, Editor = {D'Souza, Deepak and Kavitha, Telikepalli and Radhakrishnan, Jaikumar}, File = {The Complexity of Quantitative Information Flow in Recursive Programs - Chadha, Ummels (0) (0) - a - a - d.pdf}, ISBN = {978-3-939897-47-7}, ISSN = {1868-8969}, Pages = {534--545}, Publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}, Series = {Leibniz International Proceedings in Informatics (LIPIcs)}, Title = {{The Complexity of Quantitative Information Flow in Recursive Programs}}, URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3887}, Volume = {18}, Year = {2012}, bdsk-url-1 = {http://drops.dagstuhl.de/opus/volltexte/2012/3887}, bdsk-url-2 = {http://dx.doi.org/10.4230/LIPIcs.FSTTCS.2012.534}, date-added = {2013-01-28 15:24:48 +0000}, date-modified = {2013-01-28 15:24:48 +0000}, urn = {urn:nbn:de:0030-drops-38872}, doi = {10.4230/LIPIcs.FSTTCS.2012.534} }