Paper Info
Title
Run-time verification of networked software
Abstract
Most applications that are in use today inter-operate with other applications, so-called peers, over a network. The analysis of such distributed applications requires that the effect of the communication with peers is included. This can be achieved by writing or generating stubs of peers, or by including all processes in the execution environment. The latter approach also requires special treatment of network communication primitives. We also present an alternative approach, which analyzes a networked application by recording and caching its communication with peers. Caching becomes useful when several traces of the application are analyzed. It dispenses with the need of generating a new peer application execution for each different execution of the main application. Such a caching framework for input/output has been implemented on the Java PathFinder platform, which can be used to verify executions of nondeterministic applications at run-time.
Year
DOI
Venue
2010
10.1007/978-3-642-16612-9_7
RV
Keywords
Field
DocType
networked software,caching framework,latter approach,nondeterministic application,application execution,different execution,alternative approach,execution environment,networked application,main application,run-time verification,network communication primitive,distributed application,input output
System under test,Java pathfinder,Nondeterministic algorithm,Computer science,Network communication,Real-time computing,Software,Application programming interface,Fault injection,Operating system,Distributed computing
Conference
Volume
ISSN
ISBN
6418
0302-9743
3-642-16611-3
Citations 
PageRank 
References 
0
0.34
21
Authors
1
Name
Order
Citations
PageRank
Cyrille Artho158844.46