Learn More
We present MONTRE, a monitoring tool to search patterns specified by timed regular expressions in symbolic behaviors of real-time systems. We use timed regular expressions as a compact, natural and highly-expressive specification language for monitoring applications involving timing constraints. Our tool essentially incorporates online and offline timed(More)
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(More)
Timed pattern matching consists in finding all segments of a densetime Boolean signal that match a pattern defined by a timed regular expression. This problem has been formulated and solved in [17] via an offline algorithm that takes the signal and expression as inputs and produces the set of all matches, represented as a finite union of two-dimensional(More)
Signal regular expressions can specify sequential properties of realvalued signals based on threshold conditions, regular operations, and duration constraints. In this paper we endow them with a quantitative semantics which indicates how robustly a signal matches or does not match a given expression. First, we show that this semantics is a safe(More)
Runtime verification is aimed at analyzing execution traces stemming from a running program or system. The traditional purpose is to detect the lack of conformance with respect to a formal specification. Numerous efforts in the field have focused on monitoring so-called parametric specifications, where events carry data, and formulas can refer to such.(More)
We define a new notion of satisfaction of a temporal logic formula φ by a behavior w. This notion, denoted by (w, t, t′) |= φ, is characterized by two time parameters: the position t from which satisfaction is considered, and the end of the (finite) behavior t′ which indicates how much do we know about the behavior. We define this notion in dense time where(More)
Digitally-programmable analog circuits provide reconfigurability and flexibility for next-generation electronic systems and modern electronic systems need such circuits more than ever. For verification of these circuits, the change in analog characteristics according to digital inputs should be monitored and checked to determine whether measured analog(More)
Quantitative regular expressions (QREs) have been recently proposed as a high-level declarative language for specifying complex numerical queries over data streams in a modular way. QREs have appealing theoretical properties, and each QRE can be compiled into an efficient streaming algorithm for its evaluation. In this paper, we generalize the notion of(More)