Details
Original language | English |
---|---|
Title of host publication | 2020 IEEE Computer Society Annual Symposium on VLSI (ISVLSI) |
Pages | 7-12 |
Number of pages | 6 |
ISBN (electronic) | 9781728157757 |
Publication status | Published - 2020 |
Publication series
Name | Proceedings of IEEE Computer Society Annual Symposium on VLSI, ISVLSI |
---|---|
Volume | 2020-July |
ISSN (Print) | 2159-3469 |
ISSN (electronic) | 2159-3477 |
Abstract
In this paper, we propose a new methodology for equivalence checking in the AMS domain. On top of comparing two existing approaches, we define a new methodology using continuous reachable sets. The approaches are illustrated upon two existing abstract modeling techniques. Moreover, the generated models are compared against a conformant model that captures the measured system behavior from the real circuit. These modeling methodologies yield hybrid automatons (HAs), which along with the netlist, are compared using different equivalence checking methods demonstrating verification techniques on different abstraction levels. Finally, we discuss the methodologies with respect to an efficient and safe circuit design.
Keywords
- AMS verification, Behavioral modeling, Coverage, Equivalence checking, Hybrid automata, Reachability
ASJC Scopus subject areas
- Computer Science(all)
- Hardware and Architecture
- Engineering(all)
- Control and Systems Engineering
- Engineering(all)
- Electrical and Electronic Engineering
Cite this
- Standard
- Harvard
- Apa
- Vancouver
- BibTeX
- RIS
2020 IEEE Computer Society Annual Symposium on VLSI (ISVLSI). 2020. p. 7-12 9154965 (Proceedings of IEEE Computer Society Annual Symposium on VLSI, ISVLSI; Vol. 2020-July).
Research output: Chapter in book/report/conference proceeding › Conference contribution › Research › peer review
}
TY - GEN
T1 - Equivalence Checking Methods for Analog Circuits Using Continuous Reachable Sets.
AU - Tarraf, Ahmad
AU - Hedrich, Lars
AU - Kochdumper, Niklas
AU - Rechmal-Lesse, Malgorzata
AU - Olbrich, Markus
PY - 2020
Y1 - 2020
N2 - In this paper, we propose a new methodology for equivalence checking in the AMS domain. On top of comparing two existing approaches, we define a new methodology using continuous reachable sets. The approaches are illustrated upon two existing abstract modeling techniques. Moreover, the generated models are compared against a conformant model that captures the measured system behavior from the real circuit. These modeling methodologies yield hybrid automatons (HAs), which along with the netlist, are compared using different equivalence checking methods demonstrating verification techniques on different abstraction levels. Finally, we discuss the methodologies with respect to an efficient and safe circuit design.
AB - In this paper, we propose a new methodology for equivalence checking in the AMS domain. On top of comparing two existing approaches, we define a new methodology using continuous reachable sets. The approaches are illustrated upon two existing abstract modeling techniques. Moreover, the generated models are compared against a conformant model that captures the measured system behavior from the real circuit. These modeling methodologies yield hybrid automatons (HAs), which along with the netlist, are compared using different equivalence checking methods demonstrating verification techniques on different abstraction levels. Finally, we discuss the methodologies with respect to an efficient and safe circuit design.
KW - AMS verification
KW - Behavioral modeling
KW - Coverage
KW - Equivalence checking
KW - Hybrid automata
KW - Reachability
UR - http://www.scopus.com/inward/record.url?scp=85090407694&partnerID=8YFLogxK
U2 - 10.1109/isvlsi49217.2020.00012
DO - 10.1109/isvlsi49217.2020.00012
M3 - Conference contribution
SN - 978-1-7281-5776-4
T3 - Proceedings of IEEE Computer Society Annual Symposium on VLSI, ISVLSI
SP - 7
EP - 12
BT - 2020 IEEE Computer Society Annual Symposium on VLSI (ISVLSI)
ER -