Semantic characterisation of dead control-flow paths
@article{Hayes2001SemanticCO,
title={Semantic characterisation of dead control-flow paths},
author={I. Hayes and C. Fidge and K. Lermer},
journal={IEE Proc. Softw.},
year={2001},
volume={148},
pages={175-186}
}Many program verification, testing and performance prediction techniques rely on analysis of statically-identified control-flow paths. However, some such paths may be 'dead' because they can never be followed at run time, and should therefore be excluded from analysis. It is shown how the formal semantics of those statements comprising a path provides a sound theoretical foundation for identification of dead pathsÂ
14 Citations
Linear Approximation of Execution-Time Constraints
- Computer Science, Mathematics
- Formal Aspects of Computing
- 2003
- 3
A theory for execution-time derivation in real-time programs
- Computer Science
- Theor. Comput. Sci.
- 2005
- 7
- PDF
A partial-correctness semantics for modelling assembler programs
- Computer Science
- First International Conference onSoftware Engineering and Formal Methods, 2003.Proceedings.
- 2003
- 2
References
SHOWING 1-10 OF 28 REFERENCES
Automatic Detection and Exploitation of Branch Constraints for Timing Analysis
- Computer Science
- IEEE Trans. Software Eng.
- 2002
- 55
- Highly Influential
- PDF
On the false path problem in hard real-time programs
- Computer Science
- Proceedings of the Eighth Euromicro Workshop on Real-Time Systems
- 1996
- 108
Integrating Path and Timing Analysis Using Instruction-Level Simulation Techniques
- Computer Science
- LCTES
- 1998
- 88
Modeling complex flows for worst-case execution time analysis
- Computer Science
- Proceedings 21st IEEE Real-Time Systems Symposium
- 2000
- 138
- PDF