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

Testing noninterference, quickly

Catalin Hritcu ; John Hughes (Institutionen för data- och informationsteknik, Programvaruteknik (Chalmers)) ; Benjamin C. Pierce ; Antal Spector-Zabusky ; Dimitrios Vytiniotis ; Arthur Azevedo de Amorim ; Leonidas Lampropoulos
2013 18th ACM SIGPLAN International Conference on Functional Programming, ICFP 2013, Boston, United States, 25-27 September 2013 (0362-1340). Vol. 48 (2013), 9, p. 455-468.
[Konferensbidrag, refereegranskat]

Information-flow control mechanisms are difficult to design and labor intensive to prove correct. To reduce the time wasted on proof attempts doomed to fail 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 a simple information-flow abstract machine. We find that both sophisticated strategies for generating well-distributed random programs and readily falsifiable formulations of noninterference properties are critically important. 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 all these bugs.

Den här publikationen ingår i följande styrkeområden:

Läs mer om Chalmers styrkeområden  

Denna post skapades 2013-11-04. Senast ändrad 2017-09-14.
CPL Pubid: 186075


Läs direkt!

Lokal fulltext (fritt tillgänglig)

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