default search action
David Sands 0001
Person information
- affiliation: Chalmers University of Technology, Gothenburg, Sweden
Other persons with the same name
- David Sands — disambiguation page
- David Sands 0002
— University of Hull, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j9]Sebastian Hunt
Reconciling Shannon and Scott with a Lattice of Computable Information. Proc. ACM Program. Lang. 7(POPL): 1987-2016 (2023) - 2022
- [c56]Matthías Páll Gissurarson, Leonhard Applis, Annibale Panichella, Arie van Deursen
PROPR: Property-Based Automatic Program Repair. ICSE 2022: 1768-1780 - [i9]Sebastian Hunt, David Sands, Sandro Stucki:
Reconciling Shannon and Scott with a Lattice of Computable Information. CoRR abs/2211.10099 (2022) - 2021
- [c55]Sebastian Hunt
A Quantale of Information. CSF 2021: 1-15 - 2020
- [c54]Sebastian Hunt
New Program Abstractions for Privacy. From Lambda Calculus to Cybersecurity Through Program Analysis 2020: 256-267
2010 – 2019
- 2019
- [e3]Flemming Nielson, David Sands:
Principles of Security and Trust - 8th International Conference, POST 2019, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2019, Prague, Czech Republic, April 6-11, 2019, Proceedings. Lecture Notes in Computer Science 11426, Springer 2019, ISBN 978-3-030-17137-7 [contents] - 2018
- [c53]Srinivas Pinisetty, Gerardo Schneider, David Sands:
Runtime verification of hyperproperties for deterministic programs. FormaliSE@ICSE 2018: 20-29 - [i8]Srinivas Pinisetty, Thibaud Antignac, David Sands, Gerardo Schneider:
Monitoring Data Minimisation. CoRR abs/1801.02484 (2018) - 2017
- [j8]Niklas Broberg, Bart van Delft, David Sands:
Paragon - Practical programming with information flow control. J. Comput. Secur. 25(4-5): 323-365 (2017) - [c52]Thibaud Antignac
Data Minimisation: A Language-Based Approach. SEC 2017: 442-456 - [e2]Thomas Eiter, David Sands, Geoff Sutcliffe, Andrei Voronkov:
IWIL@LPAR 2017 Workshop and LPAR-21 Short Presentations, Maun, Botswana, May 7-12, 2017. Kalpa Publications in Computing 1, EasyChair 2017 [contents] - [e1]Thomas Eiter, David Sands:
LPAR-21, 21st International Conference on Logic for Programming, Artificial Intelligence and Reasoning, Maun, Botswana, May 7-12, 2017. EPiC Series in Computing 46, EasyChair 2017 [contents] - 2016
- [j7]Hamid Ebadi
Featherweight PINQ. J. Priv. Confidentiality 7(2) (2016) - [c51]Filippo Del Tedesco, David Sands, Alejandro Russo
Fault-Resilient Non-interference. CSF 2016: 401-416 - [c50]Hamid Ebadi, Thibaud Antignac, David Sands:
Sampling and partitioning for differential privacy. PST 2016: 664-673 - [i7]Thibaud Antignac, David Sands, Gerardo Schneider:
Data Minimisation: a Language-Based Approach (Long Version). CoRR abs/1611.05642 (2016) - 2015
- [c49]Niklas Broberg, Bart van Delft, David Sands:
The Anatomy and Facets of Dynamic Policies. CSF 2015: 122-136 - [c48]Hamid Ebadi, David Sands, Gerardo Schneider:
Differential Privacy: Now it's Getting Personal. POPL 2015: 69-81 - [c47]Bart van Delft, Sebastian Hunt
Very Static Enforcement of Dynamic Policies. POST 2015: 32-52 - [i6]Bart van Delft, Sebastian Hunt, David Sands:
Very Static Enforcement of Dynamic Policies. CoRR abs/1501.02633 (2015) - [i5]Niklas Broberg, Bart van Delft, David Sands:
The Anatomy and Facets of Dynamic Policies. CoRR abs/1505.02021 (2015) - [i4]Hamid Ebadi, David Sands:
Featherweight PINQ. CoRR abs/1505.02642 (2015) - 2014
- [c46]Niklas Broberg, Bart van Delft, David Sands:
Paragon: Programming with Information Flow Control (Demo). PLAS@ECOOP 2014: 79 - [c45]Filippo Del Tedesco, Alejandro Russo
Fault-Tolerant Non-interference. ESSoS 2014: 60-76 - [p1]Bart van Delft, Niklas Broberg, David Sands:
Programming in Paragon. Software Systems Safety 2014: 279-308 - [i3]Filippo Del Tedesco, David Sands, Alejandro Russo:
Type-Directed Compilation for Fault-Tolerant Non-Interference. CoRR abs/1410.4917 (2014) - 2013
- [c44]Niklas Broberg, Bart van Delft, David Sands:
Paragon for Practical Programming with Information-Flow Control. APLAS 2013: 217-232 - [c43]David Sands:
Fault-tolerant non-interference: invited talk abstract. PLAS 2013: 1-2 - 2012
- [c42]Bart van Delft, Niklas Broberg, David Sands:
A Datalog Semantics for Paralocks. STM 2012: 305-320 - 2011
- [c41]Heiko Mantel, David Sands, Henning Sudbrock:
Assumptions and Guarantees for Compositional Noninterference. CSF 2011: 218-232 - [c40]Sebastian Hunt
From Exponential to Polynomial-Time Security Typing via Principal Types. ESOP 2011: 297-316 - [c39]Filippo Del Tedesco, Sebastian Hunt
A Semantic Hierarchy for Erasure Policies. ICISS 2011: 352-369 - [i2]Filippo Del Tedesco, Sebastian Hunt, David Sands:
A Semantic Hierarchy for Erasure Policies. CoRR abs/1109.6914 (2011) - 2010
- [c38]Filippo Del Tedesco, Alejandro Russo
Implementing Erasure Policies Using Taint Analysis. NordSec 2010: 193-209 - [c37]Jonas Magazinius, Phu H. Phung
Safe Wrappers and Sane Policies for Self Protecting JavaScript. NordSec 2010: 239-255 - [c36]Niklas Broberg, David Sands:
Paralocks: role-based information flow control and beyond. POPL 2010: 431-444
2000 – 2009
- 2009
- [j6]Andrei Sabelfeld, David Sands:
Declassification: Dimensions and principles. J. Comput. Secur. 17(5): 517-548 (2009) - [c35]Phu H. Phung
Lightweight self-protecting JavaScript. AsiaCCS 2009: 47-60 - [c34]Delphine Demange, David Sands:
All Secrets Great and Small. ESOP 2009: 207-221 - [c33]Niklas Broberg, David Sands:
Improving the Semantics of Imperfect Security. ARSPA-WITS 2009: 88-91 - [c32]Josef Svenningsson, David Sands:
Specification and Verification of Side Channel Declassification. Formal Aspects in Security and Trust 2009: 111-125 - [c31]Niklas Broberg, David Sands:
Flow-sensitive semantics for dynamic information flow policies. PLAS 2009: 101-112 - [c30]Filippo Del Tedesco, David Sands:
A User Model for Information Erasure. SECCO 2009: 16-30 - [i1]Josef Svenningsson, David Sands:
Specification and Verification of Side Channel Declassification. CoRR abs/0912.2952 (2009) - 2008
- [c29]Phu H. Phung
Security Policy Enforcement in the OSGi Framework Using Aspect-Oriented Programming. COMPSAC 2008: 1076-1082 - [c28]Sebastian Hunt
Just Forget It - The Semantics and Enforcement of Information Erasure. ESOP 2008: 239-253 - [c27]Aslan Askarov, Sebastian Hunt
Termination-Insensitive Noninterference Leaks More Than Just a Bit. ESORICS 2008: 333-348 - 2006
- [c26]Daniel Hedin, David Sands:
Noninterference in the Presence of Non-Opaque Pointers. CSFW 2006: 217-229 - [c25]Niklas Broberg, David Sands:
Flow Locks: Towards a Core Calculus for Dynamic Flow Policies. ESOP 2006: 180-196 - [c24]Sebastian Hunt
On flow-sensitive security types. POPL 2006: 79-90 - 2005
- [c23]Andrei Sabelfeld, David Sands:
Dimensions and Principles of Declassification. CSFW 2005: 255-269 - [c22]Ádám Darvas, Reiner Hähnle, David Sands:
A Theorem Proving Approach to Analysis of Secure Information Flow. SPC 2005: 193-209 - [c21]Daniel Hedin, David Sands:
Timing Aware Information Flow Security for a JavaCard-like Bytecode. Bytecode@ETAPS 2005: 163-182 - 2004
- [c20]Heiko Mantel, David Sands:
Controlled Declassification Based on Intransitive Noninterference. APLAS 2004: 129-145 - 2003
- [j5]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
- [c19]David Sands, Jörgen Gustavsson, Andrew Moran:
Lambda Calculi and Linear Speedups. The Essence of Computation 2002: 60-84 - [c18]David Sands:
Probability and Timing: Challenges for Secure Programming. PAPM-PROBMIV 2002: 16 - 2001
- [j4]Andrei Sabelfeld, David Sands:
A Per Model of Secure Information Flow in Sequential Programs. High. Order Symb. Comput. 14(1): 59-91 (2001) - [c17]Jörgen Gustavsson, David Sands:
Possibilities and Limitations of Call-by-Need Space Improvement. ICFP 2001: 265-276 - 2000
- [c16]Andrei Sabelfeld, David Sands:
Probabilistic Noninterference for Multi-Threaded Programs. CSFW 2000: 200-214
1990 – 1999
- 1999
- [c15]Koen Claessen, David Sands:
Observable Sharing for Functional Circuit Description. ASIAN 1999: 62-73 - [c14]Andrew Moran, David Sands, Magnus Carlsson:
Erratic Fudgets: A Semantic Theory for an Embedded Coordination Language. COORDINATION 1999: 85-102 - [c13]Andrei Sabelfeld, David Sands:
A Per Model of Secure Information Flow in Sequential Programs. ESOP 1999: 40-58 - [c12]Andrew Moran, David Sands:
Improvement in a Lazy Context: An Operational Theory for Call-by-Need. POPL 1999: 43-56 - [c11]Jörgen Gustavsson, David Sands:
A Foundation for Space-Safe Transformations of Call-by-Need Programs. HOOTS 1999: 69-86 - 1998
- [j3]Chris Hankin, Daniel Le Métayer, David Sands:
Refining Multiset Tranformers. Theor. Comput. Sci. 192(2): 233-258 (1998) - 1997
- [c10]David Sands:
From SOS Rules to Proof Principles: An Operational Metatheory for Functional Languages. POPL 1997: 428-441 - 1996
- [j2]David Sands:
Proving the Correctness of Recursion-Based Automatic Program Transformations. Theor. Comput. Sci. 167(1&2): 193-233 (1996) - 1995
- [j1]David Sands:
A Naïve Time Analysis and its Theory of Cost Equivalence. J. Log. Comput. 5(4): 495-541 (1995) - [c9]David Sands:
Higher Order Expression Procedures. PEPM 1995: 178-189 - [c8]Fritz Henglein, David Sands:
A Semantic Model of Binding Times for Safe Partial Evaluation. PLILP 1995: 299-320 - [c7]David Sands:
Total Correctness by Local Improvement in Program Transformation. POPL 1995: 221-232 - [c6]David Sands:
Proving the Correctness of Recursion-Based Automatic Program Transformations. TAPSOFT 1995: 681-695 - 1993
- [c5]David Sands:
A Compositional Semantics of Combining Forms for Gramma Programs. Formal Methods in Programming and Their Applications 1993: 43-56 - [c4]Chris Hankin, Daniel Le Métayer, David Sands:
A Parallel Programming Style and Its Algebra of Programs. PARLE 1993: 367-378 - 1992
- [c3]Chris Hankin, Daniel Le Métayer, David Sands:
A Calculus of Gamma Programs. LCPC 1992: 342-355 - [c2]Chris Hankin, Daniel Le Métayer, David Sands:
Transformation of Gamma Programs. WSA 1992: 12-19 - 1991
- [c1]Sebastian Hunt
Binding Time Analysis: A New PERspective. PEPM 1991: 154-165 - 1990
- [b1]David Sands:
Calculi for time analysis of functional programs. Imperial College London, UK, 1990
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:54 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: