Testing Noninterference, Quickly

Abstract : Information-flow control mechanisms are difficult both to design and to prove correct. To reduce the time wasted on doomed proof attempts due to broken definitions, we advocate modern random testing techniques for finding counterexamples during the design process. We show how to use QuickCheck, a property-based random-testing tool, to guide the design of increasingly complex information-flow abstract machines, leading up to a sophisticated register machine with a novel and highly permissive flow-sensitive dynamic enforcement mechanism that is sound in the presence of first-class public labels. We find that both sophisticated strategies for generating well-distributed random programs and readily falsifiable formulations of noninterference properties are critically important for efficient testing. We propose several approaches and evaluate their effectiveness on a collection of injected bugs of varying subtlety. We also present an effective technique for shrinking large counterexamples to minimal, easily comprehensible ones. Taken together, our best methods enable us to quickly and automatically generate simple counterexamples for more than 45 bugs. Moreover, we show how testing guides the discovery of the sophisticated invariants needed for the noninterference proof of our most complex machine.
Type de document :
Article dans une revue
Journal of Functional Programming (JFP); Special issue for ICFP 2013, 2016, 26, e4 (62 p.). 〈10.1017/S0956796816000058〉
Liste complète des métadonnées

Contributeur : Cătălin Hriţcu <>
Soumis le : lundi 2 janvier 2017 - 21:33:01
Dernière modification le : jeudi 29 novembre 2018 - 14:30:16

Lien texte intégral




Cătălin Hriţcu, Leonidas Lampropoulos, Antal Spector-Zabusky, Arthur Azevedo Amorim, Maxime Dénès, et al.. Testing Noninterference, Quickly. Journal of Functional Programming (JFP); Special issue for ICFP 2013, 2016, 26, e4 (62 p.). 〈10.1017/S0956796816000058〉. 〈hal-01424796〉



Consultations de la notice