A formal executable semantics of a programming language has the necessary information to develop program debugging and reasoning techniques. In this paper we choose such a particular technique called program slicing and we introduce a generic algorithm which extracts a set of side-effects inducing constructs, directly from the formal executable semantics of a programming language. These constructs are further used to infer program slices, for given programs and specified slicing criteria. Our proposed approach improves on the parametrization of the language tools development because changes in the formal semantics are automatically carried out in the slicing procedure. We use the rewriting logic and the Maude system to implement a prototype and to test our technique. © IFIP International Federation for Information Processing 2013.
CITATION STYLE
Riesco, A., Asǎvoae, I. M., & Asav̌oae, M. (2013). A generic program slicing technique based on language definitions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7841 LNCS, pp. 248–264). https://doi.org/10.1007/978-3-642-37635-1_15
Mendeley helps you to discover research relevant for your work.