Recurrence in Dense-time AMS Assertions
Formal Languages and Automata Theory
2020-11-18 v1
Abstract
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.
Keywords
Cite
@article{arxiv.2011.08805,
title = {Recurrence in Dense-time AMS Assertions},
author = {Sayandeep Sanyal and Antonio Anastasio Bruto da Costa and Pallab Dasgupta},
journal= {arXiv preprint arXiv:2011.08805},
year = {2020}
}