Abstract
In this paper, we show how symbolic algebra in Mathematica can be used to formally verify analog and mixed signal designs. The verification methodology is based on combining induction and constraints solving to generate correctness for the system with respect to given properties. The methodology has the advantage of avoiding exhaustive simulation usually utilized in the verification. We illustrate this methodology by proving the stability of a ΔΣ modulator. © Springer-Verlag Berlin Heidelberg 2007.
Author supplied keywords
Cite
CITATION STYLE
Zaki, M. H., Al-Sammane, G., & Tahar, S. (2007). Formal verification of analog and mixed signal designs in Mathematica. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4488 LNCS, pp. 263–267). Springer Verlag. https://doi.org/10.1007/978-3-540-72586-2_37
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
