The Complexity of Quantitative Information Flow in Recursive Programs
From MaRDI portal
Publication:2957526
DOI10.4230/LIPICS.FSTTCS.2012.534zbMath1354.68055OpenAlexW1556502211MaRDI QIDQ2957526
Publication date: 26 January 2017
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2012/3887/pdf/48.pdf
Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (1)
This page was built for publication: The Complexity of Quantitative Information Flow in Recursive Programs