David Sands
David Sands
Professor of Computer Science, Chalmers University of Technology
Verified email at chalmers.se - Homepage
Cited by
Cited by
Probabilistic noninterference for multi-threaded programs
A Sabelfeld, D Sands
Proceedings 13th IEEE Computer Security Foundations Workshop. CSFW-13, 200-214, 2000
Dimensions and principles of declassification
A Sabelfeld, D Sands
18th IEEE Computer Security Foundations Workshop (CSFW'05), 255-269, 2005
Declassification: Dimensions and principles
A Sabelfeld, D Sands
Journal of Computer Security 17 (5), 517-548, 2009
On flow-sensitive security types
S Hunt, D Sands
POPL'06, Proceedings of the 33rd Annual. ACM SIGPLAN - SIGACT. Symposium. on …, 2006
A theorem proving approach to analysis of secure information flow
Á Darvas, R Hähnle, D Sands
International Conference on Security in Pervasive Computing, 193-209, 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
A per model of secure information flow in sequential programs
A Sabelfeld, D Sands
Higher-order and symbolic computation 14 (1), 59-91, 2001
Lightweight self-protecting JavaScript
PH Phung, D Sands, A Chudnov
Proceedings of the 4th International Symposium on Information, Computer, and …, 2009
Controlled declassification based on intransitive noninterference
H Mantel, D Sands
Proc. Asian Symp. on Programming Languages and Systems, LNCS, 129-145, 2004
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
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
Understanding intrusion detection through visualization
S Axelsson, D Sands
Springer-Verlag New York Inc, 2006
Observable sharing for functional circuit description
K Claessen, D Sands
Annual Asian Computing Science Conference, 62-73, 1999
Complexity analysis for a lazy higher-order language
D Sands
Functional Programming, 56-79, 1990
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
A calculus of Gamma programs
C Hankin, D LeMétayer, D Sands
International Workshop on Languages and Compilers for Parallel Computing …, 1992
Flow locks: Towards a core calculus for dynamic flow policies
N Broberg, D Sands
European Symposium on Programming, 180-196, 2006
A naive time analysis and its theory of cost equivalence
D Sands
Journal of Logic and Computation 5 (4), 495-541, 1995
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
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
The system can't perform the operation now. Try again later.
Articles 1–20