For the current REF see the REF 2021 website REF 2021 logo

Output details

11 - Computer Science and Informatics

Brunel University London

Return to search Previous output Next output
Output 14 of 117 in the submission
Article title

A trajectory-based strict semantics for program slicing

Type
D - Journal article
Title of journal
Theoretical Computer Science
Article number
-
Volume number
411
Issue number
11-13
First page of article
1372
ISSN of journal
03043975
Year of publication
2009
Number of additional authors
7
Additional information

<9> Published in a top theory journal. Considers the problem of slicing a program to make it smaller while preserving aspect of behaviour. Explores the program semantics used for slicing non-terminating programs (as e.g. used in embedded systems). Previous approaches used transfinite trajectories but this paper showed how one can express the semantics in terms of finite trajectories, making it simpler to reason about slicing (and the correctness of algorithms). [Hierons TSE 2013] considers a different area (slicing models not programs) and looks at different problems (algorithms not semantics).

Interdisciplinary
-
Cross-referral requested
-
Research group
None
Citation count
6
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-