Effective verification for low-level software with competing interrupts
Interrupt-driven software is difficult to test and debug, especially when interrupts can be nested and subject to priorities. Interrupts can arrive at arbitrary times, leading to an exponential blow-up in the number of cases to consider. We present a new formal approach to verifying interrupt-driven...
| প্রধান লেখক: | , , , , |
|---|---|
| বিন্যাস: | Journal article |
| প্রকাশিত: |
Association for Computing Machinery
2017
|