Probabilistic noninterference for multi-threaded programs A Sabelfeld, D Sands Proceedings 13th IEEE Computer Security Foundations Workshop. CSFW-13, 200-214, 2000 | 411 | 2000 |
Declassification: Dimensions and principles A Sabelfeld, D Sands Journal of Computer Security 17 (5), 517-548, 2009 | 373 | 2009 |
Dimensions and principles of declassification A Sabelfeld, D Sands 18th IEEE Computer Security Foundations Workshop (CSFW'05), 255-269, 2005 | 342 | 2005 |
On flow-sensitive security types S Hunt, D Sands POPL'06, Proceedings of the 33rd Annual. ACM SIGPLAN - SIGACT. Symposium. on …, 2006 | 321 | 2006 |
A theorem proving approach to analysis of secure information flow Á Darvas, R Hähnle, D Sands Security in Pervasive Computing: Second International Conference, SPC 2005 …, 2005 | 291 | 2005 |
Termination-insensitive noninterference leaks more than just a bit S Hunt, A Askarov, A Sabelfeld, D Sands Proc. 13th European Symposium on Research in Computer Security (ESORICS'08) 5283, 2008 | 256* | 2008 |
A per model of secure information flow in sequential programs A Sabelfeld, D Sands Higher-order and symbolic computation 14, 59-91, 2001 | 247 | 2001 |
Lightweight self-protecting JavaScript PH Phung, D Sands, A Chudnov Proceedings of the 4th International Symposium on Information, Computer, and …, 2009 | 195 | 2009 |
Controlled declassification based on intransitive noninterference H Mantel, D Sands Proc. Asian Symp. on Programming Languages and Systems, LNCS, 129-145, 2004 | 150 | 2004 |
Differential privacy: Now it's getting personal H Ebadi, D Sands, G Schneider POPL'15: 42nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming …, 2015 | 142 | 2015 |
Total correctness by local improvement in the transformation of functional programs D Sands ACM Transactions on Programming Languages and Systems (TOPLAS) 18 (2), 175-234, 1996 | 135 | 1996 |
A per model of secure information flow in sequential programs A Sabelfeld, D Sands ESOP '99 Proceedings of the 8th European Symposium on Programming Languages …, 1999 | 127 | 1999 |
Improvement in a lazy context: An operational theory for call-by-need A Moran, D Sands Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of …, 1999 | 120 | 1999 |
Paralocks: role-based information flow control and beyond N Broberg, D Sands POPL '10 Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on …, 2010 | 118 | 2010 |
Observable sharing for functional circuit description K Claessen, D Sands Annual Asian Computing Science Conference, 62-73, 1999 | 117 | 1999 |
Complexity analysis for a lazy higher-order language D Sands European Symposium on Programming, 361-376, 1990 | 112 | 1990 |
Understanding intrusion detection through visualization S Axelsson, D Sands Springer-Verlag New York Inc, 2006 | 111* | 2006 |
Flow locks: Towards a core calculus for dynamic flow policies N Broberg, D Sands European Symposium on Programming, 180-196, 2006 | 106 | 2006 |
Assumptions and guarantees for compositional noninterference H Mantel, D Sands, H Sudbrock 24th Computer Security Foundations Symposium, CSF 2011; Cernay-la-Ville; 27 …, 2011 | 99 | 2011 |
A calculus of Gamma programs C Hankin, D LeMétayer, D Sands International Workshop on Languages and Compilers for Parallel Computing …, 1992 | 95 | 1992 |