Verifying higher-order programs with the Dijkstra monad

Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)

Volumn , Issue , 2013, Pages 387-398

  Swamy, Nikhil ^a   Weinberger, Joel ^b   Schlesinger, Cole ^c   Chen, Juan ^a   Livshits, Benjamin ^a  

^a MICROSOFT RESEARCH   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c PRINCETON UNIVERSITY   (United States)

Author keywords

Dynamic languages; Hoare monad; Predicate transformer; Refinement types

Indexed keywords

DYNAMIC LANGUAGES; HIGHER-ORDER PROGRAMS; HOARE MONAD; PREDICATE TRANSFORMERS; REFINEMENT TYPES; TYPE INFERENCE ALGORITHM; VERIFICATION CONDITION; VERIFICATION METHODOLOGY;

ALGORITHMS; HIGH LEVEL LANGUAGES; TOOLS;

INFERENCE ENGINES;

EID: 84883094727     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2491956.2491978     Document Type: Conference Paper

References (38)

1. M. Barnett, R. DeLine, M. Fahndrich, K. R. M. Leino, and W. Schulte. Verification of object-oriented programs with invariants. JOT, 3, 2004.
2. K. Bhargavan, C. Fournet, and N. Guts. Typechecking higher-order security libraries. In APLAS, pages 47-62, 2010.
3. G. M. Bierman, A. D. Gordon, C. Hritçu, and D. Langworthy. Semantic subtyping with an SMT solver. In ICFP, 2010.
4. J. Borgström, A. Gordon, and R. Pucella. Roles, stacks, histories: A triple for Hoare. Technical Report TR-2009-97, Microsoft Research, 2009.
5. J. Borgstrom, J. Chen, and N. Swamy. Verifying stateful programs with substructural state and hoare types. In PLPV, Jan. 2011.
6. R. Cartwright. A Practical Formal Semantic Definition and Verification System for TYPED LISP. Garland Publishing, New York, 1976.
7. R. Cartwright and M. Fagan. Soft typing. In PLDI, 1991.
8. A. Charguéraud. Characteristic formulae for the verification of imperative programs. In ICFP, 2011.
9. J. Chen, R. Chugh, and N. Swamy. Type-preserving compilation of end-to-end verification of security enforcement. In PLDI, 2010.
10. R. Chugh, D. Herman, and R. Jhala. Dependent types for JavaScript. In OOPSLA, 2012a.
11. R. Chugh, P. M. Rondon, and R. Jhala. Nested refinements: a logic for duck typing. In POPL, 2012b.
12. D. Crockford. JavaScript: The Good Parts. O'Reilly Media Inc., 2008.
13. L. de Moura and N. Bjørner. Z3: An efficient SMT solver. In TACAS, 2008.
14. E. W. Dijkstra. Guarded commands, nondeterminacy and formal derivation of programs. Commun. ACM, 18:453-457, August 1975.
15. J.-C. Filliâtre and C. Marché. The why/krakatoa/caduceus platform for deductive program verification. In CAV, pages 173-177, 2007.
16. C. Fournet, N. Swamy, J. Chen, P. Evariste-Dagand, P.-Y. Strub, and B. Livshits. Fully abstract compilation to JavaScript. In POPL, 2013.
17. P. A. Gardner, G. D. Smith, M. J. Wheelhouse, and U. D. Zarfaty. Local Hoare reasoning about DOM. In PODS, 2008.
18. P. A. Gardner, S. Maffeis, and G. D. Smith. Towards a program logic for Javascript. In POPL, 2012.
19. S. Guarnieri and B. Livshits. Gatekeeper: Mostly static enforcement of security and reliability policies for JavaScript code. In USENIX Security, 2009.
20. A. Guha, C. Saftoiu, and S. Krishnamurthi. The essence of JavaScript. In ECOOP, 2010.
21. A. Guha, M. Fredrikson, B. Livshits, and N. Swamy. Verified security for browser extensions. In IEEE Symposium on Security and Privacy, 2011.
22. F. Henglein. Dynamic typing: syntax and proof theory. Science of Computer Programming, 22:197-230, 1994.
23. F. Henglein and J. Rehof. Safe polymorphic type inference for Scheme: Translating Scheme to ML. In FPCA, pages 192-203, 1995.
24. S. H. Jensen, A. Møller, and P. Thiemann. Type analysis for JavaScript. In SAS, pages 238-255, 2009.
25. N. Kobayashi, R. Sato, and H. Unno. Predicate abstraction and CEGAR for higher-order model checking. In PLDI, pages 222-233, 2011.
26. K. R. M. Leino. Dafny: An automatic program verifier for functional correctness. In LPAR (Dakar), pages 348-370, 2010.
27. K. R. M. Leino and P. Rümmer. A polymorphic intermediate verification language: Design and logical encoding. In TACAS, 2010.
28. J. McCarthy. Towards a mathematical science of computation. In IFIP Congress, pages 21-28, 1962.
29. A. Nanevski, A. Ahmed, G. Morrisett, and L. Birkedal. Abstract predicates and mutable adts in hoare type theory. In ESOP, pages 189-204, 2007.
30. A. Nanevski, G. Morrisett, A. Shinnar, P. Govereau, and L. Birkedal. Ynot: dependent types for imperative programs. In ICFP, 2008a.
31. A. Nanevski, J. G. Morrisett, and L. Birkedal. Hoare type theory, polymorphism and separation. J. Funct. Program., 18(5-6):865-911, 2008b.
32. P. W. O'Hearn, H. Yang, and J. C. Reynolds. Separation and information hiding. In POPL, 2004.
33. M. Parkinson and G. Bierman. Separation logic and abstraction. In POPL, 2005.
34. P. M. Rondon, M. Kawaguchi, and R. Jhala. Liquid types. In PLDI, 2008.
35. N. Swamy, J. Chen, C. Fournet, P.-Y. Strub, K. Bhargavan, and J. Yang. Secure distributed programming with value-dependent types. In ICFP, 2011a.
36. N. Swamy, N. Guts, D. Leijen, and M. Hicks. Lightweight monadic programming in ML. In ICFP, 2011b.
37. S. Tobin-Hochstadt and M. Felleisen. Logical types for untyped languages. In ICFP, 2010.
38. D. Vardoulakis and O. Shivers. CFA2: a Context-Free Approach to Control-Flow Analysis. Logical Methods in Computer Science, 7(2:3), 2011.