One Stack to Run Them All: Reducing Concurrent Analysis to Sequential Analysis Under Priority Scheduling
Source: Purdue University
The authors present a reduction from a concurrent real-time program with priority preemptive scheduling to a sequential program that has the same set of behaviors. Whereas many static analyses of concurrent programs are undecidable, their reduction enables the application of any sequential program analysis to be applied to a concurrent real-time program with priority preemptive scheduling. Embedded systems are pervasive and are becoming ever more dependent on complex software with significant correctness and reliability requirements. From automobiles to the space shuttle, software is rapidly becoming the most significant part of development time of new devices.