Certified result checking for polyhedral analysis of bytecode programs

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

Volumn 6084 LNCS, Issue , 2010, Pages 253-267

  Besson, Frédéric ^a   Jensen, Thomas ^a   Pichardie, David ^a   Turpin, Tiphaine ^a  

^a INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ANALYSIS RESULTS; BYTECODE LANGUAGES; BYTECODE PROGRAMS; CONVEX HULL; CORRECTNESS PROOFS; FARKAS LEMMA; GLOBAL VARIABLES; POLYHEDRAL ANALYSIS;

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

THEOREM PROVING;

EID: 77958049460     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15640-3_17     Document Type: Conference Paper

References (26)

1. Allen, S.F., Constable, R.L., Howe, D.J., Aitken, W.E.: The semantics ofreflected proof. In: Proceedings of the Fifth Annual IEEE Symposium on Logic in Computer Science, pp. 95-105. IEEE Computer Society, Los Alamitos (1990)
2. Barthe, G., Dufay, G.: A tool-assisted framework for certified bytecode verification. In: Wermelinger, M., Margaria-Steffen, T. (eds.) FASE 2004. LNCS, vol. 2984, pp. 99-113. Springer, Heidelberg (2004)
3. Besson, F.: Fast reflexive arithmetic tactics: the linear case and beyond. In: Altenkirch, T., McBride, C. (eds.) TYPES 2006. LNCS, vol. 4502, pp. 48-62. Springer, Heidelberg (2006)
4. Besson, F., Jensen, T., Pichardie, D., Turpin, T.: Result certification for relational program analysis. Research Report 6333, Inria (2007)
5. http://hal.inria.fr/inria-00166930/
6. Besson, F., Jensen, T., Turpin, T.: Small witnesses for abstract interpretation based proofs. In: De Nicola, R. (ed.) ESOP 2007. LNCS, vol. 4421, p 268-283. Springer, Heidelberg (2007)
7. Cachera, D., Jensen, T., Pichardie, D., Rusu, V.: Extracting a Data Flow Analyser in Constructive Logic. Theoretical Computer Science 342(1), 56-78 (2005)
8. Chernikova, N.V.: Algorithm for finding a general formula for the non-negative so-lutions of a system of linear inequalities. U.S.S.R Comp. Mathematics and Math-ematical Physics 5(2), 228-233 (1965)
9. Cousot, P., Cousot, R.: Abstract interpretation: A unified lattice model for static analysis of programs by construction of approximations of fixpoints. In: Proc. of 4th ACM Symp. on Principles of Programming Languages, pp. 238-252. ACM Press, New York (1977)
10. Cousot, P., Cousot, R., Feret, J., Mauborgne, L., Mińe, A., Monniaux, D., Rival, X.: The Astŕee analyser. In: Sagiv, M. (ed.) ESOP 2005. LNCS, vol. 3444, pp. 21-30. Springer, Heidelberg (2005)
11. Cousot, P., Halbwachs, N.: Automatic discovery oflinear restraints among variables of a program. In: Proc. of 5th ACM Symp. on Principles of Programming Languages (POPL 1978), pp. 84-97. ACM Press, New York (1978)
12. Gŕegoire, B., Leroy, X.: A compiled implementation ofstrong reduction. In: Proc. of the 7th ACM international conference on Functional programming (ICFP 2002), pp. 235-246. ACM Press, New York (2002)
13. Jeannet, B., the Apron team: The Apron library (2007)
14. Klein, G., Nipkow, T.: Verified Bytecode Verifiers. Theoretical Computer Sci-ence 298(3), 583-626 (2002)
15. Lee, D.K., Crary, K., Harper, R.: Towards a mechanized metatheory of Standard ML. In: Proc. of 34th ACM Symp. on Principles of Programming Languages (POPL 2007), pp. 173-184. ACM Press, New York (2007)
16. Leroy, X.: Formal certification of a compiler back-end or: programming a com-piler with a proof assistant. In: Proc. of the 33rd ACM Symp. on Principles of Programming Languages, pp. 42-54. ACM Press, New York (2006)
17. Mińe, A.: The octagon abstract domain. Higher-Order and Symbolic Computation 19, 31-100 (2006)
18. Müller-Olm, M., Seidl, H.: Precise interprocedural analysis through linear algebra. In: Proc. of 31st ACM Symp. on Principles of Programming Languages (POPL 2004), pp. 330-341. ACM Press, New York (2004)
19. Pichardie, D.: Interpŕetation abstraite en logique intuitioniste: extraction d'analyseurs Java certifíes. PhD thesis, Universit́e de Rennes 1 (2005)
20. Schrijver, A.: Theory of Linear and Integer Programming. Wiley, Chichester (1998)
21. Wasserman, H., Blum, M.: Software reliability via run-time result-checking. Journal of the ACM 44(6), 826-849 (1997)
22. Wildmoser, M., Chaieb, A., Nipkow, T.: Bytecode analysis for proofcarrying code. In: Proc. of 1st Workshop on Bytecode Semantics, Verification and Transformation, ENTCS (2005)
23. Wildmoser, M., Nipkow, T.: Asserting bytecode safety. In: Sagiv, M. (ed.) ESOP 2005. LNCS, vol. 3444, pp. 326-341. Springer, Heidelberg (2005)
24. The Coq development of the work http://www.irisa.fr/celtique/ext/ polycert/
25. Xi, H.: Imperative Programming with Dependent Types. In: Proc. of 15th IEEE Symposium on Logic in Computer Science (LICS 2000), pp. 375-387. IEEE, Los Alamitos (2000)
26. Xi, H., Xia, S.: Towards Array Bound Check Elimination in Java Virtual Machine Language. In: Proc. of CASCOON 1999, pp. 110-125 (1999)