Title: Program analysis parameterized by the semantics in Maude Abstract: Rewriting logic is a logic of change specially suited for representing concurrent systems. Maude is a high-performance implementation of rewriting logic and a logical framework where the formal semantics of other programming languages can be easily specified and executed. Maude makes systematic use of the fact that rewriting logic is reflective, providing meta-level features for manipulating Maude modules and terms as usual data. Hence, Maude provides a suitable framework for analyzing the semantics of programming languages, extracting information from them, and synthesizing generic tools that perform different analyses on the programs written in the programming languages being specified. In particular, we present Chisel, a slicer parameterized by the semantics of the language under analysis. Slicing is a well established analysis method that takes a program and a slicing criterion (a set of variables of interest) and produces a program slice, that is, a fragment of the original program containing only those pieces of code related to the slicing criterion. Given S, the operational semantics S of a programming language, Chisel infers those instructions that produce features relevant for slicing, e.g., data dependency. The syntheses results are used by a traditional interprocedural slicing algorithm that we parameterize by the synthesized language features. We present the tool on two language paradigms: high-level, imperative and low-level, assembly languages. Computing program slices for these languages allows for extracting traceability properties in standard compilation chains and makes our tool fitting for the validation of embedded system designs. Chisel's slicing benchmark evaluation is based on benchmarks used in avionics.