Sciweavers

67 search results - page 2 / 14
» Rewriting-Based Techniques for Runtime Verification
Sort
View
ENTCS
2006
90views more  ENTCS 2006»
13 years 5 months ago
Runtime Verification for High-Confidence Systems: A Monte Carlo Approach
We present a new approach to runtime verification that utilizes classical statistical techniques such as Monte Carlo simulation, hypothesis testing, and confidence interval estima...
Sean Callanan, Radu Grosu, Abhishek Rai, Scott A. ...
SIGSOFT
2008
ACM
14 years 6 months ago
Finding programming errors earlier by evaluating runtime monitors ahead-of-time
Runtime monitoring allows programmers to validate, for instance, the proper use of application interfaces. Given a property specification, a runtime monitor tracks appropriate run...
Eric Bodden, Patrick Lam, Laurie J. Hendren
AMAST
2008
Springer
13 years 7 months ago
Towards an Efficient Implementation of Tree Automata Completion
Term Rewriting Systems (TRSs) are now commonly used as a modeling language for applications. In those rewriting based models, reachability analysis, i.e. proving or disproving that...
Emilie Balland, Yohan Boichut, Thomas Genet, Pierr...
ATAL
2006
Springer
13 years 9 months ago
Run-time model checking of interaction and deontic models for multi-agent systems
This paper is concerned with the problem of obtaining predictable interactions between groups of agents in open environments when individual agents do not expose their bdi logic. ...
Nardine Osman, David Robertson, Christopher Walton
PERCOM
2010
ACM
13 years 3 months ago
Towards automated verification of autonomous networks: A case study in self-configuration
In autonomic networks, the self-configuration of network entities is one of the most desirable properties. In this paper, we show how formal verification techniques can verify the ...
JaeSeung Song, Tiejun Ma, Peter R. Pietzuch