2009 Design, Automation &Amp; Test in Europe Conference &Amp; Exhibition 2009
DOI: 10.1109/date.2009.5090759
|View full text |Cite
|
Sign up to set email alerts
|

Formal approaches to analog circuit verification

Abstract: Abstract-For a speed-up of analog design cycles to keep up with the continuously decreasing time to market, iterative design refinement and redesigns are more than ever regarded as showstoppers. To deal with this issue, referred to as design and verification gap, the development of a continuous and consistent verification is mandatory. In digital design, formal verification methods are considered as a key technology for efficient design flows. However, industrial availability of formal methods for analog circu… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2010
2010
2022
2022

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 10 publications
(3 citation statements)
references
References 13 publications
(11 reference statements)
0
3
0
Order By: Relevance
“…Recent research on analog circuit verification can be distinguished into two categories: simulation-based methods and formal verification methods [1].…”
Section: Related Workmentioning
confidence: 99%
“…Recent research on analog circuit verification can be distinguished into two categories: simulation-based methods and formal verification methods [1].…”
Section: Related Workmentioning
confidence: 99%
“…Formal approaches like [11], [12], [13], [14], [15], [16] and semiformal approaches like [1], [2], [3], [17] are two main branches in the field. Mathematical origins of these approaches have Maler and Nickovic [18], [19] presented Signal Temporal Logic, STL, to monitor temporal properties of continuous signals by extending Metric Interval Time Logic, MITL [10].…”
Section: Related Workmentioning
confidence: 99%
“…Moreover, it is well known that for large circuits model checking can easily run into statespace explosion. By contrast, formal methods in particular, theorem proving can deliver the highest level of assurance for verification [5]. Akbarpour and Paulson [2] have very recently proposed an automatic proof procedure for inequalities on elementary functions, called MetiTarski, which we will adopt in this paper.…”
Section: Introductionmentioning
confidence: 99%