Deterministic dynamic monitors for linear-time assertions

  • Authors:
  • Roy Armoni;Dmitry Korchemny;Andreas Tiemeyer;Moshe Y. Vardi;Yael Zbar

  • Affiliations:
  • Intel;Intel;Intel;Rice University and Microsoft Research;Intel

  • Venue:
  • FATES'06/RV'06 Proceedings of the First combined international conference on Formal Approaches to Software Testing and Runtime Verification
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

We describe a framework for dynamic verification of temporal assertions based on assertion compilation into deterministic automata. The novelty of our approach is that it allows efficient dynamic verification of general linear temporal formulas written in formal property specification languages such as LTL, ForSpec, PSL, and SVA, while the existing approaches are applicable to limited subsets only. We also show an advantage of the described framework over industrial simulators, which typically use transaction-based verification. Another advantage of our approach is its ability to use deterministic checkers directly for hardware emulation. Finally, we compare the deterministic compilation with the OBDD-based on-the-fly simulation of deterministic automata. We show that although the OBDD-based simulation method is much slower, the two methods may be efficiently combined for hybrid simulation, when the RTL signals in assertions are mixed with symbolic variables.