The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

David Sands: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Heiko Mantel, David Sands
    Controlled Declassification Based on Intransitive Noninterference. [Citation Graph (0, 0)][DBLP]
    APLAS, 2004, pp:129-145 [Conf]
  2. Koen Claessen, David Sands
    Observable Sharing for Functional Circuit Description. [Citation Graph (0, 0)][DBLP]
    ASIAN, 1999, pp:62-73 [Conf]
  3. David Sands, Jörgen Gustavsson, Andrew Moran
    Lambda Calculi and Linear Speedups. [Citation Graph (0, 0)][DBLP]
    The Essence of Computation, 2002, pp:60-84 [Conf]
  4. Andrew Moran, David Sands, Magnus Carlsson
    Erratic Fudgets: A Semantic Theory for an Embedded Coordination Language. [Citation Graph (0, 0)][DBLP]
    COORDINATION, 1999, pp:85-102 [Conf]
  5. Andrei Sabelfeld, David Sands
    Probabilistic Noninterference for Multi-Threaded Programs. [Citation Graph (0, 0)][DBLP]
    CSFW, 2000, pp:200-214 [Conf]
  6. Andrei Sabelfeld, David Sands
    Dimensions and Principles of Declassification. [Citation Graph (0, 0)][DBLP]
    CSFW, 2005, pp:255-269 [Conf]
  7. Daniel Hedin, David Sands
    Noninterference in the Presence of Non-Opaque Pointers. [Citation Graph (0, 0)][DBLP]
    CSFW, 2006, pp:217-229 [Conf]
  8. David Sands
    A Compositional Semantics of Combining Forms for Gramma Programs. [Citation Graph (0, 0)][DBLP]
    Formal Methods in Programming and Their Applications, 1993, pp:43-56 [Conf]
  9. Niklas Broberg, David Sands
    Flow Locks: Towards a Core Calculus for Dynamic Flow Policies. [Citation Graph (0, 0)][DBLP]
    ESOP, 2006, pp:180-196 [Conf]
  10. Andrei Sabelfeld, David Sands
    A Per Model of Secure Information Flow in Sequential Programs. [Citation Graph (0, 0)][DBLP]
    ESOP, 1999, pp:40-58 [Conf]
  11. David Sands
    Complexity Analysis for a Lazy Higher-Order Language. [Citation Graph (0, 0)][DBLP]
    ESOP, 1990, pp:361-376 [Conf]
  12. David Sands
    Complexity Analysis for a Lazy Higher-Order Language. [Citation Graph (0, 0)][DBLP]
    Functional Programming, 1989, pp:56-79 [Conf]
  13. David Sands
    Operational Theories of Improvement in Functional Languages (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    Functional Programming, 1991, pp:298-311 [Conf]
  14. David Sands
    Time Analysis, Cost Equivalence and Program Refinement. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1991, pp:25-39 [Conf]
  15. Jörgen Gustavsson, David Sands
    Possibilities and Limitations of Call-by-Need Space Improvement. [Citation Graph (0, 0)][DBLP]
    ICFP, 2001, pp:265-276 [Conf]
  16. David Sands
    Laws of Parallel Synchronised Termination. [Citation Graph (0, 0)][DBLP]
    Theory and Formal Methods, 1993, pp:276-288 [Conf]
  17. Chris Hankin, Daniel Le Métayer, David Sands
    A Calculus of Gamma Programs. [Citation Graph (0, 0)][DBLP]
    LCPC, 1992, pp:342-355 [Conf]
  18. David Sands
    Probability and Timing: Challenges for Secure Programming. [Citation Graph (0, 0)][DBLP]
    PAPM-PROBMIV, 2002, pp:16- [Conf]
  19. Chris Hankin, Daniel Le Métayer, David Sands
    A Parallel Programming Style and Its Algebra of Programs. [Citation Graph (0, 0)][DBLP]
    PARLE, 1993, pp:367-378 [Conf]
  20. Sebastian Hunt, David Sands
    Binding Time Analysis: A New PERspective. [Citation Graph (0, 0)][DBLP]
    PEPM, 1991, pp:154-165 [Conf]
  21. David Sands
    Higher Order Expression Procedures. [Citation Graph (0, 0)][DBLP]
    PEPM, 1995, pp:178-189 [Conf]
  22. Fritz Henglein, David Sands
    A Semantic Model of Binding Times for Safe Partial Evaluation [Citation Graph (0, 0)][DBLP]
    PLILP, 1995, pp:299-320 [Conf]
  23. Sebastian Hunt, David Sands
    On flow-sensitive security types. [Citation Graph (0, 0)][DBLP]
    POPL, 2006, pp:79-90 [Conf]
  24. Andrew Moran, David Sands
    Improvement in a Lazy Context: An Operational Theory for Call-by-Need. [Citation Graph (0, 0)][DBLP]
    POPL, 1999, pp:43-56 [Conf]
  25. David Sands
    Total Correctness by Local Improvement in Program Transformation. [Citation Graph (0, 0)][DBLP]
    POPL, 1995, pp:221-232 [Conf]
  26. David Sands
    From SOS Rules to Proof Principles: An Operational Metatheory for Functional Languages. [Citation Graph (0, 0)][DBLP]
    POPL, 1997, pp:428-441 [Conf]
  27. Chris Hankin, Daniel Le Métayer, David Sands
    Transformation of Gamma Programs. [Citation Graph (0, 0)][DBLP]
    WSA, 1992, pp:12-19 [Conf]
  28. Johan Agat, David Sands
    On Confidentiality and Algorithms. [Citation Graph (0, 0)][DBLP]
    IEEE Symposium on Security and Privacy, 2001, pp:64-77 [Conf]
  29. Ádám Darvas, Reiner Hähnle, David Sands
    A Theorem Proving Approach to Analysis of Secure Information Flow. [Citation Graph (0, 0)][DBLP]
    SPC, 2005, pp:193-209 [Conf]
  30. David Sands
    Proving the Correctness of Recursion-Based Automatic Program Transformations. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1995, pp:681-695 [Conf]
  31. Jörgen Gustavsson, David Sands
    A Foundation for Space-Safe Transformations of Call-by-Need Programs. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1999, v:26, n:, pp:- [Journal]
  32. Daniel Hedin, David Sands
    Timing Aware Information Flow Security for a JavaCard-like Bytecode. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2005, v:141, n:1, pp:163-182 [Journal]
  33. Andrei Sabelfeld, David Sands
    A Per Model of Secure Information Flow in Sequential Programs. [Citation Graph (0, 0)][DBLP]
    Higher-Order and Symbolic Computation, 2001, v:14, n:1, pp:59-91 [Journal]
  34. David Sands
    A Naïve Time Analysis and its Theory of Cost Equivalence. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 1995, v:5, n:4, pp:495-541 [Journal]
  35. Andrew Moran, David Sands, Magnus Carlsson
    Erratic Fudgets: a semantic theory for an embedded coordination language. [Citation Graph (0, 0)][DBLP]
    Sci. Comput. Program., 2003, v:46, n:1-2, pp:99-135 [Journal]
  36. Chris Hankin, Daniel Le Métayer, David Sands
    Refining Multiset Tranformers. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:192, n:2, pp:233-258 [Journal]
  37. David Sands
    Proving the Correctness of Recursion-Based Automatic Program Transformations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:167, n:1&2, pp:193-233 [Journal]
  38. David Sands
    Total Correctness by Local Improvement in the Transformation of Functional Programs. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 1996, v:18, n:2, pp:175-234 [Journal]

  39. Lightweight self-protecting JavaScript. [Citation Graph (, )][DBLP]


  40. Security Policy Enforcement in the OSGi Framework Using Aspect-Oriented Programming. [Citation Graph (, )][DBLP]


  41. Just Forget It - The Semantics and Enforcement of Information Erasure. [Citation Graph (, )][DBLP]


  42. All Secrets Great and Small. [Citation Graph (, )][DBLP]


  43. Termination-Insensitive Noninterference Leaks More Than Just a Bit. [Citation Graph (, )][DBLP]


  44. Specification and Verification of Side Channel Declassification. [Citation Graph (, )][DBLP]


  45. Improving the Semantics of Imperfect Security. [Citation Graph (, )][DBLP]


  46. Flow-sensitive semantics for dynamic information flow policies. [Citation Graph (, )][DBLP]


  47. Paralocks: role-based information flow control and beyond. [Citation Graph (, )][DBLP]


  48. A User Model for Information Erasure [Citation Graph (, )][DBLP]


  49. Specification and Verification of Side Channel Declassification [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002