Testing noninterference, quickly

Proceedings of the ACM SIGPLAN International Conference on Functional Programming, ICFP

Volumn , Issue , 2013, Pages 455-468

  Hriţcu, Cǎtǎlin ^a   Hughes, John ^b   Pierce, Benjamin C ^a   Spector Zabusky, Antal ^a   Vytiniotis, Dimitrios ^c   De Amorim, Arthur Azevedo ^a   Lampropoulos, Leonidas ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

^c MICROSOFT RESEARCH   (United States)

Author keywords

Abstract machine; Design; Dynamic information flow control; Noninterference; QuickCheck; Random testing; Security

Indexed keywords

DESIGN; FLOW CONTROL; TESTING;

ABSTRACT MACHINES; DYNAMIC INFORMATION; NONINTERFERENCE; QUICKCHECK; RANDOM TESTING; SECURITY;

FUNCTIONAL PROGRAMMING;

EID: 84887171895     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2500365.2500574     Document Type: Conference Paper

References (29)

1. T. H. Austin and C. Flanagan. Efficient purely-dynamic information flow analysis. In Workshop on Programming Languages and Analysis for Security (PLAS), PLAS, 2009.
2. A. Azevedo de Amorim, N. Collins, A. DeHon, D. Demange, C. Hriţcu, D. Pichardie, B. C. Pierce, R. Pollack, and A. Tolmach. A verified information-flow architecture. Under submission, July 2013.
3. S. Berghofer and T. Nipkow. Random testing in Isabelle/HOL. In 2nd International Conference on Software Engineering and Formal Methods (SEFM). 2004.
4. A. Birgisson, D. Hedin, and A. Sabelfeld. Boosting the permissiveness of dynamic information-flow tracking by testing. In 17th European Symposium on Research in Computer Security, ESORICS. 2012.
5. L. Bulwahn. The new Quickcheck for Isabelle - random, exhaustive and symbolic testing under one roof. In 2nd International Conference on Certified Programs and Proofs (CPP), Volume 7679 of Lecture Notes in Computer Science. 2012.
6. L. Bulwahn. Smart testing of functional programs in Isabelle. In 18th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR), Volume 7180 of Lecture Notes in Computer Science. 2012.
7. C. Cadar, D. Dunbar, and D. Engler. KLEE: unassisted and automatic generation of high-coverage tests for complex systems programs. In 8th USENIX conference on Operating systems design and implementation, OSDI. 2008.
8. C. Cadar, P. Godefroid, S. Khurshid, C. S. Pǎsǎreanu, K. Sen, N. Tillmann, and W. Visser. Symbolic execution for software testing in practice: preliminary assessment. In 33rd International Conference on Software Engineering, ICSE '11. 2011.
9. K. Claessen and J. Hughes. QuickCheck: a lightweight tool for random testing of Haskell programs. In 5th ACM SIGPLAN International Conference on Functional Programming, ICFP. 2000.
10. P. Dybjer, Q. Haiyan, and M. Takeyama. Combining testing and proving in dependent type theory. In 16th International Conference on Theorem Proving in Higher Order Logics (TPHOLs), Volume 2758 of Lecture Notes in Computer Science. 2003.
11. C. Eastlund. Doublecheck your theorems. In ACL2, 2009.
12. J. S. Fenton. Memoryless subsystems. The Computer Journal, 17(2): 143-147, 1974.
13. P. Godefroid, N. Klarlund, and K. Sen. DART: directed automated random testing. In ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI. 2005.
14. J. A. Goguen and J. Meseguer. Unwinding and inference control. In IEEE Symposium on Security and Privacy, 1984.
15. D. Hedin and A. Sabelfeld. Information-flow security for a core of JavaScript. In 25th IEEE Computer Security Foundations Symposium (CSF), CSF. 2012.
16. C. Hriţcu, M. Greenberg, B. Karel, B. C. Pierce, and G. Morrisett. All your IFCException are belong to us. In 34th IEEE Symposium on Security and Privacy. May 2013.
17. J. Hughes. QuickCheck testing for fun and profit. In 9th International Symposium on Practical Aspects of Declarative Languages (PADL), Volume 4354 of Lecture Notes in Computer Science. 2007.
18. C. Klein, J. Clements, C. Dimoulas, C. Eastlund, M. Felleisen, M. Flatt, J. A. McCarthy, J. Rafkind, S. Tobin-Hochstadt, and R. B. Findler. Run your research: On the effectiveness of lightweight mechanization. In Principles of Programming Languages (POPL), 2012.
19. C. Pacheco and M. D. Ernst. Randoop: feedback-directed random testing for Java. In 22nd ACM SIGPLAN Conference on Object-Oriented Programming Systems And Applications, OOPSLA. 2007.
20. H. Raju Chamarthi, P. Dillinger, M. Kaufmann, and P. Manolios. Integrating testing and interactive theorem proving. In ACL2, 2011.
21. J. Regehr, Y. Chen, P. Cuoq, E. Eide, C. Ellison, and X. Yang. Testcase reduction for C compiler bugs. In 33rd ACM SIGPLAN conference on Programming Language Design and Implementation. ACM, 2012.
22. A. Russo and A. Sabelfeld. Dynamic vs. static flow-sensitive security analysis. In 23rd Computer Security Foundations Symposium (CSF), CSF. 2010.
23. A. Sabelfeld and A. Myers. Language-based information-flow security. IEEE Journal on Selected Areas in Communications, 21(1): 5-19, January 2003.
24. A. Sabelfeld and A. Russo. From dynamic to static and back: Riding the roller coaster of information-flow control research. In Ershov Memorial Conference. 2009.
25. D. Stefan, A. Russo, J. C. Mitchell, and D. Mazières. Flexible dynamic information flow control in Haskell. In 4th Symposium on Haskell. 2011.
26. N. Williams, B. Marre, and P. Mouy. On-the-fly generation of K-path tests for C functions. In 19th IEEE International Conference on Automated Software Engineering, ASE. 2004.
27. X. Yang, Y. Chen, E. Eide, and J. Regehr. Finding and understanding bugs in C compilers. In ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI. 2011.
28. S. A. Zdancewic. Programming Languages for Information Security. PhD thesis, Cornell University, August 2002.
29. A. Zeller and R. Hildebrandt. Simplifying and isolating failure-inducing input. IEEE Transactions on Software Engineering, 28(2): 183-200, 2002.