CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

Testing noninterference, quickly

C. Hritcu ; L. Lampropoulos ; A. Spector-Zabusky ; A. A. De Amorim ; M. Denes ; John Hughes (Institutionen för data- och informationsteknik, Programvaruteknik (Chalmers)) ; B. C. Pierce ; D. Vytiniotis
Journal of Functional Programming (0956-7968). Vol. 26 (2016),
[Artikel, refereegranskad vetenskaplig]

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.

Nyckelord: secure information-flow, formal verification,



Denna post skapades 2016-05-27.
CPL Pubid: 237023

 

Läs direkt!


Länk till annan sajt (kan kräva inloggning)