Sciweavers

5 search results - page 1 / 1
» Matching Trace Patterns with Regular Policies
Sort
View
LATA
2009
Springer
13 years 11 months ago
Matching Trace Patterns with Regular Policies
Abstract. We consider policies that are described by regular expressions, finite automata, or formulae of linear temporal logic (LTL). Such policies are assumed to describe situat...
Franz Baader, Andreas Bauer 0002, Alwen Tiu
OOPSLA
2005
Springer
13 years 10 months ago
Adding trace matching with free variables to AspectJ
An aspect observes the execution of a base program; when certain actions occur, the aspect runs some extra code of its own. In the AspectJ language, the observations that an aspec...
Chris Allan, Pavel Avgustinov, Aske Simon Christen...
SIGCOMM
2003
ACM
13 years 10 months ago
A high-level programming environment for packet trace anonymization and transformation
Packet traces of operational Internet traffic are invaluable to network research, but public sharing of such traces is severely limited by the need to first remove all sensitive...
Ruoming Pang, Vern Paxson
ASE
2010
129views more  ASE 2010»
13 years 4 months ago
Efficient monitoring of parametric context-free patterns
Recent developments in runtime verification and monitoring show that parametric regular and temporal logic specifications can be efficiently monitored against large programs. Howev...
Patrick O'Neil Meredith, Dongyun Jin, Feng Chen, G...
JSAC
2008
111views more  JSAC 2008»
13 years 4 months ago
Socially-aware routing for publish-subscribe in delay-tolerant mobile ad hoc networks
Abstract--Applications involving the dissemination of information directly relevant to humans (e.g., service advertising, news spreading, environmental alerts) often rely on publis...
Paolo Costa, Cecilia Mascolo, Mirco Musolesi, Gian...