Generating Invariant-Based Certificates for Embedded Systems

作者: Jan Olaf Blech , Michaël Périn

DOI: 10.1145/2220336.2220346

关键词:

摘要: Automatic verification tools, such as model checkers and tools based on static analysis or abstract interpretation, have become popular in software hardware development. They increase confidence potentially provide rich feedback. However, with increasing complexity, themselves are more likely to contain errors.In contrast automatic higher-order theorem provers use mathematically founded proof strategies checked by a small checker guarantee selected properties. Thus, they enjoy high level of trustability. Properties systems their justifications can be encapsulated into certificate, thereby guaranteeing correctness the systems, respect These results offer much higher degree than achieved tools. usually slow, due general minimalistic nature. Even for lot human interaction is required establishing certificate.In this work, we combine advantages (i.e., speed automation) those trustability). The tool generates certificate each invocation. This prover, desired property. generation certificates easier producing first place. In our able create that come an algorithmic description property justification. We concentrate generate invariants certify automatically these do indeed hold. Our approach applied certification verdicts deadlock-detection asynchronous component-based language.

参考文章(38)
Martin Wildmoser, Tobias Nipkow, Certifying Machine Code Safety: Shallow Versus Deep Embedding theorem proving in higher order logics. pp. 305- 320 ,(2004) , 10.1007/978-3-540-30142-4_22
B Grégoire, J Blech, Using checker predicates in certifying code generation COCV 2009. pp. 1- 17 ,(2009)
Bruno Barras, Verification of the Interface of a Small Proof System in Coq types for proofs and programs. pp. 28- 45 ,(1996) , 10.1007/BFB0097785
Robert R. Schneck, George C. Necula, A Gradual Approach to a More Trustworthy, Yet Scalable, Proof-Carrying Code conference on automated deduction. pp. 47- 62 ,(2002) , 10.1007/3-540-45620-1_4
K. L. McMillan, Interpolation and SAT-Based Model Checking computer aided verification. pp. 1- 13 ,(2003) , 10.1007/978-3-540-45069-6_1
Jean-Christophe Filliâtre, Claude Marché, The Why/Krakatoa/Caduceus Platform for Deductive Program Verification Computer Aided Verification. pp. 173- 177 ,(2007) , 10.1007/978-3-540-73368-3_21
Sascha Böhme, Tjark Weber, Fast LCF-Style Proof Reconstruction for Z3 Interactive Theorem Proving. pp. 179- 194 ,(2010) , 10.1007/978-3-642-14052-5_14
Thomas A. Henzinger, George C. Necula, Ranjit Jhala, Grégoire Sutre, Rupak Majumdar, Westley Weimer, Temporal-Safety Proofs for Systems Code computer aided verification. pp. 526- 538 ,(2002) , 10.1007/3-540-45657-0_45
Aaron Stump, David L. Dill, Faster Proof Checking in the Edinburgh Logical Framework conference on automated deduction. pp. 392- 407 ,(2002) , 10.1007/3-540-45620-1_32
Saddek Bensalem, Yassine Lakhnech, None, Automatic Generation of Invariants formal methods. ,vol. 15, pp. 75- 92 ,(1999) , 10.1023/A:1008744030390