We present an Abstract Interpretation-based framework for automatically analyzing programs containing digital filters. Our framework allows refining existing analyses so that they can handle given classes of digital filters. We only have to design a class of symbolic properties that describe the invariants throughout filter iterations, and to describe how these properties are transformed by filter iterations. Then, the analysis allows both inference and proofs of the properties about the program variables that are tied to any such filter. © Springer-Verlag 2004.
CITATION STYLE
Feret, J. (2004). Static analysis of digital filters. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2986, 33–48. https://doi.org/10.1007/978-3-540-24725-8_4
Mendeley helps you to discover research relevant for your work.