Algebraic Quantitative Semantics for Efficient Online Temporal Monitoring

Mamouras, Konstantinos; Chattopadhyay, Agnishom; Wang, Zhifu

doi:10.1007/978-3-030-72016-2_18

Cited by 8 publications

(1 citation statement)

References 36 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The way bit vectors are used (setting the lowest-order bit, shifting, and reading high-order bits) is similar to how queues and sliding windows are used for runtime verification with metric temporal logic (MTL) [7,15,32,33]. We note that MTL involves constructs that specify time durations with intervals of the form [𝑚, 𝑛], which are akin to the bounded repetition operators {𝑚, 𝑛} of regexes.…”

Section: Nca Execution With Bitmentioning

confidence: 99%

Software-hardware codesign for efficient in-memory regular pattern matching

Kong

Chattopadhyay

et al. 2022

Proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation

Self Cite

View full text Add to dashboard Cite

Regular pattern matching is used in numerous application domains, including text processing, bioinformatics, and network security. Patterns are typically expressed with an extended syntax of regular expressions. This syntax includes the computationally challenging construct of bounded repetition or counting, which describes the repetition of a pattern a fixed number of times. We develop a specialized in-memory hardware architecture that integrates counter and bit vector modules into a state-of-the-art in-memory NFA accelerator. The design is inspired by the theoretical model of nondeterministic counter automata (NCA). A key feature of our approach is that we statically analyze regular expressions to determine bounds on the amount of memory needed for the occurrences of bounded repetition. The results of this analysis are used by a regex-to-hardware compiler in order to make an appropriate selection of counter or bit vector modules. We evaluate our hardware implementation using a simulator based on circuit parameters collected by SPICE simulation in TSMC 28nm CMOS process. We find that the use of counter and bit vector modules outperforms unfolding

show abstract

Section: Nca Execution With Bitmentioning

confidence: 99%

Software-hardware codesign for efficient in-memory regular pattern matching

Kong

Chattopadhyay

et al. 2022

Proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation

Self Cite

View full text Add to dashboard Cite

show abstract

A Compositional Framework for Quantitative Online Monitoring over Continuous-Time Signals

Mamouras

Chattopadhyay

Wang

2021

Runtime Verification

View full text Add to dashboard Cite

Abstract Monitors for Quantitative Specifications

Henzinger

Mazzocchi

Saraç

2022

Runtime Verification

View full text Add to dashboard Cite

Quantitative monitoring can be universal and approximate: For every finite sequence of observations, the specification provides a value and the monitor outputs a best-effort approximation of it. The quality of the approximation may depend on the resources that are available to the monitor. By taking to the limit the sequences of specification values and monitor outputs, we obtain precision-resource trade-offs also for limit monitoring. This paper provides a formal framework for studying such trade-offs using an abstract interpretation for monitors: For each natural number n, the aggregate semantics of a monitor at time n is an equivalence relation over all sequences of at most n observations so that two equivalent sequences are indistinguishable to the monitor and thus mapped to the same output. This abstract interpretation of quantitative monitors allows us to measure the number of equivalence classes (or “resource use”) that is necessary for a certain precision up to a certain time, or at any time. Our framework offers several insights. For example, we identify a family of specifications for which any resource-optimal exact limit monitor is independent of any error permitted over finite traces. Moreover, we present a specification for which any resource-optimal approximate limit monitor does not minimize its resource use at any time.

show abstract

Algebraic Quantitative Semantics for Efficient Online Temporal Monitoring

Cited by 8 publications

References 36 publications

Software-hardware codesign for efficient in-memory regular pattern matching

Software-hardware codesign for efficient in-memory regular pattern matching

A Compositional Framework for Quantitative Online Monitoring over Continuous-Time Signals

Abstract Monitors for Quantitative Specifications

Contact Info

Product

Resources

About