Scheduling Processes with Release Times, Deadlines, Precedence and Exclusion Relations
IEEE Transactions on Software Engineering
Theoretical Computer Science
Proceedings of the DIMACS/SYCON workshop on Hybrid systems III : verification and control: verification and control
Priority Scheduling Versus Pre-Run-Time Scheduling
Real-Time Systems - Selected papers from IFAC/IFIP workshops on real-time programming
On the criteria to be used in decomposing systems into modules
Communications of the ACM
The Verus language: representing time efficiently with BDDs
Theoretical Computer Science - Special issue on real-time systems and concurrent and distributed software
Software fundamentals: collected papers by David L. Parnas
Software fundamentals: collected papers by David L. Parnas
On Satisfying Timing Constraints in Hard-Real-Time Systems
IEEE Transactions on Software Engineering
IEEE Transactions on Software Engineering
Logics and Models of Real Time: A Survey
Proceedings of the Real-Time: Theory in Practice, REX Workshop
On Inspection and Verification of Software with Timing Requirements
IEEE Transactions on Software Engineering
Formal analysis of the priority ceiling protocol
RTSS'10 Proceedings of the 21st IEEE conference on Real-time systems symposium
On Inspection and Verification of Software with Timing Requirements
IEEE Transactions on Software Engineering
SAFECOMP '08 Proceedings of the 27th international conference on Computer Safety, Reliability, and Security
| Hi-index | 0.00 |
A general method or tool that can verify the timing properties of any arbitrary piece of software will probably never exist. So, software with hard timing requirements should be designed using a systematic approach to make its timing properties easier to inspect and verify. Preruntime scheduling provides such an approach by placing restrictions on software to reduce complexity.