Verifying stateful programs with substructural state and hoare types

PLPV'11 - Proceedings of the 5th ACM Workshop on Programming Languages Meets Program Verification

Volumn , Issue , 2011, Pages 15-26

  Borgström, Johannes ^a   Chen, Juan ^b   Swamy, Nikhil ^b  

^a UPPSALA UNIVERSITY   (Sweden)

^b MICROSOFT RESEARCH   (United States)

Author keywords

Affine types; Dependent types; Security type systems

Indexed keywords

AFFINE TYPES; ALIASING; DEPENDENT TYPES; DESIGN SPACES; FUNCTIONAL LANGUAGES; FUNCTIONAL PROGRAMS; HOARE LOGIC; INFORMATION FLOWS; MODEL STATE; MODULAR VERIFICATION; OBJECT BASED; OBJECT INVARIANTS; SECURITY TYPE SYSTEMS; TYPECHECKING;

MODEL CHECKING; OBJECT ORIENTED PROGRAMMING; SURFACE MOUNT TECHNOLOGY; TRANSLATION (LANGUAGES);

PROGRAM TRANSLATORS;

EID: 79952125780     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1929529.1929532     Document Type: Conference Paper

References (33)

1. M. Abadi, A. Banerjee, N. Heintze, and J. G. Riecke. A core calculus of dependency. In POPL, 1999.
2. 3: A linear language with locations. Fundamenta Informaticae, 77(4):397-449, 2007. (Pubitemid 47190513)
3. J. Bengtson, K. Bhargavan, C. Fournet, A. D. Gordon, and S. Maffeis. Refinement types for secure implementations. In CSF, 2008.
4. K. Bierhoff and J. Aldrich. Modular typestate checking of aliased objects. OOPSLA, 2007.
5. J. Borgström, J. Chen, and N. Swamy. Hoare-types for programming with affinity. Technical Report TR-2010-95, MSR, 2010.
6. J. Borgström, A. Gordon, and R. Pucella. Roles, stacks, histories: A triple for Hoare. J. Funct. Program., 2010. To appear.
7. J. Boyland. Checking interference with fractional permissions. In SAS, pages 55-72. Springer, 2003.
8. I. Cervesato and F. Pfenning. A linear logical framework. Inf. Comput., 179 (1), 2002.
9. A. Charguéraud and F. Pottier. Functional translation of a calculus of capabilities. In ICFP '08, 2008.
10. J. Chen, R. Chugh, and N. Swamy. Type-preserving compilation of end-to-end verification of security enforcement. In PLDI '10. ACM, 2010.
11. A. Chlipala, G. Malecha, G. Morrisett, A. Shinnar, and R. Wisnesky. Effective interactive proofs for higher-order imperative programs. In ICFP, 2009.
12. L. de Moura and N. Bjorner. Z3: An efficient SMT solver. In TACAS, 2008.
13. M. Fähndrich and R. DeLine. Adoption and focus: practical linear types for imperative programming. In PLDI, 2002.
14. J. Fenton. Information Protection Systems. PhD thesis, U. Cambridge, 1973.
15. C. Flanagan. Hybrid type checking. In POPL, 2006.
16. C. Flanagan, A. Sabry, B. F. Duba, and M. Felleisen. The essence of compiling with continuations. In PLDI, 1993.
17. C. Flanagan, S. N. Freund, and A. Tomb. Hybrid types, invariants, and refinements for imperative objects. In FOOL/WOOD '06, 2006.
18. D. Grossman, G. Morrisett, and S. Zdancewic. Syntactic type abstraction. ACM TOPLAS, 22(6):1037-1080, 2000. ISSN 0164-0925.
19. D. Jackson. Alloy: a lightweight object modelling notation. TOSEM, 11(2), 2002.
20. S. Krishnamurthi. The Continue server. In PADL, 2003.
21. N. R. Krishnaswami, J. Aldrich, L. Birkedal, K. Svendsen, and A. Buisse. Design patterns in separation logic. In TLDI, 2009.
22. G. Malecha, G. Morrisett, A. Shinnar, and R. Wisnesky. Toward a verified relational database management system. In POPL, 2010.
23. K. Mazurak, J. Zhao, and S. Zdancewic. Lightweight linear types in System F°. In TLDI, 2010.
24. R. Milner. LCF: A way of doing proofs with a machine. In MFCS, 1979.
25. A. Nanevski, G. Morrisett, and L. Birkedal. Polymorphism and separation in Hoare type theory. In ICFP, 2006.
26. M. Sozeau. Subset coercions in Coq. In TYPES. Springer-Verlag, 2006.
27. N. Swamy. Language-based Enforcement of User-defined Security Policies. PhD thesis, University of Maryland, College Park, August 2008.
28. N. Swamy, J. Chen, and R. Chugh. Enforcing stateful authorization and information flow policies in Fine. In ESOP, 2010a.
29. N. Swamy, J. Chen, C. Fournet, K. Bharagavan, and J. Yang. Security programming with refinement types and mobile proofs. Technical Report MSR-TR-2010-149, Microsoft Research, 2010b.
30. W. Swierstra. A Hoare logic for the state monad. In TPHOLs, 2009.
31. P. Wadler. Linear types can change the world! In PROGRAMMING CONCEPTS AND METHODS. North, 1990.
32. D. Walker, K. Crary, and G. Morrisett. Typed memory management via static capabilities. ACM TOPLAS, 22(4), 2000.
33. D. Zhu and H. Xi. Safe programming with pointers through stateful views. In PADL, 2005.