article · Goldsmiths (University of London) · 2004

A lazy semantics for program slicing

Sebastian Danicic, Mark Harman, John Howroyd, Lahcen Ouarbya

Cited by 9Abstract and details only

Abstract

This paper demonstrates that if a slicing algorithm is expressed\ndenotationally, without intermediate structures, then the power of\ndenotational semantics can be used to prove correctness. \n\nThe semantics preserved by slicing algorithms, however, is non-standard. We introduce a new lazy semantics which we prove is preserved by slicing algorithms.\n\nIt is demonstrated how other concepts in program dependence,\ndifficult or impossible to express using standard semantics, \nfor example variable dependence, can be expressed naturally using our new lazy semantics.

Cite this paper

APA 7

Danicic, S., Harman, M., Howroyd, J., & Ouarbya, L. (2004). A lazy semantics for program slicing. Goldsmiths (University of London).

MLA 9

Danicic, Sebastian, et al. “A lazy semantics for program slicing.” Goldsmiths (University of London), 2004.

Chicago

Danicic, Sebastian, Mark Harman, John Howroyd, and Lahcen Ouarbya. 2004. “A lazy semantics for program slicing.” Goldsmiths (University of London).

Harvard

Danicic, S. et al. (2004) ‘A lazy semantics for program slicing’, Goldsmiths (University of London).

BibTeX

@article{danicic2004lazy,
  title = {{A lazy semantics for program slicing}},
  author = {Danicic, Sebastian and Harman, Mark and Howroyd, John and Ouarbya, Lahcen},
  journal = {Goldsmiths (University of London)},
  year = {2004}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.