Expressing polymorphic types in a many-sorted language

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6989 LNAI, Issue , 2011, Pages 87-102

  Bobot, François ^a,b   Paskevich, Andrei ^a,b  

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

^b INRIA SACLAY   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

AUTOMATED THEOREM PROVER; FIRST ORDER LOGIC; FORMAL DESCRIPTION; LAST STAGE; POLYMORPHIC TYPES; SMT SOLVERS; SOUND AND COMPLETE; TRANSLATION PROCEDURES;

FORMAL LOGIC;

EID: 80054020370     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-24364-6_7     Document Type: Conference Paper

References (17)

1. Barrett, C., Stump, A., Tinelli, C.: The SMT-LIB Standard: Version 2.0. Tech. rep., Department of Computer Science, The University of Iowa (2010)
2. Barrett, C.W., Tinelli, C.: CVC3. In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, vol. 4590, pp. 298-302. Springer, Heidelberg (2007)
3. Bobot, F., Conchon, S., Contejean, E., Lescuyer, S.: Implementing polymorphism in SMT solvers. In: SMT 2008. ACM ICPS, vol. 367, pp. 1-5 (2008)
4. Bobot, F., Filliâtre, J.C., Marché, C., Paskevich, A.: Why3: Shepherd your herd of provers. In: Boogie 2011 (co-loc. with CADE-23), Wrocław, Poland (August 2011)
5. Bobot, F., Paskevich, A.: Expressing polymorphic types in a many-sorted language (extended version) (July 2011), http://hal.inria.fr/inria-00591414/en/
6. Couchot, J.F., Lescuyer, S.: Handling polymorphism in automated deduction. In: Pfenning, F. (ed.) CADE 2007. LNCS (LNAI), vol. 4603, pp. 263-278. Springer, Heidelberg (2007)
7. Dutertre, B., de Moura, L.: The YICES SMT solver. Tech. rep., SRI International (2006)
8. Filliâtre, J.C., Marché, C.: Multi-prover verification of C programs. In: Davies, J., Schulte,W., Barnett, M. (eds.) ICFEM 2004. LNCS, vol. 3308, pp. 15-29. Springer, Heidelberg (2004)
9. Hurd, J.: An LCF-style interface between HOL and first-order logic. In:Voronkov,A. (ed.)CADE2002.LNCS (LNAI), vol. 2392, pp. 134-138. Springer,Heidelberg (2002)
10. Hurd, J.: First-order proof tactics in higher-order logic theorem provers. In: Design and Application of Strategies/Tactics in Higher Order Logics. NASA Technical Report NASA/CP-2003-212448, pp. 56-68 (2003)
11. Leino, K.R.M., Rümmer, P.: A polymorphic intermediate verification language: Design and logical encoding. In: Esparza, J., Majumdar, R. (eds.) TACAS 2010. LNCS, vol. 6015, pp. 312-327. Springer, Heidelberg (2010)
12. Manzano, M.: Extensions of First-Order Logic, Cambridge Tracts in Theoretical Computer Science, vol. 19. Cambridge University Press, Cambridge (1996)
13. Marché, C., Moy, Y.: Jessie plug-in (2010), http://frama-c.com/ jessie.html
14. Meng, J., Paulson, L.C.: Translating higher-order clauses to first-order clauses. Journal of Automated Reasoning 40(1), 35-60 (2008)
15. de Moura, L., Bjørner, N.: Z3: An efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337-340. Springer, Heidelberg (2008)
16. Nipkow, T., Paulson, L.C., Wenzel, M.T.: Isabelle/HOL - A Proof Assistant for Higher-Order Logic. LNCS, vol. 2283. Springer, Heidelberg (2002)
17. The Coq Development Team: The Coq Proof Assistant Reference Manual - Version V8.0 (2004), http://coq.inria.fr