David Sands - researchr alias

researchr

You are not signed in
Sign in
Sign up

2011

From Exponential to Polynomial-Time Security Typing via Principal TypesSebastian Hunt, David Sands. ESOP 2011: 297-316 [doi]

Assumptions and Guarantees for Compositional NoninterferenceHeiko Mantel, David Sands, Henning Sudbrock. csfw 2011: 218-232 [doi]

2010

Paralocks: role-based information flow control and beyondNiklas Broberg, David Sands. POPL 2010: 431-444 [doi]

2009

2008

Termination-Insensitive Noninterference Leaks More Than Just a BitAslan Askarov, Sebastian Hunt, Andrei Sabelfeld, David Sands. esorics 2008: 333-348 [doi]

Just Forget It - The Semantics and Enforcement of Information ErasureSebastian Hunt, David Sands. ESOP 2008: 239-253 [doi]

Security Policy Enforcement in the OSGi Framework Using Aspect-Oriented ProgrammingPhu H. Phung, David Sands. compsac 2008: 1076-1082 [doi]

2006

Understanding Intrusion Detection Through VisualizationStefan Axelsson, David Sands. Volume 24 of Advances in Information Security, Springer, 2006. [doi]

Flow Locks: Towards a Core Calculus for Dynamic Flow PoliciesNiklas Broberg, David Sands. ESOP 2006: 180-196 [doi]

Noninterference in the Presence of Non-Opaque PointersDaniel Hedin, David Sands. csfw 2006: 217-229 [doi]

On flow-sensitive security typesSebastian Hunt, David Sands. POPL 2006: 79-90 [doi]

Proceedings of the 2006 ACM workshop on Formal methods in security engineering, FMSE 2006, Alexandria, VA, USA, November 3, 2006Marianne Winslett, Andrew D. Gordon, David Sands, editors, ACM, 2006.

2005

Timing Aware Information Flow Security for a JavaCard-like BytecodeDaniel Hedin, David Sands. ENTCS, 141(1):163-182, 2005. [doi]

Dimensions and Principles of DeclassificationAndrei Sabelfeld, David Sands. csfw 2005: 255-269 [doi]

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

2004

Controlled Declassification Based on Intransitive NoninterferenceHeiko Mantel, David Sands. aplas 2004: 129-145 [doi]

2003

Erratic Fudgets: a semantic theory for an embedded coordination languageAndrew Moran, David Sands, Magnus Carlsson. SCP, 46(1-2):99-135, 2003. [doi]

Optimization strategies for parametric analysis of thin-film reflectivity spectraM. Schlaf, Hani A. Hagras, David Sands. tim, 52(5):1635-1639, 2003. [doi]

2002

Lambda Calculi and Linear SpeedupsDavid Sands, Jörgen Gustavsson, Andrew Moran. BIRTHDAY 2002: 60-84 [doi]

Probability and Timing: Challenges for Secure ProgrammingDavid Sands. papm 2002: 16 [doi]

2001

On Confidentiality and AlgorithmsJohan Agat, David Sands. sp 2001: 64-77 [doi]

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

A Per Model of Secure Information Flow in Sequential ProgramsAndrei Sabelfeld, David Sands. lisp, 14(1):59-91, 2001.

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, ProceedingsDavid Sands, editor, Volume 2028 of Lecture Notes in Computer Science, Springer, 2001.

2000

Probabilistic Noninterference for Multi-Threaded ProgramsAndrei Sabelfeld, David Sands. csfw 2000: 200-214 [doi]

1999

1998

Refining Multiset TranformersChris Hankin, Daniel Le Métayer, David Sands. TCS, 192(2):233-258, 1998. [doi]

1997

From SOS Rules to Proof Principles: An Operational Metatheory for Functional LanguagesDavid Sands. POPL 1997: 428-441 [doi]

1996

Total Correctness by Local Improvement in the Transformation of Functional ProgramsDavid Sands. TOPLAS, 18(2):175-234, 1996. [doi]

Proving the Correctness of Recursion-Based Automatic Program TransformationsDavid Sands. TCS, 167(1&2):193-233, 1996. [doi]

1995

A Semantic Model of Binding Times for Safe Partial EvaluationFritz Henglein, David Sands. plilp 1995: 299-320

Higher Order Expression ProceduresDavid Sands. PEPM 1995: 178-189

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

Proving the Correctness of Recursion-Based Automatic Program TransformationsDavid Sands. tapsoft 1995: 681-695

A Naïve Time Analysis and its Theory of Cost EquivalenceDavid Sands. logcom, 5(4):495-541, 1995.

1993

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

Laws of Parallel Synchronised TerminationDavid Sands. imperial 1993: 276-288

A Compositional Semantics of Combining Forms for Gramma ProgramsDavid Sands. ershov 1993: 43-56

1992

A Calculus of Gamma ProgramsChris Hankin, Daniel Le Métayer, David Sands. lcpc 1993: 342-355

Transformation of Gamma ProgramsChris Hankin, Daniel Le Métayer, David Sands. SAS 1992: 12-19

1991

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

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

Time Analysis, Cost Equivalence and Program RefinementDavid Sands. fsttcs 1991: 25-39

1990

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

1989

Complexity Analysis for a Lazy Higher-Order LanguageDavid Sands. fp 1990: 56-79