Certifying Temporal Properties for Compiled C Programs

Xia, Songtao; Hook, James

doi:10.1007/978-3-540-24622-0_15

Cited by 3 publications

(2 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We do not discuss approaches based on temporal logic nor [1] which is based on rewriting logic. ACCEPT/C [28] computes a predicate abstraction and transforms into a Boolean program, the certificate. The validator of ACCEPT/C checks that the Boolean program is a valid abstraction of the program and then model checks it.…”

Section: Resultsmentioning

confidence: 99%

Certification for configurable program analysis

Jakobs

Wehrheim

2014

Proceedings of the 2014 International SPIN Symposium on Model Checking of Software

View full text Add to dashboard Cite

Configurable program analysis (CPA) is a generic concept for the formalization of different software analysis techniques in a single framework. With the tool CPAchecker, this framework allows for an easy configuration and subsequent automatic execution of analysis procedures ranging from data-flow analysis to model checking. The focus of the tool CPAchecker is thus on analysis.In this paper, we study configurability from the point of view of software certification. Certification aims at providing (via a prior analysis) a certificate of correctness for a program which is (a) tamper-proof and (b) more efficient to check for validity than a full analysis. Here, we will show how, given an analysis instance of a CPA, to construct a corresponding sound certification instance, thereby arriving at configurable program certification. We report on experiments with certification based on different analysis techniques, and in particular explain which characteristics of an underlying analysis allow us to design an efficient (in the above (b) sense) certification procedure.

show abstract

Section: Resultsmentioning

confidence: 99%

Certification for configurable program analysis

Jakobs

Wehrheim

2014

Proceedings of the 2014 International SPIN Symposium on Model Checking of Software

View full text Add to dashboard Cite

show abstract

“…Techniques most closely related to SCC are abstraction-carrying code (ACC) [29] and model-carrying code (MCC) [24]. In both cases, the program to be certified is accompanied by an abstract model of the program.…”

Section: Related Workmentioning

confidence: 99%

Search-carrying code

Taleghani

Atlee

2010

Proceedings of the IEEE/ACM International Conference on Automated Software Engineering

View full text Add to dashboard Cite

In this paper, we introduce a model-checking-based certification technique called search-carrying code (SCC). SCC is an adaptation of the principles of proof-carrying code, in which program certification is reduced to checking a provided safety proof. In SCC, program certification is an efficient re-examination of a program's state space. A code producer, who offers a program for use, provides a search script that encodes a search of the program's state space. A code consumer, who wants to certify that the program fits her needs, uses the search script to direct how a model checker searches the program's state space.Basic SCC achieves slight reductions in certification time, but it can be optimized in two important ways. (1) When a program comes from a trusted source, SCC certification can forgo authenticating the provided search script and instead optimize for speed of certification.(2) The search script can be partitioned into multiple partial certification tasks of roughly equal size, which can be performed in parallel. Using parallel model checking, we reduce the certification times by a factor of up to n, for n processors. When certifying a program from a trusted source, we reduce the certification times by a factor of up to 5n, for n processors.

show abstract