Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
David Sands
2010 – today
- 2012
[c46]- 2011
- [c45]Heiko Mantel, David Sands, Henning Sudbrock: Assumptions and Guarantees for Compositional Noninterference. CSF 2011: 218-232
- [c44]Sebastian Hunt, David Sands: From Exponential to Polynomial-Time Security Typing via Principal Types. ESOP 2011: 297-316
- [c43]Filippo Del Tedesco, Sebastian Hunt, David Sands: A Semantic Hierarchy for Erasure Policies. ICISS 2011: 352-369
- [i2]Filippo Del Tedesco, Sebastian Hunt, David Sands: A Semantic Hierarchy for Erasure Policies. CoRR abs/1109.6914 (2011)
- 2010
- [c42]Filippo Del Tedesco, Alejandro Russo, David Sands: Implementing Erasure Policies Using Taint Analysis. NordSec 2010: 193-209
- [c41]Jonas Magazinius, Phu H. Phung, David Sands: Safe Wrappers and Sane Policies for Self Protecting JavaScript. NordSec 2010: 239-255
- [c40]Niklas Broberg, David Sands: Paralocks: role-based information flow control and beyond. POPL 2010: 431-444
2000 – 2009
- 2009
- [j10]Andrei Sabelfeld, David Sands: Declassification: Dimensions and principles. Journal of Computer Security 17(5): 517-548 (2009)
- [c39]Phu H. Phung, David Sands, Andrey Chudnov: Lightweight self-protecting JavaScript. ASIACCS 2009: 47-60
- [c38]
- [c37]
- [c36]Josef Svenningsson, David Sands: Specification and Verification of Side Channel Declassification. Formal Aspects in Security and Trust 2009: 111-125
- [c35]Niklas Broberg, David Sands: Flow-sensitive semantics for dynamic information flow policies. PLAS 2009: 101-112
- [c34]
- [i1]Josef Svenningsson, David Sands: Specification and Verification of Side Channel Declassification. CoRR abs/0912.2952 (2009)
- 2008
- [c33]Phu H. Phung, David Sands: Security Policy Enforcement in the OSGi Framework Using Aspect-Oriented Programming. COMPSAC 2008: 1076-1082
- [c32]Sebastian Hunt, David Sands: Just Forget It - The Semantics and Enforcement of Information Erasure. ESOP 2008: 239-253
- [c31]Aslan Askarov, Sebastian Hunt, Andrei Sabelfeld, David Sands: Termination-Insensitive Noninterference Leaks More Than Just a Bit. ESORICS 2008: 333-348
- 2006
- [b1]Stefan Axelsson, David Sands: Understanding Intrusion Detection Through Visualization. Advances in Information Security 24, Springer 2006, ISBN 978-0-387-27634-2, pp. 1-145
- [c30]Daniel Hedin, David Sands: Noninterference in the Presence of Non-Opaque Pointers. CSFW 2006: 217-229
- [c29]Niklas Broberg, David Sands: Flow Locks: Towards a Core Calculus for Dynamic Flow Policies. ESOP 2006: 180-196
- [c28]
- [e2]Marianne Winslett, Andrew D. Gordon, David Sands (Eds.): Proceedings of the 2006 ACM workshop on Formal methods in security engineering, FMSE 2006, Alexandria, VA, USA, November 3, 2006. ACM 2006, ISBN 1-59593-550-9
- 2005
- [j9]Daniel Hedin, David Sands: Timing Aware Information Flow Security for a JavaCard-like Bytecode. Electr. Notes Theor. Comput. Sci. 141(1): 163-182 (2005)
- [c27]
- [c26]Ádám Darvas, Reiner Hähnle, David Sands: A Theorem Proving Approach to Analysis of Secure Information Flow. SPC 2005: 193-209
- 2004
- [c25]Heiko Mantel, David Sands: Controlled Declassification Based on Intransitive Noninterference. APLAS 2004: 129-145
- 2003
- [j8]Andrew Moran, David Sands, Magnus Carlsson: Erratic Fudgets: a semantic theory for an embedded coordination language. Sci. Comput. Program. 46(1-2): 99-135 (2003)
- [j7]M. Schlaf, Hani A. Hagras, David Sands: Optimization strategies for parametric analysis of thin-film reflectivity spectra. IEEE T. Instrumentation and Measurement 52(5): 1635-1639 (2003)
- 2002
- [c24]David Sands, Jörgen Gustavsson, Andrew Moran: Lambda Calculi and Linear Speedups. The Essence of Computation 2002: 60-84
- [c23]
- 2001
- [j6]Andrei Sabelfeld, David Sands: A Per Model of Secure Information Flow in Sequential Programs. Higher-Order and Symbolic Computation 14(1): 59-91 (2001)
- [c22]Jörgen Gustavsson, David Sands: Possibilities and Limitations of Call-by-Need Space Improvement. ICFP 2001: 265-276
- [c21]Johan Agat, David Sands: On Confidentiality and Algorithms. IEEE Symposium on Security and Privacy 2001: 64-77
- [e1]David Sands (Ed.): Programming Languages and Systems, 10th European Symposium on Programming, ESOP 2001 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2001 Genova, Italy, April 2-6, 2001, Proceedings. Lecture Notes in Computer Science 2028, Springer 2001, ISBN 3-540-41862-8
- 2000
- [c20]Andrei Sabelfeld, David Sands: Probabilistic Noninterference for Multi-Threaded Programs. CSFW 2000: 200-214
1990 – 1999
- 1999
- [j5]Jörgen Gustavsson, David Sands: A Foundation for Space-Safe Transformations of Call-by-Need Programs. Electr. Notes Theor. Comput. Sci. 26: 69-86 (1999)
- [c19]Koen Claessen, David Sands: Observable Sharing for Functional Circuit Description. ASIAN 1999: 62-73
- [c18]Andrew Moran, David Sands, Magnus Carlsson: Erratic Fudgets: A Semantic Theory for an Embedded Coordination Language. COORDINATION 1999: 85-102
- [c17]Andrei Sabelfeld, David Sands: A Per Model of Secure Information Flow in Sequential Programs. ESOP 1999: 40-58
- [c16]Andrew Moran, David Sands: Improvement in a Lazy Context: An Operational Theory for Call-by-Need. POPL 1999: 43-56
- 1998
- [j4]Chris Hankin, Daniel Le Métayer, David Sands: Refining Multiset Tranformers. Theor. Comput. Sci. 192(2): 233-258 (1998)
- 1997
- [c15]David Sands: From SOS Rules to Proof Principles: An Operational Metatheory for Functional Languages. POPL 1997: 428-441
- 1996
- [j3]David Sands: Proving the Correctness of Recursion-Based Automatic Program Transformations. Theor. Comput. Sci. 167(1&2): 193-233 (1996)
- [j2]David Sands: Total Correctness by Local Improvement in the Transformation of Functional Programs. ACM Trans. Program. Lang. Syst. 18(2): 175-234 (1996)
- 1995
- [j1]David Sands: A Naïve Time Analysis and its Theory of Cost Equivalence. J. Log. Comput. 5(4): 495-541 (1995)
- [c14]
- [c13]Fritz Henglein, David Sands: A Semantic Model of Binding Times for Safe Partial Evaluation. PLILP 1995: 299-320
- [c12]
- [c11]David Sands: Proving the Correctness of Recursion-Based Automatic Program Transformations. TAPSOFT 1995: 681-695
- 1993
- [c10]David Sands: A Compositional Semantics of Combining Forms for Gramma Programs. Formal Methods in Programming and Their Applications 1993: 43-56
- [c9]
- [c8]Chris Hankin, Daniel Le Métayer, David Sands: A Parallel Programming Style and Its Algebra of Programs. PARLE 1993: 367-378
- 1992
- [c7]
- [c6]
- 1991
- [c5]David Sands: Operational Theories of Improvement in Functional Languages (Extended Abstract). Functional Programming 1991: 298-311
- [c4]
- [c3]
- 1990
- [c2]
1980 – 1989
- 1989
- [c1]David Sands: Complexity Analysis for a Lazy Higher-Order Language. Functional Programming 1989: 56-79
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 11:03 CEST by the dblp team