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
Programs as Paths: An Approach to Timing Constraint Analysis
  • 4
Linear Approximation of Execution-Time Constraints
  • 3
A theory for execution-time derivation in real-time programs
  • 7
  • PDF
Doomed program points
  • 19
A partial-correctness semantics for modelling assembler programs
  • G. Watson, C. Fidge
  • Computer Science
  • First International Conference onSoftware Engineering and Formal Methods, 2003.Proceedings.
  • 2003
  • 2
Formal Semantics for Program Paths
  • 6
Verifying Emulation of Legacy Mission Computer Systems
  • 3
...
1
2
...

References

SHOWING 1-10 OF 28 REFERENCES
Specification statements and refinements
  • 69
Automatic Detection and Exploitation of Branch Constraints for Timing Analysis
  • 55
  • Highly Influential
  • PDF
Program analysis and verification
  • 14
Deriving Annotations for Tight Calculation of Execution Time
  • 144
  • PDF
On the false path problem in hard real-time programs
  • P. Altenbernd
  • Computer Science
  • Proceedings of the Eighth Euromicro Workshop on Real-Time Systems
  • 1996
  • 108
Path Exploration Tool
  • 33
  • PDF
Integrating Path and Timing Analysis Using Instruction-Level Simulation Techniques
  • 88
A sequential real-time refinement calculus
  • 53
  • PDF
Refining data flow information using infeasible paths
  • 123
  • PDF
Modeling complex flows for worst-case execution time analysis
  • 138
  • PDF
...
1
2
3
...