Reducing the Cost of Path Property Monitoring Through Sampling

Dwyer, Matthew B.; Diep, Madeline; Elbaum, Sebastian

doi:10.1109/ase.2008.33

Cited by 22 publications

(17 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Dwyer et al [10] improve the performance of runtime monitoring systems by breaking larger specifications into smaller "sub-alphabet" properties and monitoring a sampled subset to create an approximate out OCD's entire development. To avoid an obvious threat to validity, we have omitted it from our standard evaluation but use it here for convenience-with a different form of tracing.…”

Section: Discussion and Related Workmentioning

confidence: 99%

“…Advancing Automata (Lines 9-14) We iterate through all specifications that our currently processed event (e old ) participates in (line 9) and advance their state machines (lines [10][11][12][13][14]. The test at line 10 "dereferences" the concrete assignment to its symbolic letter, and the state updates on lines 11 and 13 access an external function NEXT, which is a simple accessor for the transition relation of the pattern P. To improve performance, our implementation incrementally maintains a mapped index from each seen trace element on to the set of all affected specifications.…”

Section: Statementioning

confidence: 99%

See 1 more Smart Citation

Online inference and enforcement of temporal properties

Gabel

2010

Proceedings of the 32nd ACM/IEEE International Conference on Software Engineering - Volume 1

View full text Add to dashboard Cite

The interfaces of software components are often paired with specifications or protocols that prescribe correct and safe usage. An important class of these specifications consists of temporal safety properties over function or method call sequences. Because violations of these properties can lead to program crashes or subtly inconsistent program state, these properties are frequently the target of runtime monitoring techniques. However, the properties must be specified in advance, a time-consuming process. Recognizing this problem, researchers have proposed various specification inference techniques, but they suffer from imprecision and require a significant investment in developer time.This work presents the first fully automatic dynamic technique for simultaneously learning and enforcing general temporal properties over method call sequences. Our technique is an online algorithm that operates over a short, finite execution history. This limited view works well in practice due to the inherent temporal locality in sequential method calls on Java objects, a property we validate empirically. We have implemented our algorithm in a practical tool for Java, OCD, that operates with a high degree of precision and finds new defects and code smells in well-tested applications.

show abstract

Section: Discussion and Related Workmentioning

confidence: 99%

Section: Statementioning

confidence: 99%

Online inference and enforcement of temporal properties

Gabel

2010

Proceedings of the 32nd ACM/IEEE International Conference on Software Engineering - Volume 1

View full text Add to dashboard Cite

show abstract

“…Dwyer, Diep and Elbaum propose a novel mechanism to guaranteeing low runtime overhead even in the presence of multiple monitoring properties and in cases where programs need to update the internal state of monitors for these properties very frequently [23]. The authors first propose to combine multiple properties over objects of the same class into one large "integrated" property.…”

Section: Sub-alphabet Samplingmentioning

confidence: 99%

Clara: Partially Evaluating Runtime Monitors at Compile Time

Bodden

Lam

2010

Runtime Verification

View full text Add to dashboard Cite

Abstract. Clara is a novel static-analysis framework for partially evaluating finite-state runtime monitors at compile time. Clara uses static typestate analyses to automatically convert any AspectJ monitoring aspect into a residual runtime monitor that only monitors events triggered by program locations that the analyses failed to prove safe. If the static analysis succeeds on all locations, this gives strong static guarantees. If not, the efficient residual runtime monitor is guaranteed to capture property violations at runtime. Researchers can use Clara with most runtime-monitoring tools that implement monitors as AspectJ aspects.In this tutorial supplement, we provide references to related reading material that will allow the reader to obtain in-depth knowledge about the context in which Clara can be applied and about the techniques that underlie the Clara framework.

show abstract

“…These techniques broadly fall under two main categories: event sampling techniques and static/dynamic analysis. In the first category [1,6] only a subset of the system events generated are checked by the monitor, typically in line with some periodic overhead upper limit; this arrangement allows the verification instrumentation to give certain guarantees with respect to monitor overheads, at the expense of monitoring precision. In the second category, static analysis is performed on the monitored properties and their instrumentation [4,3] in order to optimise their footprint.…”

Section: Related Workmentioning

confidence: 99%

polyLarva: Runtime Verification with Configurable Resource-Aware Monitoring Boundaries

Colombo

Francalanza

Mizzi

et al. 2012

Software Engineering and Formal Methods

View full text Add to dashboard Cite

Abstract. Runtime verification techniques are increasingly being applied in industry as a lightweight formal approach to achieve added assurance of correctness at runtime. A key issue determining the adoption of these techniques is the overheads introduced by the runtime checks, affecting the performances of the monitored systems. Despite advancements in the development of optimisation techniques lowering these overheads, industrial settings such as online portals present new challenges, since they frequently involve the handling of high volume transaction throughputs and cannot afford substantial deterioration in the service they provide. One approach to reduce overheads is the deployment of the verification computation on auxiliary computing resources, creating a boundary between the system and the verification code. This limits the use of system resources with resource intensive verification being carried out on the remote-side. However, under particular scenarios this approach may still not be ideal, as it may induce significant communication overheads. In this paper, we propose a framework which enables fine-tuning of the tradeoff between processing, memory and communication monitoring overheads, through the use of a user-configurable monitoring boundary. This approach has been implemented in the second generation of the Lʀ runtime verification tool, polyLʀ.

show abstract

Reducing the Cost of Path Property Monitoring Through Sampling

Cited by 22 publications

References 26 publications

Online inference and enforcement of temporal properties

Online inference and enforcement of temporal properties

Clara: Partially Evaluating Runtime Monitors at Compile Time

polyLarva: Runtime Verification with Configurable Resource-Aware Monitoring Boundaries

Contact Info

Product

Resources

About