BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Austria
1 × Denmark
1 × France
1 × Germany
1 × Hungary
1 × India
1 × Italy
1 × Spain
1 × United Kingdom
2 × The Netherlands
5 × USA
Collaborated with:
∅ S.Hunt N.Broberg D.Demange J.Gustavsson A.Sabelfeld A.Moran F.Henglein H.Ebadi G.Schneider C.Hankin D.L.Métayer
Talks about:
program (5) flow (5) transform (4) correct (3) inform (3) improv (3) secur (3) type (3) time (3) base (3)

Person: David Sands

DBLP DBLP: Sands:David

Facilitated 1 volumes:

ESOP 2001Ed

Contributed to:

POPL 20152015
ESOP 20112011
POPL 20102010
ESOP 20092009
ESOP 20082008
ESOP 20062006
POPL 20062006
ICFP 20012001
ESOP 19991999
POPL 19991999
POPL 19971997
PEPM 19951995
PPDP 19951995
POPL 19951995
WSA 19921992
PEPM 19911991
ESOP 19901990
TAPSOFT CAAP/FASE 19951995
TAPSOFT 19951996

Wrote 19 papers:

POPL-2015-EbadiSS #difference #privacy
Differential Privacy: Now it’s Getting Personal (HE, DS, GS), pp. 69–81.
ESOP-2011-HuntS #exponential #polynomial #security #type system
From Exponential to Polynomial-Time Security Typing via Principal Types (SH, DS), pp. 297–316.
POPL-2010-BrobergS #data flow #named
Paralocks: role-based information flow control and beyond (NB, DS), pp. 431–444.
ESOP-2009-DemangeS
All Secrets Great and Small (DD, DS), pp. 207–221.
ESOP-2008-HuntS #semantics
Just Forget It — The Semantics and Enforcement of Information Erasure (SH, DS), pp. 239–253.
ESOP-2006-BrobergS #calculus #policy #towards
Flow Locks: Towards a Core Calculus for Dynamic Flow Policies (NB, DS), pp. 180–196.
POPL-2006-HuntS #on the #security
On flow-sensitive security types (SH, DS), pp. 79–90.
ICFP-2001-GustavssonS #call-by
Possibilities and Limitations of Call-by-Need Space Improvement (JG, DS), pp. 265–276.
ESOP-1999-SabelfeldS #data flow #source code
A Per Model of Secure Information Flow in Sequential Programs (AS, DS), pp. 40–58.
POPL-1999-MoranS #call-by #lazy evaluation
Improvement in a Lazy Context: An Operational Theory for Call-by-Need (AM, DS), pp. 43–56.
POPL-1997-Sands #functional #proving
From SOS Rules to Proof Principles: An Operational Metatheory for Functional Languages (DS), pp. 428–441.
PEPM-1995-Sands #higher-order
Higher Order Expression Procedures (DS), pp. 178–189.
PLILP-1995-HengleinS #partial evaluation #semantics
A Semantic Model of Binding Times for Safe Partial Evaluation (FH, DS), pp. 299–320.
POPL-1995-Sands #correctness #program transformation
Total Correctness by Local Improvement in Program Transformation (DS), pp. 221–232.
WSA-1992-HankinMS #source code
Transformation of Gamma Programs (CH, DLM, DS), pp. 12–19.
PEPM-1991-HuntS #analysis #perspective
Binding Time Analysis: A New PERspective (SH, DS), pp. 154–165.
ESOP-1990-Sands #analysis #complexity #higher-order #lazy evaluation
Complexity Analysis for a Lazy Higher-Order Language (DS), pp. 361–376.
TAPSOFT-1995-Sands #automation #correctness #program transformation #proving #recursion
Proving the Correctness of Recursion-Based Automatic Program Transformations (DS), pp. 681–695.
TAPSOFT-J-1995-Sands96 #automation #correctness #program transformation #proving #recursion
Proving the Correctness of Recursion-Based Automatic Program Transformations (DS), pp. 193–233.
Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.