Location of Repository

Semantic characterisation of dead control-flow paths

By Ian Hayes, Colin J. Fidge and Karl Lermer

Abstract

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 path

Publisher: IET
Year: 2001
DOI identifier: 10.1049/ip-sen:20010834
OAI identifier: oai:eprints.qut.edu.au:10444

Suggested articles

Preview

Citations

  1. (2001). A sequential real-time refinement calculus.’
  2. (1955). A.: ‘A lattice theoretical fixed point theorem and its application.’
  3. (1989). G.: ‘A generalization of Dijkstra’s calculus.’
  4. (1997). Language and Standard Libraries,’
  5. (1990). Predicate Calculus and Program Semantics.’
  6. (1993). R.-J.: ‘Refinement calculus, lattices and higher order logic.’
  7. (1999). Reasoning algebraically about loops.’
  8. (1998). Refinement Calculus: A Systematic Introduction.’
  9. (1987). Specification statements and refinement.’

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.