| 2009 |
|---|
| 45 | EE | Phu H. Phung,
David Sands,
Andrey Chudnov:
Lightweight self-protecting JavaScript.
ASIACCS 2009: 47-60 |
| 44 | EE | Delphine Demange,
David Sands:
All Secrets Great and Small.
ESOP 2009: 207-221 |
| 2008 |
|---|
| 43 | EE | Phu H. Phung,
David Sands:
Security Policy Enforcement in the OSGi Framework Using Aspect-Oriented Programming.
COMPSAC 2008: 1076-1082 |
| 42 | EE | Sebastian Hunt,
David Sands:
Just Forget It - The Semantics and Enforcement of Information Erasure.
ESOP 2008: 239-253 |
| 41 | EE | Aslan Askarov,
Sebastian Hunt,
Andrei Sabelfeld,
David Sands:
Termination-Insensitive Noninterference Leaks More Than Just a Bit.
ESORICS 2008: 333-348 |
| 2006 |
|---|
| 40 | | Marianne Winslett,
Andrew D. Gordon,
David Sands:
Proceedings of the 2006 ACM workshop on Formal methods in security engineering, FMSE 2006, Alexandria, VA, USA, November 3, 2006
ACM 2006 |
| 39 | EE | Daniel Hedin,
David Sands:
Noninterference in the Presence of Non-Opaque Pointers.
CSFW 2006: 217-229 |
| 38 | EE | Niklas Broberg,
David Sands:
Flow Locks: Towards a Core Calculus for Dynamic Flow Policies.
ESOP 2006: 180-196 |
| 37 | EE | Sebastian Hunt,
David Sands:
On flow-sensitive security types.
POPL 2006: 79-90 |
| 2005 |
|---|
| 36 | EE | Andrei Sabelfeld,
David Sands:
Dimensions and Principles of Declassification.
CSFW 2005: 255-269 |
| 35 | EE | Ádám Darvas,
Reiner Hähnle,
David Sands:
A Theorem Proving Approach to Analysis of Secure Information Flow.
SPC 2005: 193-209 |
| 34 | EE | Daniel Hedin,
David Sands:
Timing Aware Information Flow Security for a JavaCard-like Bytecode.
Electr. Notes Theor. Comput. Sci. 141(1): 163-182 (2005) |
| 2004 |
|---|
| 33 | EE | Heiko Mantel,
David Sands:
Controlled Declassification Based on Intransitive Noninterference.
APLAS 2004: 129-145 |
| 2003 |
|---|
| 32 | EE | 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) |
| 2002 |
|---|
| 31 | EE | David Sands:
Probability and Timing: Challenges for Secure Programming.
PAPM-PROBMIV 2002: 16 |
| 30 | EE | David Sands,
Jörgen Gustavsson,
Andrew Moran:
Lambda Calculi and Linear Speedups.
The Essence of Computation 2002: 60-84 |
| 2001 |
|---|
| 29 | | David Sands:
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
Springer 2001 |
| 28 | | Jörgen Gustavsson,
David Sands:
Possibilities and Limitations of Call-by-Need Space Improvement.
ICFP 2001: 265-276 |
| 27 | EE | Johan Agat,
David Sands:
On Confidentiality and Algorithms.
IEEE Symposium on Security and Privacy 2001: 64-77 |
| 26 | | Andrei Sabelfeld,
David Sands:
A Per Model of Secure Information Flow in Sequential Programs.
Higher-Order and Symbolic Computation 14(1): 59-91 (2001) |
| 2000 |
|---|
| 25 | EE | Andrei Sabelfeld,
David Sands:
Probabilistic Noninterference for Multi-Threaded Programs.
CSFW 2000: 200-214 |
| 1999 |
|---|
| 24 | EE | Koen Claessen,
David Sands:
Observable Sharing for Functional Circuit Description.
ASIAN 1999: 62-73 |
| 23 | EE | Andrew Moran,
David Sands,
Magnus Carlsson:
Erratic Fudgets: A Semantic Theory for an Embedded Coordination Language.
COORDINATION 1999: 85-102 |
| 22 | EE | Andrei Sabelfeld,
David Sands:
A Per Model of Secure Information Flow in Sequential Programs.
ESOP 1999: 40-58 |
| 21 | EE | Andrew Moran,
David Sands:
Improvement in a Lazy Context: An Operational Theory for Call-by-Need.
POPL 1999: 43-56 |
| 20 | EE | Jörgen Gustavsson,
David Sands:
A Foundation for Space-Safe Transformations of Call-by-Need Programs.
Electr. Notes Theor. Comput. Sci. 26: (1999) |
| 1998 |
|---|
| 19 | EE | Chris Hankin,
Daniel Le Métayer,
David Sands:
Refining Multiset Tranformers.
Theor. Comput. Sci. 192(2): 233-258 (1998) |
| 1997 |
|---|
| 18 | EE | David Sands:
From SOS Rules to Proof Principles: An Operational Metatheory for Functional Languages.
POPL 1997: 428-441 |
| 1996 |
|---|
| 17 | EE | David Sands:
Total Correctness by Local Improvement in the Transformation of Functional Programs.
ACM Trans. Program. Lang. Syst. 18(2): 175-234 (1996) |
| 16 | EE | David Sands:
Proving the Correctness of Recursion-Based Automatic Program Transformations.
Theor. Comput. Sci. 167(1&2): 193-233 (1996) |
| 1995 |
|---|
| 15 | | David Sands:
Higher Order Expression Procedures.
PEPM 1995: 178-189 |
| 14 | | Fritz Henglein,
David Sands:
A Semantic Model of Binding Times for Safe Partial Evaluation
PLILP 1995: 299-320 |
| 13 | | David Sands:
Total Correctness by Local Improvement in Program Transformation.
POPL 1995: 221-232 |
| 12 | | David Sands:
Proving the Correctness of Recursion-Based Automatic Program Transformations.
TAPSOFT 1995: 681-695 |
| 11 | | David Sands:
A Naïve Time Analysis and its Theory of Cost Equivalence.
J. Log. Comput. 5(4): 495-541 (1995) |
| 1993 |
|---|
| 10 | | David Sands:
A Compositional Semantics of Combining Forms for Gramma Programs.
Formal Methods in Programming and Their Applications 1993: 43-56 |
| 9 | | Chris Hankin,
Daniel Le Métayer,
David Sands:
A Parallel Programming Style and Its Algebra of Programs.
PARLE 1993: 367-378 |
| 8 | | David Sands:
Laws of Parallel Synchronised Termination.
Theory and Formal Methods 1993: 276-288 |
| 1992 |
|---|
| 7 | | Chris Hankin,
Daniel Le Métayer,
David Sands:
A Calculus of Gamma Programs.
LCPC 1992: 342-355 |
| 6 | | Chris Hankin,
Daniel Le Métayer,
David Sands:
Transformation of Gamma Programs.
WSA 1992: 12-19 |
| 1991 |
|---|
| 5 | | David Sands:
Time Analysis, Cost Equivalence and Program Refinement.
FSTTCS 1991: 25-39 |
| 4 | | David Sands:
Operational Theories of Improvement in Functional Languages (Extended Abstract).
Functional Programming 1991: 298-311 |
| 3 | | Sebastian Hunt,
David Sands:
Binding Time Analysis: A New PERspective.
PEPM 1991: 154-165 |
| 1990 |
|---|
| 2 | | David Sands:
Complexity Analysis for a Lazy Higher-Order Language.
ESOP 1990: 361-376 |
| 1989 |
|---|
| 1 | | David Sands:
Complexity Analysis for a Lazy Higher-Order Language.
Functional Programming 1989: 56-79 |
