Semantic characterisation of dead control-flow paths

IEE Proceedings: Software

Volumn 148, Issue 6, 2001, Pages 175-186

  Hayes, I ^a   Fidge, C ^a   Lermer, K ^a  

^a UNIVERSITY OF QUEENSLAND   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ADA (PROGRAMMING LANGUAGE); ALGORITHMS; BOOLEAN FUNCTIONS; COMPUTER SOFTWARE SELECTION AND EVALUATION; SEMANTICS;

DEAD CONTROL-FLOW PATH; PROGRAM TESTING; PROGRAM VERIFICATION;

SOFTWARE ENGINEERING;

EID: 0035726601     PISSN: 14625970     EISSN: None     Source Type: Journal    
DOI: 10.1049/ip-sen:20010834     Document Type: Article

References (27)

1. Refining data flow information using feasible paths
2. An integrated path and timing analysis method based on cycle-level symbolic execution
3. Deriving annotations for tight calculation of execution time
4. Combining static worst-case timing analysis and program proof
5. The deadline command
6. Program analysis and verification
7. Computing maximum task execution times: A graph-based approach
8. Automatic detection and exploitation of branch constraints for timing analysis
9. Predicting program execution times by analyzing static and dynamic program paths
10. Cinderella: A retargetable environment for performance analysis of real-time software
11. Modeling complex flows for worst-case execution time analysis
12. On the false path problem in hard real-time programs
13. Integrating path and timing analysis using instruction-level simulation techniques
14. Path exploration tool
15. Computation of WCET by detecting feasible paths
16. A generalization of Dijkstra's calculus
17. Refinement calculus, lattices and higher order logic
18. Specification statements and refinement
19. A sequential real-time refinement calculus
20. Reasoning algebraically about loops
21. A lattice theoretical fixed point theorem and its application