Abstract

This paper studies mathematically some special kinds of transfinite trace semantics and investigates program slicing w.r.t. these semantics. S everal general facts about slicing, which hold for a wide class of programming languages and their transfinite semantics, are proven. The principal part of the work is done on control flow g raphs keeping the treatment abstracted from any concrete programming language. Structured control flow is not assumed but programs written in standard programming languages with structured control flow are among those to which our theory applies.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call