Incorporating local variables in mixed-signal assertions

Mukherjee, Subhankar; Dasgupta, Pallab

doi:10.1109/tencon.2009.5396176

Cited by 6 publications

(4 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In our past work on AMS-LTL we extended temporal logic to express assertions for AMS [9] and further proposed adding property variables to the logic in AMS-LTL L [10]. We also describe mechanisms for AMS property checking using standard simulators [11] and proposed using auxillary state machines to aid in testing and verification flows.…”

Section: Related Workmentioning

confidence: 99%

“…the number of cycles in the interval, and thereby the assertion checking overhead. For this reason, existing literature, including our own [7][8][9][10][11][12][13][14], advocates the use of dense time assertion checking, which works using real interval arithmetic as opposed to cycle based reasoning. The semantics of dense-time naturally allows properties to hold continuously over a dense time period.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Recurrence in Dense-Time AMS Assertions

Sanyal

Costa

Dasgupta

2021

IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst.

Self Cite

View full text Add to dashboard Cite

The notion of recurrence over continuous or dense time, as required for expressing Analog and Mixed-Signal (AMS) behaviours, is fundamentally different from what is offered by the recurrence operators of SystemVerilog Assertions (SVA). This article introduces the formal semantics of recurrence over dense time and provides a methodology for the runtime verification of such properties using interval arithmetic. Our property language extends SVA with dense real-time intervals and predicates containing real-valued signals. We provide a tool kit which interfaces with off-the-shelf EDA tools through standard VPI.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Recurrence in Dense-Time AMS Assertions

Sanyal

Costa

Dasgupta

2021

IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst.

Self Cite

View full text Add to dashboard Cite

show abstract

“…Comparing analog signals with other analog signals or constant values is the most common way and it is the simplest method to convert analog signals into boolean signals in practice. Therefore, early ABV methodologies for mixed-signal designs only support comparison operators in their Analog layers [1], [6], [7], [8], [9]. Also, a limited set of frequency domain properties have been checked using FFT to extract information from the signals [2].…”

Section: Mixed Signal Assertion Languagesmentioning

confidence: 99%

Using haloes in mixed-signal assertion based verification

Ulus

Şen

2012

2012 IEEE International High Level Design Validation and Test Workshop (HLDVT)

View full text Add to dashboard Cite

Abstract-We develop an assertion based verification solution for analog mixed-signal designs. We introduce the halo concept for analog signals to express them with their tolerance and variation values in assertions. The halo of a signal provides a relaxation over the signal and it defines an effective region for that signal which can be used in assertion based verification. Using haloes for analog signals allow us to define a new set of comparison relations between two analog signals including their equivalence. In our intended design flow, these new analog signal operators are placed into the Analog layer of mixed-signal assertion languages as an extension. We present experimental results on a programmable switch and a VCO.

show abstract

“…In the discrete domain, formalisms based on temporal logic have been widely adopted with the use of standard assertion languages, such as SystemVerilog Assertions (SVA) [2] and Property Specification Language (PSL) [1]. Analog Mixed-Signal (AMS) extensions of assertions have been explored as well [22,23,27] and provide constructs for assertions over real-valued attributes. Assertion based verification of HA has also been studied [26], while tools such as SpaceEx [17] have been used to analyze timed and hybrid models of embedded control systems using reachability analysis and model checking.…”

Section: Introductionmentioning

confidence: 99%

Formal Feature Interpretation of Hybrid Systems

Costa

Frehse

Dasgupta

2018

IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst.

Self Cite

View full text Add to dashboard Cite

In current practice a formal analysis of hybrid system models is assertion-based. The work presented here is based on features that look beyond functional correctness towards a quantitative evaluation of behavioural attributes. A feature defines a real-valued evaluation function over a specific set of traces. This article describes an improved method for the interpretation of features over hybrid automata models. It further demonstrates how Satisfiability Modulo Theory (SMT) solvers can be used for extracting behavioural traces corresponding to corner cases of a feature. Results are demonstrated on examples from the control and circuit domains.

show abstract

Incorporating local variables in mixed-signal assertions

Cited by 6 publications

References 11 publications

Recurrence in Dense-Time AMS Assertions

Recurrence in Dense-Time AMS Assertions

Using haloes in mixed-signal assertion based verification

Formal Feature Interpretation of Hybrid Systems

Contact Info

Product

Resources

About