David Sands

Heiko Mantel, David Sands, Henning Sudbrock: Assumptions and Guarantees for Compositional Noninterference. CSF 2011: 218-232

Sebastian Hunt, David Sands: From Exponential to Polynomial-Time Security Typing via Principal Types. ESOP 2011: 297-316

Filippo Del Tedesco, Sebastian Hunt, David Sands: A Semantic Hierarchy for Erasure Policies. ICISS 2011: 352-369

Filippo Del Tedesco, Sebastian Hunt, David Sands: A Semantic Hierarchy for Erasure Policies. CoRR abs/1109.6914 (2011)

Filippo Del Tedesco, Alejandro Russo, David Sands: Implementing Erasure Policies Using Taint Analysis. NordSec 2010: 193-209

Jonas Magazinius, Phu H. Phung, David Sands: Safe Wrappers and Sane Policies for Self Protecting JavaScript. NordSec 2010: 239-255

Niklas Broberg, David Sands: Paralocks: role-based information flow control and beyond. POPL 2010: 431-444

Andrei Sabelfeld, David Sands: Declassification: Dimensions and principles. Journal of Computer Security 17(5): 517-548 (2009)

Phu H. Phung, David Sands, Andrey Chudnov: Lightweight self-protecting JavaScript. ASIACCS 2009: 47-60

Delphine Demange, David Sands: All Secrets Great and Small. ESOP 2009: 207-221

Niklas Broberg, David Sands: Improving the Semantics of Imperfect Security. ARSPA-WITS 2009: 88-91

Josef Svenningsson, David Sands: Specification and Verification of Side Channel Declassification. Formal Aspects in Security and Trust 2009: 111-125

Niklas Broberg, David Sands: Flow-sensitive semantics for dynamic information flow policies. PLAS 2009: 101-112

Filippo Del Tedesco, David Sands: A User Model for Information Erasure. SECCO 2009: 16-30

Josef Svenningsson, David Sands: Specification and Verification of Side Channel Declassification. CoRR abs/0912.2952 (2009)

Phu H. Phung, David Sands: Security Policy Enforcement in the OSGi Framework Using Aspect-Oriented Programming. COMPSAC 2008: 1076-1082

Sebastian Hunt, David Sands: Just Forget It - The Semantics and Enforcement of Information Erasure. ESOP 2008: 239-253

Aslan Askarov, Sebastian Hunt, Andrei Sabelfeld, David Sands: Termination-Insensitive Noninterference Leaks More Than Just a Bit. ESORICS 2008: 333-348

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

Daniel Hedin, David Sands: Noninterference in the Presence of Non-Opaque Pointers. CSFW 2006: 217-229

Niklas Broberg, David Sands: Flow Locks: Towards a Core Calculus for Dynamic Flow Policies. ESOP 2006: 180-196

Sebastian Hunt, David Sands: On flow-sensitive security types. POPL 2006: 79-90

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

Daniel Hedin, David Sands: Timing Aware Information Flow Security for a JavaCard-like Bytecode. Electr. Notes Theor. Comput. Sci. 141(1): 163-182 (2005)

Andrei Sabelfeld, David Sands: Dimensions and Principles of Declassification. CSFW 2005: 255-269

Ádám Darvas, Reiner Hähnle, David Sands: A Theorem Proving Approach to Analysis of Secure Information Flow. SPC 2005: 193-209

Heiko Mantel, David Sands: Controlled Declassification Based on Intransitive Noninterference. APLAS 2004: 129-145

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)

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)

David Sands, Jörgen Gustavsson, Andrew Moran: Lambda Calculi and Linear Speedups. The Essence of Computation 2002: 60-84

David Sands: Probability and Timing: Challenges for Secure Programming. PAPM-PROBMIV 2002: 16

Andrei Sabelfeld, David Sands: A Per Model of Secure Information Flow in Sequential Programs. Higher-Order and Symbolic Computation 14(1): 59-91 (2001)

Jörgen Gustavsson, David Sands: Possibilities and Limitations of Call-by-Need Space Improvement. ICFP 2001: 265-276

Johan Agat, David Sands: On Confidentiality and Algorithms. IEEE Symposium on Security and Privacy 2001: 64-77

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

Andrei Sabelfeld, David Sands: Probabilistic Noninterference for Multi-Threaded Programs. CSFW 2000: 200-214

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)

Koen Claessen, David Sands: Observable Sharing for Functional Circuit Description. ASIAN 1999: 62-73

Andrew Moran, David Sands, Magnus Carlsson: Erratic Fudgets: A Semantic Theory for an Embedded Coordination Language. COORDINATION 1999: 85-102

Andrei Sabelfeld, David Sands: A Per Model of Secure Information Flow in Sequential Programs. ESOP 1999: 40-58

Andrew Moran, David Sands: Improvement in a Lazy Context: An Operational Theory for Call-by-Need. POPL 1999: 43-56

Chris Hankin, Daniel Le Métayer, David Sands: Refining Multiset Tranformers. Theor. Comput. Sci. 192(2): 233-258 (1998)

David Sands: From SOS Rules to Proof Principles: An Operational Metatheory for Functional Languages. POPL 1997: 428-441

David Sands: Proving the Correctness of Recursion-Based Automatic Program Transformations. Theor. Comput. Sci. 167(1&2): 193-233 (1996)

David Sands: Total Correctness by Local Improvement in the Transformation of Functional Programs. ACM Trans. Program. Lang. Syst. 18(2): 175-234 (1996)

David Sands: A Naïve Time Analysis and its Theory of Cost Equivalence. J. Log. Comput. 5(4): 495-541 (1995)

David Sands: Higher Order Expression Procedures. PEPM 1995: 178-189

Fritz Henglein, David Sands: A Semantic Model of Binding Times for Safe Partial Evaluation. PLILP 1995: 299-320

David Sands: Total Correctness by Local Improvement in Program Transformation. POPL 1995: 221-232

David Sands: Proving the Correctness of Recursion-Based Automatic Program Transformations. TAPSOFT 1995: 681-695

David Sands: A Compositional Semantics of Combining Forms for Gramma Programs. Formal Methods in Programming and Their Applications 1993: 43-56

David Sands: Laws of Parallel Synchronised Termination. Theory and Formal Methods 1993: 276-288

Chris Hankin, Daniel Le Métayer, David Sands: A Parallel Programming Style and Its Algebra of Programs. PARLE 1993: 367-378

Chris Hankin, Daniel Le Métayer, David Sands: A Calculus of Gamma Programs. LCPC 1992: 342-355

Chris Hankin, Daniel Le Métayer, David Sands: Transformation of Gamma Programs. WSA 1992: 12-19

David Sands: Operational Theories of Improvement in Functional Languages (Extended Abstract). Functional Programming 1991: 298-311

David Sands: Time Analysis, Cost Equivalence and Program Refinement. FSTTCS 1991: 25-39

Sebastian Hunt, David Sands: Binding Time Analysis: A New PERspective. PEPM 1991: 154-165

David Sands: Complexity Analysis for a Lazy Higher-Order Language. ESOP 1990: 361-376

David Sands: Complexity Analysis for a Lazy Higher-Order Language. Functional Programming 1989: 56-79