Sciweavers

Share
JTRES
2010
ACM

Exhaustive testing of safety critical Java

9 years 9 days ago
Exhaustive testing of safety critical Java
With traditional testing, the test case has no control over non-deterministic scheduling decisions, and thus errors dependent on scheduling are only found by pure chance. Java Path Finder (JPF) is a specialized Java virtual machine that can systematically explore execution paths for all possible schedulings, and thus catch these errors. Unfortunately, execution-based model checkers, including JPF, cannot be easily adapted to support real-time programs. We propose a scheduling algorithm for JPF which allows testing of Safety Critical Java (SCJ) applications with periodic event handlers at SCJ levels 0 and 1 (without aperiodic event handlers). The algorithm requires that deadlines are not missed and that there is an execution time model that can give best- and worst-case execution time estimates for a given program path and specific program inputs. Our implementation, named RSJ, allows to search for scheduling dependent memory access errors, certain invalid argument errors, priority cei...
Tomás Kalibera, Pavel Parizek, Michal Maloh
Added 06 Dec 2010
Updated 06 Dec 2010
Type Conference
Year 2010
Where JTRES
Authors Tomás Kalibera, Pavel Parizek, Michal Malohlava, Martin Schoeberl
Comments (0)
books