David Sands

Orcid: 0000-0001-6221-0503

Affiliations:
  • Chalmers University of Technology, Gothenburg, Sweden


According to our database1, David Sands authored at least 66 papers between 1990 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Reconciling Shannon and Scott with a Lattice of Computable Information.
Proc. ACM Program. Lang., January, 2023

2022
PROPR: Property-Based Automatic Program Repair.
Proceedings of the 44th IEEE/ACM 44th International Conference on Software Engineering, 2022

2021
A Quantale of Information.
Proceedings of the 34th IEEE Computer Security Foundations Symposium, 2021

2020
New Program Abstractions for Privacy.
Proceedings of the From Lambda Calculus to Cybersecurity Through Program Analysis, 2020

2018
Monitoring Data Minimisation.
CoRR, 2018

Runtime verification of hyperproperties for deterministic programs.
Proceedings of the 6th Conference on Formal Methods in Software Engineering, 2018

2017
Paragon - Practical programming with information flow control.
J. Comput. Secur., 2017

Data Minimisation: A Language-Based Approach.
Proceedings of the ICT Systems Security and Privacy Protection, 2017

2016
Featherweight PINQ.
J. Priv. Confidentiality, 2016

Data Minimisation: a Language-Based Approach (Long Version).
CoRR, 2016

Sampling and partitioning for differential privacy.
Proceedings of the 14th Annual Conference on Privacy, Security and Trust, 2016

Fault-Resilient Non-interference.
Proceedings of the IEEE 29th Computer Security Foundations Symposium, 2016

2015
Very Static Enforcement of Dynamic Policies.
Proceedings of the Principles of Security and Trust - 4th International Conference, 2015

Differential Privacy: Now it's Getting Personal.
Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2015

The Anatomy and Facets of Dynamic Policies.
Proceedings of the IEEE 28th Computer Security Foundations Symposium, 2015

2014
Programming in Paragon.
Proceedings of the Software Systems Safety, 2014

Type-Directed Compilation for Fault-Tolerant Non-Interference.
CoRR, 2014

Fault-Tolerant Non-interference.
Proceedings of the Engineering Secure Software and Systems - 6th International Symposium, 2014

Paragon: Programming with Information Flow Control (Demo).
Proceedings of the Ninth Workshop on Programming Languages and Analysis for Security, 2014

2013
Fault-tolerant non-interference: invited talk abstract.
Proceedings of the 2013 ACM SIGPLAN Workshop on Programming Languages and Analysis for Security, 2013

2012
A Datalog Semantics for Paralocks.
Proceedings of the Security and Trust Management - 8th International Workshop, 2012

2011
A Semantic Hierarchy for Erasure Policies.
Proceedings of the Information Systems Security - 7th International Conference, 2011

From Exponential to Polynomial-Time Security Typing via Principal Types.
Proceedings of the Programming Languages and Systems, 2011

Assumptions and Guarantees for Compositional Noninterference.
Proceedings of the 24th IEEE Computer Security Foundations Symposium, 2011

2010
Paralocks: role-based information flow control and beyond.
Proceedings of the 37th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2010

Implementing Erasure Policies Using Taint Analysis.
Proceedings of the Information Security Technology for Applications, 2010

Safe Wrappers and Sane Policies for Self Protecting JavaScript.
Proceedings of the Information Security Technology for Applications, 2010

2009
Declassification: Dimensions and principles.
J. Comput. Secur., 2009

A User Model for Information Erasure
Proceedings of the Proceedings 7th International Workshop on Security Issues in Concurrency, 2009

Flow-sensitive semantics for dynamic information flow policies.
Proceedings of the 2009 Workshop on Programming Languages and Analysis for Security, 2009

Specification and Verification of Side Channel Declassification.
Proceedings of the Formal Aspects in Security and Trust, 6th International Workshop, 2009

Improving the Semantics of Imperfect Security.
Proceedings of the Foundations and Applications of Security Analysis, 2009

All Secrets Great and Small.
Proceedings of the Programming Languages and Systems, 2009

Lightweight self-protecting JavaScript.
Proceedings of the 2009 ACM Symposium on Information, 2009

2008
Termination-Insensitive Noninterference Leaks More Than Just a Bit.
Proceedings of the Computer Security, 2008

Just Forget It - The Semantics and Enforcement of Information Erasure.
Proceedings of the Programming Languages and Systems, 2008

Security Policy Enforcement in the OSGi Framework Using Aspect-Oriented Programming.
Proceedings of the 32nd Annual IEEE International Computer Software and Applications Conference, 2008

2006
On flow-sensitive security types.
Proceedings of the 33rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2006

Flow Locks: Towards a Core Calculus for Dynamic Flow Policies.
Proceedings of the Programming Languages and Systems, 2006

Noninterference in the Presence of Non-Opaque Pointers.
Proceedings of the 19th IEEE Computer Security Foundations Workshop, 2006

2005
Timing Aware Information Flow Security for a JavaCard-like Bytecode.
Proceedings of the First Workshop on Bytecode Semantics, 2005

A Theorem Proving Approach to Analysis of Secure Information Flow.
Proceedings of the Security in Pervasive Computing, Second International Conference, 2005

Dimensions and Principles of Declassification.
Proceedings of the 18th IEEE Computer Security Foundations Workshop, 2005

2004
Controlled Declassification Based on Intransitive Noninterference.
Proceedings of the Programming Languages and Systems: Second Asian Symposium, 2004

2003
Erratic Fudgets: a semantic theory for an embedded coordination language.
Sci. Comput. Program., 2003

2002
Probability and Timing: Challenges for Secure Programming.
Proceedings of the Process Algebra and Probabilistic Methods, 2002

Lambda Calculi and Linear Speedups.
Proceedings of the Essence of Computation, Complexity, Analysis, 2002

2001
A Per Model of Secure Information Flow in Sequential Programs.
High. Order Symb. Comput., 2001

Possibilities and Limitations of Call-by-Need Space Improvement.
Proceedings of the Sixth ACM SIGPLAN International Conference on Functional Programming (ICFP '01), 2001

2000
Probabilistic Noninterference for Multi-Threaded Programs.
Proceedings of the 13th IEEE Computer Security Foundations Workshop, 2000

1999
A Foundation for Space-Safe Transformations of Call-by-Need Programs.
Proceedings of the Third Workshop on Higher-Order Operational Techniques in Semantics, 1999

Improvement in a Lazy Context: An Operational Theory for Call-by-Need.
Proceedings of the POPL '99, 1999

Observable Sharing for Functional Circuit Description.
Proceedings of the Advances in Computing Science, 1999

1998
Refining Multiset Tranformers.
Theor. Comput. Sci., 1998

1997
From SOS Rules to Proof Principles: An Operational Metatheory for Functional Languages.
Proceedings of the Conference Record of POPL'97: The 24th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1997

1996
Proving the Correctness of Recursion-Based Automatic Program Transformations.
Theor. Comput. Sci., 1996

1995
A Naïve Time Analysis and its Theory of Cost Equivalence.
J. Log. Comput., 1995

Total Correctness by Local Improvement in Program Transformation.
Proceedings of the Conference Record of POPL'95: 22nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1995

A Semantic Model of Binding Times for Safe Partial Evaluation
Proceedings of the Programming Languages: Implementations, 1995

Higher Order Expression Procedures.
Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation, 1995

1993
A Parallel Programming Style and Its Algebra of Programs.
Proceedings of the PARLE '93, 1993

A Compositional Semantics of Combining Forms for Gramma Programs.
Proceedings of the Formal Methods in Programming and Their Applications, International Conference, Akademgorodok, Novosibirsk, Russia, June 28, 1993

1992
Transformation of Gamma Programs.
Proceedings of the Actes WSA'92 Workshop on Static Analysis (Bordeaux, 1992

A Calculus of Gamma Programs.
Proceedings of the Languages and Compilers for Parallel Computing, 1992

1991
Binding Time Analysis: A New PERspective.
Proceedings of the Symposium on Partial Evaluation and Semantics-Based Program Manipulation, 1991

1990
Calculi for time analysis of functional programs.
PhD thesis, 1990


  Loading...