Research Issues --Efficient Pattern Matching Algorithms

• every event (system call, network packet, …) is potentially subject to checking w.r.t. many assertions

• each assertion may involve complex temporal conditions

  • checking w.r.t. to even a single assertion may be too expensive
  • need to store history of events

• implication: real-time checking of assertions is powerful, but possibly expensive

How can we speed up runtime checking to make this approach practical?Can we bound the amount of resources (CPU time, memory, etc) needed for pattern-matching?

Previous slide

Next slide

Back to first slide

View graphic version