Proving Correctness of an Efficient Abstraction for Interrupt Handling

Authors:
Gerlind Herberich;Bastian Schlich;Carsten Weise;Thomas Noll
Affiliations:
Embedded Software Laboratory, RWTH Aachen University, Aachen, Germany;Embedded Software Laboratory, RWTH Aachen University, Aachen, Germany;Embedded Software Laboratory, RWTH Aachen University, Aachen, Germany;Software Modeling and Verification Group, RWTH Aachen University, Aachen, Germany
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2008

Citing 14
Cited 1

A methodology for hardware verification based on logic simulation

Journal of the ACM (JACM)
Temporal and modal logic

Handbook of theoretical computer science (vol. B)
A natural semantics for lazy evaluation

POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Model checking

Model checking
Model Checking Programs

Automated Software Engineering
A Linear Local Model Checking Algorithm for CTL

CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
DART: directed automated random testing

Proceedings of the 2005 ACM SIGPLAN conference on Programming language design and implementation
CUTE: a concolic unit testing engine for C

Proceedings of the 10th European software engineering conference held jointly with 13th ACM SIGSOFT international symposium on Foundations of software engineering
[mc]square: A Model Checker for Microcontroller Code

ISOLA '06 Proceedings of the Second International Symposium on Leveraging Applications of Formal Methods, Verification and Validation
Spin model checker, the: primer and reference manual

Spin model checker, the: primer and reference manual
Symbolic Reachability Analysis Using Narrowing and its Application to Verification of Cryptographic Protocols

Electronic Notes in Theoretical Computer Science (ENTCS)
Delayed nondeterminism in model checking embedded systems assembly code

HVC'07 Proceedings of the 3rd international Haifa verification conference on Hardware and software: verification and testing
Application of static analyses for state space reduction to microcontroller assembly code

FMICS'07 Proceedings of the 12th international conference on Formal methods for industrial critical systems
Model checking machine code with the GNU debugger

SPIN'05 Proceedings of the 12th international conference on Model Checking Software

Reduction of interrupt handler executions for model checking embedded software

HVC'09 Proceedings of the 5th international Haifa verification conference on Hardware and software: verification and testing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents an approach to the efficient abstraction of interrupt handling in microcontroller systems. Such systems usually operate in uncertain environments, giving rise to a high degree of nondeterminism in the corresponding formal models, which in turn aggravates the state explosion problem. Careful handling of nondeterminism is therefore crucial for obtaining efficient model checking tools. Here, we support this goal by developing a formal computation model and an abstraction method, called interrupt nondeterminism, which instantiates nondeterministic values only if and when this is required by the application code. It is shown how this symbolic technique can be integrated into our explicit CTL model checking tool [mc]square by introducing lazy states. A lazy state consists of explicit and symbolic parts and therefore, represents several concrete states. With regard to interrupt handling, we also give a simulation relation between the concrete and the abstract state space, thus establishing the correctness of our technique. Furthermore, a case study is presented in which three different programs are used to demonstrate the effectiveness of our method.