The Community for Technology Leaders
Temporal Representation and Reasoning, International Syposium on (2005)
Burlington, Vermont
June 23, 2005 to June 25, 2005
ISSN: 1530-1311
ISBN: 0-7695-2370-6
pp: 166-174
Ben D'Angelo , Stanford University,
Sriram Sankaranarayanan , Stanford University
César Sánchez , Stanford University
Will Robinson , Stanford University
Bernd Finkbeiner , Saarland University
Henny B. Sipma , Stanford University
Sandeep Mehrotra , Synopsys, Inc.
Zohar Manna , Stanford University
<p>We present a specification language and algorithms for the online and offline monitoring of synchronous systems including circuits and embedded systems. Such monitoring is useful not only for testing, but also under actual deployment. The specification language is simple and expressive; it can describe both correctness/failure assertions along with interesting statistical measures that are useful for system profiling and coverage analysis. The algorithm for online monitoring of queries in this language follows a partial evaluation strategy: it incrementally constructs output streams from input streams, while maintaining a store of partially evaluated expressions for forward references. We identify a class of specifications, characterized syntactically, for which the algorithm?s memory requirement is independent of the length of the input streams. Being able to bound memory requirements is especially important in online monitoring of large input streams. We extend the concepts used in the online algorithm to construct an efficient offline monitoring algorithm for large traces.</p> <p>We have implemented our algorithm and applied it to two industrial systems, the PCI bus protocol and a memory controller. The results demonstrate that our algorithms are practical and that our specification language is sufficiently expressive to handle specifications of interest to industry.</p>

B. Finkbeiner et al., "LOLA: Runtime Monitoring of Synchronous Systems," Proceedings. 12th International Symposium on Temporal Representation and Reasoning(TIME), Burlington, VT, USA, 2005, pp. 166-174.
90 ms
(Ver 3.3 (11022016))