Generating invariant-based certificates for embedded systems

Transactions on Embedded Computing Systems

Volumn 11, Issue 2, 2012, Pages

  Blech, Jan Olaf ^a   Périn, Michaël ^a  

^a VERIMAG   (France)

Author keywords

Languages; Reliability; Verification

Indexed keywords

ABSTRACT INTERPRETATIONS; AUTOMATIC VERIFICATION TOOLS; COMPONENT-BASED LANGUAGE; DEGREE OF CONFIDENCE; HARDWARE DEVELOPMENT; HARDWARE SYSTEM; HUMAN INTERACTIONS; MODEL CHECKER; PROOF CHECKERS; PROOF STRATEGY; SMALL SYSTEMS; THEOREM PROVERS; VERIFICATION TOOLS;

HARDWARE; MODEL CHECKING; QUERY LANGUAGES; RELIABILITY; STATIC ANALYSIS; VERIFICATION;

OPEN SYSTEMS;

EID: 84864648437     PISSN: 15399087     EISSN: 15583465     Source Type: Journal    
DOI: 10.1145/2220336.2220346     Document Type: Article

References (41)

1. ALUR, R., COURCOUBETIS, C., HALBWACHS, N., HENZINGER, T. A., HO, P. H., NICOLLIN, X., OLIVERO, A., SIFAKIS, J., AND YOVINE, S. 1995. The algorithmic analysis of hybrid systems. Theor. Comput. Sci. 138, 1, 3-34.
2. APPEL, A. W. 2001. Foundational proof-carrying code. In Proceedings of the Annual IEEE Symposium on Logic in Computer Science (LICS'01).
3. APPEL, A. W., MICHAEL, N., STUMP, A., AND VIRGA, R. 2003. A trustworthy proof checker. J. Autom. Reason 31, 3-4, 231-260.
4. ARMAND, M., GR ́eGOIRE, B., SPIWACK, A., AND TH ́eRY, L. 2010. Extending Coq with imperative features and its application to SAT verication. In Proceedings of the 1st International Conference on Interactive Theorem Proving (ITP'10).
5. BARRAS, B. 1996. Verification of the interface of a small proof system in Coq. In Proceedings of the International Workshop on Types for Proofs and Programs (TYPES'96). Lecture Notes in Computer Science, vol. 1512, Springer-Verlag, Berlin, 28-45. (Pubitemid 128151621)
6. BASU, A., BOZGA, M., AND SIFAKIS, J. 2006. Modeling heterogeneous real-time components in BIP. In Proceedings of the 4th Conference on Software Engineering and Formal Methods (SEFM'06). 3-12.
7. BENSALEM, S. AND LAKHNECH, Y. 1999. Automatic generation of invariants. Formal Methods Syst. Design 151, 1, 75-92.
8. BENSALEM, S., BOZGA, M., SIFAKIS, J., AND NGUYEN, T.-H. 2008. Compositional verification for component-based systems and application. In Proceedings of the 6th Symposium on Automated Technology for Verification and Analysis (ATVA'08). Lecture Notes in Computer Science, vol. 5311, Springer- Verlag, Berlin, 64-79.
9. BESSON, F., JENSEN, T., AND PICHARDIE, D. 2006. Proof-carrying code from certified abstract interpretation and fixpoint compression. Theor. Comput. Sci. 364, 3, 273-291. (Pubitemid 44548156)
10. BLECH, J. O. AND POETZSCH-HEFFTER, A. 2007. A certifying code generation phase. Electron. Notes Theor. Comput. Sci. 190, 4, 65-82. (Pubitemid 350008182)
11. BLECH, J. O. AND GREGOIRE, B. 2008. Certifying code generation with Coq. In Proceedings of the 7th Workshop on Compiler Optimization Meets Compiler Verification (COCV'08).
12. BLECH, J. O. AND P ́eRIN, M. 2009. Certifying Deadlock-freedom for BIP Models. In Proceedings of the 12th International Workshop on Software and Compilers for Embedded Systems (SCOPES'09).
13. BLECH, J. O. AND GREGOIRE, B. 2009. Using checker predicates in certifying code generation. In Proceedings of the 8th Workshop on Compiler Optimization Meets Compiler Verification (COCV'09).
14. BLECH, J. O., NGUYEN, T.-H., AND P ́eRIN, M. 2009. Invariants and robustness of BIP Models. In Proceedings of the Workshop on Invariant Generation (WING'09).
15. BÖHME, S. AND WEBER, T. 2010. Fast LCF-style proof reconstruction for Z3. In Proceedings of the 1st International Conference on Interactive Theorem Proving (ITP'10).
16. CHETALI, B. AND NGUYEN, Q. H. 2008. Industrial use of formal methods for a high-level security evaluation. In Proceedings of the 15th Symposium on Formal Methods in the Development of Computing Systems (FM'08). Lecture Notes in Computer Science, vol. 5014, Springer-Verlag, 198-213.
17. FILLIÂTRE, J.-C. AND MARCH́e , C. 2007. Why/Krakatoa/Caduceus platform for deductive program verification. In Proceedings of the Computer Aided Verification (CAV'07). Lecture Notes in Computer Science, vol. 4590, Springer-Verlag, Berlin.
18. HENZINGER, T., JHALA, R., MAJUMDAR, R., NECULA, G., SUTRE, G., AND WEIMER, W. 2002. Temporalsafety proofs for systems code. In Proceedings of the 14th Conference on Computer Aided Verification (CAV'02). Lecture Notes in Computer Science, vol. 2404, Springer-Verlag, Berlin, 526-538.
19. HENZINGER, T. A., JHALA, R., MAJUMDAR, R., AND MCMILLAN, K. L. 2004. Abstractions from proofs. In Proceedings of the 31st ACM Symposium on Principles of Programming Languages (POPL'04). ACM Press, 232-244.
20. JAFFE, M., LEVESON, N., HEIMDAHL, M., AND MELHART, B. 1991. Software requirements analysis for real-time process-control systems. IEEE Trans. Softw. Eng.
21. LEROY, X. 2006. Formal certification of a compiler back-end or: Programming a compiler with a proof assistant. In Proceedings of the 33rd ACM Symposium on Principles of Programming Languages (POPL'06). 42-54.
22. LESCUYER, S. AND CONCHON, S. 2008. A reflexive formalization of a SAT solver in Coq. In Proceedings of the International Conference on Emerging Trends of Theorem Proving in Higher Order Logics.
23. LEV-AMI, T., IMMERMAN, N., REPS, T. W., SAGIV, S., SRIVASTAVA, S., AND YORSH, G. 2005. Simulating reachability using first-order logic with applications to verification of linked data structures. In Proceedings of the 20th Conference on Automated Deduction (CADE'05). Lecture Notes in Computer Science, vol. 3632, Springer-Verlag, Berlin, 99-115.
24. MCMILLAN, K. L. 2003. Interpolation and SAT-Based model checking. In Proceedings of the 15th Computer Aided Verification (CAV'03). Lecture Notes in Computer Science, vol. 2725, Springer-Verlag, Berlin, 1-13.
25. MOSKAL, M. 2008. Rocket-fast proof checking for SMT solvers. In Proceedings of the 14th Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'08). Lecture Notes in Computer Science, vol. 4963, Springer-Verlag, Berlin.
26. NAMJOSHI, K. S. 2001. Certifying model checkers. In Proceedings of the 13th Computer Aided Verification (CAV'01). Lecture Notes in Computer Science, vol. 2102, Springer-Verlag, Berlin, 2-13. (Pubitemid 33312900)
27. NECULA, G. C. 1997. Proof-carrying code. In Proceedings of the 24th Symposium Principles of Programming Languages (POPL'97). 106-119.
28. NECULA, G. C. 2000. Translation validation for an optimizing compiler. In Proceedings of the ACM Conference on Programming Language Design and Implementation (PLDI'00). 83-94. (Pubitemid 32394085)
29. PNUELI, A., SIEGEL, M., AND SINGERMAN, E. 1998. Translation validation. In Proceedings of the 4th Conference on Tools and Algorihtms for the Construction and Analysis of Systems (TACAS'98). Lecture Notes in Computer Science, vol. 1384, Springer-Verlag, Berlin, 151-166. (Pubitemid 128055542)
30. PRESBURGER, M. 1929. Über die Vollständigkeit eines gewissen systems der arithmetik, in welchem die addition als einzige operation hervortritt. Comptes rendus du I Congrès des Math́ematiciens des Pays Slaves, Warsaw.
31. PUGH, W. 1991. The Omega test: A fast and practical integer programming algorithm for dependence analysis. In Proceedings of the 5th ACM/IEEE Conference on Supercomputing (SC'91). 4-13.
32. SCHNECK, R. R. AND NECULA, G. C. 2002. A gradual approach to a more trustworthy, yet scalable, proofcarrying code. In Proceedings of the 17th Conference on Automated Deduction (CADE'02). Lecture Notes in Computer Science, vol. 2392, Springer-Verlag, Berlin.
33. SRIVAS, M. K. AND MILLER, S. P. 1996. Applying formal verification to the AAMP5 microprocessor: A case study in the industrial use of formal methods. Formal Methods Syst. Design 8, 2, 153-188. (Pubitemid 126708454)
34. STUMP, A. AND DILL, D. 2002. Faster proof checking in the edinburgh logical framework. In Proceedings of the 17th Conference on Automated Deduction (CADE'02). Lecture Notes in Computer Science, vol. 2392, Springer-Verlag, Berlin. 185-222.
35. TAN, T. AND CLEAVELAND, R. 2002. Evidence-based model checking. In Proceedings of Computer Aided Verification (CAV'02). Lecture Notes in Computer Science, vol. 2404, Springer-Verlag, Berlin, 455-470.
36. TRISTAN, J.-B. AND LEROY, X. 2008. Formal verification of translation validators: A case study on instruction scheduling optimizations. In Proceedings of the 35th Symposium on Principles of Programming Languages (POPL'08). 17-27.
37. WEBER, T. AND AMJAD, H. 2009. Efficiently checking propositional Refutations in HOL theorem provers. J. Appl. Logic.
38. WILDMOSER, M. AND NIPKOW, T. 2004. Certifying machine code safety: Shallow versus deep embedding. In Proceedings of International Conference on Theorem Proving in Higher Order Logics (TPHOLs'04). Lecture Notes in Computer Science, vol. 3223, Springer-Verlag, Berlin.
39. WU, D., APPEL, A.W., AND STUMP, A. 2003. Foundational proof checkers with small witnesses. In Proceedings of the ACMConference on Principles and Practice of Declarative Programming (PPDP'03). 264-274.
40. ZHANG, L. AND MALIK, S. 2003. Validating SAT solvers using an independent resolution-based checker: Practical implementations and other applications. In Proceedings of the Conference on Design, Automation & Test in Europe (DATE'03). 10880-10885.
41. ZUCK, L. D., PNUELI, A., AND GOLDBERG, B. 2003. VOC: A methodology for the translation validation of optimizing compilers. J. Universal Comput. Sci 9, 3, 223-247. (Pubitemid 41151351)