Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Generating Invariant-Based Certificates for Embedded Systems

Generating Invariant-Based Certificates for Embedded Systems Generating Invariant-Based Certi cates for Embedded Systems JAN OLAF BLECH and MICHAEL PERIN, Verimag Laboratory Automatic veri cation tools, such as model checkers and tools based on static analysis or on abstract interpretation, have become popular in software and hardware development. They increase con dence and potentially provide rich feedback. However, with increasing complexity, veri cation tools themselves are more likely to contain errors. In contrast to automatic veri cation tools, higher-order theorem provers use mathematically founded proof strategies checked by a small proof checker to guarantee selected properties. Thus, they enjoy a high level of trustability. Properties of software and hardware systems and their justi cations can be encapsulated into a certi cate, thereby guaranteeing correctness of the systems, with respect to the properties. These results offer a much higher degree of con dence than results achieved by veri cation tools. However, higher-order theorem provers are usually slow, due to their general and minimalistic nature. Even for small systems, a lot of human interaction is required for establishing a certi cate. In this work, we combine the advantages of automatic veri cation tools (i.e., speed and automation) with those of higher-order theorem provers (i.e., high level of http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM Transactions on Embedded Computing Systems (TECS) Association for Computing Machinery

Generating Invariant-Based Certificates for Embedded Systems

Loading next page...
 
/lp/association-for-computing-machinery/generating-invariant-based-certificates-for-embedded-systems-gqx0wt4ohn
Publisher
Association for Computing Machinery
Copyright
Copyright © 2012 by ACM Inc.
ISSN
1539-9087
DOI
10.1145/2220336.2220346
Publisher site
See Article on Publisher Site

Abstract

Generating Invariant-Based Certi cates for Embedded Systems JAN OLAF BLECH and MICHAEL PERIN, Verimag Laboratory Automatic veri cation tools, such as model checkers and tools based on static analysis or on abstract interpretation, have become popular in software and hardware development. They increase con dence and potentially provide rich feedback. However, with increasing complexity, veri cation tools themselves are more likely to contain errors. In contrast to automatic veri cation tools, higher-order theorem provers use mathematically founded proof strategies checked by a small proof checker to guarantee selected properties. Thus, they enjoy a high level of trustability. Properties of software and hardware systems and their justi cations can be encapsulated into a certi cate, thereby guaranteeing correctness of the systems, with respect to the properties. These results offer a much higher degree of con dence than results achieved by veri cation tools. However, higher-order theorem provers are usually slow, due to their general and minimalistic nature. Even for small systems, a lot of human interaction is required for establishing a certi cate. In this work, we combine the advantages of automatic veri cation tools (i.e., speed and automation) with those of higher-order theorem provers (i.e., high level of

Journal

ACM Transactions on Embedded Computing Systems (TECS)Association for Computing Machinery

Published: Jul 1, 2012

There are no references for this article.