A proof system for concurrent ADA programs
Science of Computer Programming
Selecting Software Test Data Using Data Flow Information
IEEE Transactions on Software Engineering
On the adequacy of program dependence graphs for representing programs
POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Critical Races in Ada Programs
IEEE Transactions on Software Engineering
Verifying General Safety Properties of Ada Tasking Programs
IEEE Transactions on Software Engineering
Data Dependency Graphs for Ada Programs
IEEE Transactions on Software Engineering
IEEE Transactions on Software Engineering
Formal Verification of Ada Programs
IEEE Transactions on Software Engineering
Structural Testing of Concurrent Programs
IEEE Transactions on Software Engineering
Data Flow Analysis in Software Reliability
ACM Computing Surveys (CSUR)
Data flow analysis of communicating processes
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Hi-index | 0.00 |
Safety-critical Ada programs often contain asynchronous tasks and are, therefore, prone to timing hazards. Neither rigorous testing nor rigorous formal verification is currently feasible for timing hazard detection. We propose an inexpensive static analysis that can assist in the identification of timing hazards. Only a few Ada constructs can generate results that depend on the asynchronous timing of tasks within a program. Using the techniques of data dependency analysis, these timing dependencies can be traced through the program. If an output is timing dependent, manual inspection is required to determine whether the timing dependency is deliberate or is an unintended timing hazard.