Implementing polymorphism in SMT solvers

ACM International Conference Proceeding Series

Volumn , Issue , 2008, Pages 1-5

  Bobot, François ^a,b   Conchon, Sylvain ^a,b   Contejean, Evelyne ^a,b   Lescuyer, Stéphane ^a,b  

^a Laboratoire Interdisciplinaire des Sciences du Numérique   (France)

^b INRIA SACLAY   (France)

Author keywords

[No Author keywords available]

Indexed keywords

PARAMETRIC POLYMORPHISM; TYPE VARIABLES;

POLYMORPHISM;

TECHNICAL PRESENTATIONS;

EID: 67650705521     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1512464.1512466     Document Type: Conference Paper

References (12)

1. F. Baader and W. Snyder. Unification Theory. In A. Robinson and A. Voronkov, editors, Handbook of Automated Reasoning, volume I, chapter 8, pages 447-533. Elsevier Science, 2001.
2. J.-F. Couchot and S. Lescuyer. Handling polymorphism in automated deduction. In 21th International Conference on Automated Deduction (CADE-21), volume 4603 of LNCS (LNAI), pages 263-278, Bremen, Germany, July 2007. (Pubitemid 47545115)
3. J.-C. Filliâtre and C. Marché. Multi-prover verification of C programs. In J. Davies, W. Schulte, and M. Barnett, editors, 6th International Conference on Formal Engineering Methods, volume 3308 of Lecture Notes in Computer Science, pages 15-29, Seattle, WA, USA, Nov. 2004. Springer. (Pubitemid 39750922)
4. J.-C. Filliâtre and C. Marché. Multi-prover verification of C programs. In J. Davies, W. Schulte, and M. Barnett, editors, 6th International Conference on Formal Engineering Methods, volume 3308 of Lecture Notes in Computer Science, pages 15-29, Seattle, WA, USA, Nov. 2004. Springer. (Pubitemid 44850698)
5. J.-C. Filliâtre and C. Marché. The Why/Krakatoa/Caduceus platform for deductive program verification. In W. Damm and H. 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.
6. T. Hubert and C. Marché. Separation analysis for deductive verification. In Heap Analysis and Verification (HAV'07), pages 81-93, Braga, Portugal, Mar. 2007. http://www.lri.fr/~marche/hubert07hav.pdf.
7. D. Le Botlan and D. Rémy. MLF: Raising ML to the power of System F. In Proceedings of the Eighth ACM SIGPLAN International Conference on Functional Programming, pages 27-38, Aug. 2003.
8. K. R. M. Leino and A. Wallenburg. Class-local object invariants. In ISEC '08: Proceedings of the 1st conference on India software engineering conference, pages 57-66, New York, NY, USA, 2008. ACM.
9. R. Milner. A theory of type polymorphismn programming. J. Comput. Syst. Sci., 17, 1978.
10. B. C. Pierce. Types and Programming Languages, chapter V. MIT Press, 2002.
11. S. Ranise and C. Tinelli. The Satisfiability Modulo Theories Library (SMT-LIB). http://www.smtcomp.org, 2006.
12. H. Tuch, G. Klein, and M. Norrish. Types, bytes, and separation logic. In M. Hofmann and M. Felleisen, editors, Proc. 34th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL'07), pages 97-108, Nice, France, Jan. 2007.