Sciweavers

67 search results - page 1 / 14
» Rewriting-Based Techniques for Runtime Verification
Sort
View
ASE
2005
137views more  ASE 2005»
13 years 4 months ago
Rewriting-Based Techniques for Runtime Verification
Techniques for efficiently evaluating future time Linear Temporal Logic (abbreviated LTL) formulae on finite execution traces are presented. While the standard models of LTL are i...
Grigore Rosu, Klaus Havelund
LOGCOM
2010
154views more  LOGCOM 2010»
12 years 11 months ago
Collaborative Runtime Verification with Tracematches
Perfect pre-deployment test coverage is notoriously difficult to achieve for large applications. Given enough end users, however, many more test cases will be encountered during a...
Eric Bodden, Laurie J. Hendren, Patrick Lam, Ondre...
DAC
2008
ACM
14 years 5 months ago
Predictive runtime verification of multi-processor SoCs in SystemC
Concurrent interaction of multi-processor systems result in errors which are difficult to find. Traditional simulationbased verification techniques remove the concurrency informat...
Alper Sen, Vinit Ogale, Magdy S. Abadir
RV
2010
Springer
171views Hardware» more  RV 2010»
13 years 2 months ago
Runtime Verification for Software Transactional Memories
Software transactional memories (STMs) promise simple and efficient concurrent programming. Several correctness properties have been proposed for STMs. Based on a bounded conflict ...
Vasu Singh
CCR
2004
151views more  CCR 2004»
13 years 4 months ago
Practical verification techniques for wide-area routing
Protocol and system designers use verification techniques to analyze a system's correctness properties. Network operators need verification techniques to ensure the "cor...
Nick Feamster