Calculi for time analysis of functional programs. - David Sands 001 (1990)

Binding Time Analysis: A New PERspective. - Sebastian Hunt; David Sands 001 (PEPM, 1991)

A Calculus of Gamma Programs. - Chris Hankin; Daniel Le Métayer; David Sands 001 (LCPC, 1992)

Transformation of Gamma Programs. - Chris Hankin; Daniel Le Métayer; David Sands 001 (WSA, 1992)

A Compositional Semantics of Combining Forms for Gramma Programs. - David Sands 001 (Formal Methods in Programming and Their Applications, 1993)

A Parallel Programming Style and Its Algebra of Programs. - Chris Hankin; Daniel Le Métayer; David Sands 001 (PARLE, 1993)

Higher Order Expression Procedures. - David Sands 001 (PEPM, 1995)

A Semantic Model of Binding Times for Safe Partial Evaluation - Fritz Henglein; David Sands 001 (PLILP, 1995)

Total Correctness by Local Improvement in Program Transformation. - David Sands 001 (POPL, 1995)

A Naïve Time Analysis and its Theory of Cost Equivalence. - David Sands 001 (J. Log. Comput., 1995)

Proving the Correctness of Recursion-Based Automatic Program Transformations. - David Sands 001 (Theor. Comput. Sci., 1996)

From SOS Rules to Proof Principles: An Operational Metatheory for Functional Languages. - David Sands 001 (POPL, 1997)

Refining Multiset Tranformers. - Chris Hankin; Daniel Le Métayer; David Sands 001 (Theor. Comput. Sci., 1998)

Observable Sharing for Functional Circuit Description. - Koen Claessen; David Sands 001 (ASIAN, 1999)

Improvement in a Lazy Context: An Operational Theory for Call-by-Need. - Andrew Moran; David Sands 001 (POPL, 1999)

A Foundation for Space-Safe Transformations of Call-by-Need Programs. - Jörgen Gustavsson; David Sands 001 (HOOTS, 1999)

Probabilistic Noninterference for Multi-Threaded Programs. - Andrei Sabelfeld; David Sands 001 (CSFW, 2000)

Possibilities and Limitations of Call-by-Need Space Improvement. - Jörgen Gustavsson; David Sands 001 (ICFP, 2001)

A Per Model of Secure Information Flow in Sequential Programs. - Andrei Sabelfeld; David Sands 001 (High. Order Symb. Comput., 2001)

Lambda Calculi and Linear Speedups. - David Sands 001; Jörgen Gustavsson; Andrew Moran (The Essence of Computation, 2002)

Probability and Timing: Challenges for Secure Programming. - David Sands 001 (PAPM-PROBMIV, 2002)

Erratic Fudgets: a semantic theory for an embedded coordination language. - Andrew Moran; David Sands 001; Magnus Carlsson (Sci. Comput. Program., 2003)

Controlled Declassification Based on Intransitive Noninterference. - Heiko Mantel; David Sands 001 (APLAS, 2004)

Dimensions and Principles of Declassification. - Andrei Sabelfeld; David Sands 001 (CSFW, 2005)

A Theorem Proving Approach to Analysis of Secure Information Flow. - Ádám Darvas; Reiner Hähnle; David Sands 001 (SPC, 2005)

Timing Aware Information Flow Security for a JavaCard-like Bytecode. - Daniel Hedin; David Sands 001 (Bytecode@ETAPS, 2005)

Noninterference in the Presence of Non-Opaque Pointers. - Daniel Hedin; David Sands 001 (CSFW, 2006)

Flow Locks: Towards a Core Calculus for Dynamic Flow Policies. - Niklas Broberg; David Sands 001 (ESOP, 2006)

On flow-sensitive security types. - Sebastian Hunt; David Sands 001 (POPL, 2006)

Security Policy Enforcement in the OSGi Framework Using Aspect-Oriented Programming. - Phu H. Phung; David Sands 001 (COMPSAC, 2008)

Just Forget It - The Semantics and Enforcement of Information Erasure. - Sebastian Hunt; David Sands 001 (ESOP, 2008)

Termination-Insensitive Noninterference Leaks More Than Just a Bit. - Aslan Askarov; Sebastian Hunt; Andrei Sabelfeld; David Sands 001 (ESORICS, 2008)

Lightweight self-protecting JavaScript. - Phu H. Phung; David Sands 001; Andrey Chudnov (AsiaCCS, 2009)

All Secrets Great and Small. - Delphine Demange; David Sands 001 (ESOP, 2009)

Improving the Semantics of Imperfect Security. - Niklas Broberg; David Sands 001 (ARSPA-WITS, 2009)

Specification and Verification of Side Channel Declassification. - Josef Svenningsson; David Sands 001 (Formal Aspects in Security and Trust, 2009)

Flow-sensitive semantics for dynamic information flow policies. - Niklas Broberg; David Sands 001 (PLAS, 2009)

A User Model for Information Erasure - Filippo Del Tedesco; David Sands 001 (SECCO, 2009)

Declassification: Dimensions and principles. - Andrei Sabelfeld; David Sands 001 (J. Comput. Secur., 2009)

Safe Wrappers and Sane Policies for Self Protecting JavaScript. - Jonas Magazinius; Phu H. Phung; David Sands 001 (NordSec, 2010)

Implementing Erasure Policies Using Taint Analysis. - Filippo Del Tedesco; Alejandro Russo; David Sands 001 (NordSec, 2010)

Paralocks: role-based information flow control and beyond. - Niklas Broberg; David Sands 001 (POPL, 2010)

Assumptions and Guarantees for Compositional Noninterference. - Heiko Mantel; David Sands 001; Henning Sudbrock (CSF, 2011)

From Exponential to Polynomial-Time Security Typing via Principal Types. - Sebastian Hunt; David Sands 001 (ESOP, 2011)

A Semantic Hierarchy for Erasure Policies. - Filippo Del Tedesco; Sebastian Hunt; David Sands 001 (ICISS, 2011)

A Datalog Semantics for Paralocks. - Bart van Delft; Niklas Broberg; David Sands 001 (STM, 2012)

Fault-tolerant non-interference: invited talk abstract. - David Sands 001 (PLAS, 2013)

Paragon: Programming with Information Flow Control (Demo). - Niklas Broberg; Bart van Delft; David Sands 001 (PLAS@ECOOP, 2014)

Fault-Tolerant Non-interference. - Filippo Del Tedesco; Alejandro Russo; David Sands 001 (ESSoS, 2014)

Type-Directed Compilation for Fault-Tolerant Non-Interference. - Filippo Del Tedesco; David Sands 001; Alejandro Russo (CoRR, 2014)

Programming in Paragon. - Bart van Delft; Niklas Broberg; David Sands 001 (Software Systems Safety, 2014)

The Anatomy and Facets of Dynamic Policies. - Niklas Broberg; Bart van Delft; David Sands 001 (CSF, 2015)

Differential Privacy: Now it's Getting Personal. - Hamid Ebadi; David Sands 001; Gerardo Schneider (POPL, 2015)

Very Static Enforcement of Dynamic Policies. - Bart van Delft; Sebastian Hunt; David Sands 001 (POST, 2015)

Fault-Resilient Non-interference. - Filippo Del Tedesco; David Sands 001; Alejandro Russo (CSF, 2016)

Sampling and partitioning for differential privacy. - Hamid Ebadi; Thibaud Antignac; David Sands 001 (PST, 2016)

Data Minimisation: a Language-Based Approach (Long Version). - Thibaud Antignac; David Sands 001; Gerardo Schneider (CoRR, 2016)

Featherweight PINQ. - Hamid Ebadi; David Sands 001 (J. Priv. Confidentiality, 2016)

Data Minimisation: A Language-Based Approach. - Thibaud Antignac; David Sands 001; Gerardo Schneider (SEC, 2017)

Paragon - Practical programming with information flow control. - Niklas Broberg; Bart van Delft; David Sands 001 (J. Comput. Secur., 2017)

Runtime verification of hyperproperties for deterministic programs. - Srinivas Pinisetty; Gerardo Schneider; David Sands 001 (FormaliSE@ICSE, 2018)

Monitoring Data Minimisation. - Srinivas Pinisetty; Thibaud Antignac; David Sands 001; Gerardo Schneider (CoRR, 2018)

New Program Abstractions for Privacy. - Sebastian Hunt; David Sands 001 (From Lambda Calculus to Cybersecurity Through Program Analysis, 2020)

A Quantale of Information. - Sebastian Hunt; David Sands 001 (CSF, 2021)

PROPR: Property-Based Automatic Program Repair. - Matthías Páll Gissurarson; Leonhard Applis; Annibale Panichella; Arie van Deursen; David Sands 001 (ICSE, 2022)

Reconciling Shannon and Scott with a Lattice of Computable Information. - Sebastian Hunt; David Sands 001; Sandro Stucki (Proc. ACM Program. Lang., 2023)