Who: A verifier for effectful higher-order programs

ML'09 - Proceedings of the 2009 ACM SIGPLAN Workshop on ML

Volumn , Issue , 2009, Pages 39-48

  Kanig, Johannes ^a,b   Filliâtre, Jean Christophe ^a,c  

^a INRIA SACLAY   (France)

^b UFR 919 Laboratoire d'Informatique Pour la Mécanique et les Sciences de l'Ingénieur   (France)

^c CNRS   (France)

Author keywords

Higher order programs; Hoare logic

Indexed keywords

GENERIC CODES; HIGHER ORDER; HIGHER ORDER LOGIC; HIGHER-ORDER FUNCTIONS; HOARE LOGIC; INTERMEDIATE LANGUAGES; MODULAR SPECIFICATIONS; PROGRAMMING LANGUAGE; VERIFICATION TOOLS;

OBJECT ORIENTED PROGRAMMING; QUERY LANGUAGES;

LINGUISTICS;

EID: 70450231797     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. Mike Barnett, K. Rustan M. Leino, and Wolfram Schulte. The Spec# Programming System: An Overview. In Construction and Analysis of Safe, Secure, and Interoperable Smart Devices (CASSIS'04), volume 3362 of Lecture Notes in Computer Science, pages 49-69. Springer, 2004.
2. Mike Barnett, Robert DeLine, Bart Jacobs, Bor-Yuh Evan Chang, and K. Rustan M. Leino. Boogie: A Modular Reusable Verifier for Object-Oriented Programs. In Frank S. de Boer, Marcello M. Bonsangue, Susanne Graf, and Willem-Paul de Roever, editors, Formal Methods for Components and Objects: 4th International Symposium, volume 4111 of LNCS, pages 364-387, 2005.
3. Martin Berger, Kohei Honda, and Nobuko Yoshida. A logical analysis of aliasing in imperative higher-order functions. In ICFP '05: Proceedings of the tenth ACM SIGPLAN international conference on Functional programming, pages 280-293, New York, NY, USA, 2005. ACM.
4. Gérard Boudol. Fair cooperative multithreading or typing termination in a higher-order concurrent imperative language. In Proceedings, 18th International Conference on Concurrency Theory, 2007.
5. Arthur Charguéraud and François Pottier. Functional translation of a calculus of capabilities. In ACM International Conference on Functional Programming (ICFP), pages 213-224, September 2008.
6. J.-C. Filliâtre and F. Pottier. Producing All Ideals of a Forest, Functionally. Journal of Functional Programming, 13(5):945-956, September 2003.
7. Jean-Christophe Filliâtre. Verification of Non-Functional Programs using Interpretations in Type Theory. Journal of Functional Programming, 13(4):709-745, July 2003.
8. Jean-Christophe Filliâtre and Claude Marché. The Why/Krakatoa/Caduceus platform for deductive program verification. In Werner Damm and Holger Hermanns, editors, 19th International Conference on Computer Aided Verification, volume 4590 of Lecture Notes in Computer Science, pages 173-177, Berlin, Germany, July 2007. Springer.
9. Kohei Honda, Nobuko Yoshida, and Martin Berger. An obser-vationally complete program logic for imperative higher-order functions. In In Proc. LICS'05, pages 270-279, 2005.
10. Johannes Kanig and Jean-Christophe Filliâtre. Proof of higher-order programs with effect polymorphism. Technical report, march 2009. URL http://www.lri.fr/~kanig/files/who-theory.pdf.
11. Donald E. Knuth. The Art of Computer Programming, volume 4, Pre-Fascicle 2a: A Draft of Section 7.2.1.1: Generating all n-tuples. Addison-Wesley, September 2001. Circulated electronically. http://www-cs-staff. stanford.edu/~knuth/news.html.
12. Yasunori Koda and Frank Ruskey. A Gray code for the ideals of a forest poset. Journal of Algorithms, 15(2):324-340, September 1993. http://csr.csc.uvic.ca/home/fruskey/Publications/ForestIdeals.ps.
13. P. J. Landin. The mechanical evaluation of expressions. The Computer Journal, 6(4):308-320, 1964.
14. Aleksandar Nanevski, Greg Morrisett, Avraham Shinnar, Paul Govereau, and Lars Birkedal. Ynot: Reasoning with the awkward squad. In ICFP '08: Proceedings of the 13th ACM SIG-PLAN International Conference on Functional Programming, September 2008.
15. Peter W. O'Hearn and John C. Reynolds. From Algol to polymorphic linear lambda-calculus. Journal of the ACM, 47(1): 167-223, 2000.
16. Silvio Ranise and Cesare Tinelli. The Satisfiability Modulo Theories Library (SMT-LIB). http://www.smtcomp.org, 2006.
17. Yann Régis-Gianas and François Pottier. A Hoare logic for call-by-value functional programs. In Proceedings of the Ninth International Conference on Mathematics of Program Construction (MPC'08), pages 305-335, July 2008.
18. The Coq Development Team. The Coq Proof Assistant Reference Manual - Version V8.1, July 2006. http://coq.inria.fr.
19. Mads Tofte and Jean-Pierre Talpin. Region-based memory management. Inf. Comput., 132(2):109-176, 1997.