CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

On Systematic Design of Globally Consistent Executable Assertions in Embedded Software

Arshad Jhumka (Institutionen för datorteknik) ; Martin Hiller (Institutionen för datorteknik) ; Vilgot Claesson (Institutionen för datorteknik) ; Neeraj Suri (Institutionen för datorteknik)
ACM SIGPLAN Notices. Joint Conference on Languages, Compilers and Tools for Embeddded Systems/Software and Compilers for Embedded Systems (LCTES 02-SCOPES 02), Berlin, Jun 19-21, 2002 (0362-1340). Vol. 37 (2002), 7, p. 75-84.
[Konferensbidrag, refereegranskat]

Over the design of software (SW) used in provisioning of dependable services, Executable Assertions (EAs) are seeing increasing usage in aiding detection of data errors. Given the requirements for provision of service despite faults, early detection of system states that can potentially lead to system failure is valuable. We address the issue of ascertaining whether localized EAs in individual modules add up complementarily to implement a global EA/property. We first show that detection of globally compliant EAs is NP-complete. Thus, we develop a two-pass approach for our objective. In the first pass, we introduce the consistency property of EAs and use it to ascertain global conformity across all EAs. The second pass, analogous to predicate transformers, generates globally consistent EAs when any inconsistency is flagged in the first pass. We show the applicability of our approach on a real embedded system. Initial results obtained show that our framework is able to detect inherent vulnerabilities (due to placement of mismatched EAs) that were previously undetected. Our intent is automation of this approach, which can be incorporated in a compiler.

Denna post skapades 2013-02-14.
CPL Pubid: 173627


Läs direkt!

Länk till annan sajt (kan kräva inloggning)

Institutioner (Chalmers)

Institutionen för datorteknik (2002-2004)



Chalmers infrastruktur