Putting detectors in their place
UNSPECIFIED (2005) Putting detectors in their place. In: 3rd IEEE International Conference on Software Engineering and Formal Methods, Koblenz, GERMANY, SEP 07-09, 2005. Published in: SEFM 2005: THIRD IEEE INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING AND FORMAL METHODS, PROCEEDINGS pp. 33-42.Full text not available from this repository.
In this paper, we address the problem of locating detectors in a given program under resource constraints. A detector is a program component that asserts the validity of a predicate in a program. The detector location problem is to identify which program actions need to be monitored by detectors such that certain given dependability properties are met. In this paper, we focus on the following dependability properties: (i) high detection coverage, (ii) low detection latency, and (iii) low false alarms rate. Our main contributions are: (i) We first provide a formal definition of the detector location problem under resource constraints, and (ii) We subsequently show that the problem is NP-complete, (iii) We investigate a special case of the detector location problem that can be solved in polynomial time, and present a sound and complete algorithm that solves the problem. We present an example to show the applicability of our approach, which is intended in the area of dependable embedded systems.
|Item Type:||Conference Item (UNSPECIFIED)|
|Subjects:||Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software|
|Journal or Publication Title:||SEFM 2005: THIRD IEEE INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING AND FORMAL METHODS, PROCEEDINGS|
|Publisher:||IEEE COMPUTER SOC|
|Editor:||Aichernig, BK and Beckert, B|
|Number of Pages:||10|
|Page Range:||pp. 33-42|
|Title of Event:||3rd IEEE International Conference on Software Engineering and Formal Methods|
|Location of Event:||Koblenz, GERMANY|
|Date(s) of Event:||SEP 07-09, 2005|
Actions (login required)