Abstract | ||
---|---|---|
We present an approach for the verification aggregation protocols, which may be used to perform critical tasks and thus should be verified. We formalize the class of track topology aggregation protocols and provide a parameterized proof of correctness where the problem is reduced to checking a property of the node's aggregation algorithm. We provide a verification rule based on our property and illustrate the approach by verifying a non-trivial aggregation protocol. |
Year | DOI | Venue |
---|---|---|
2013 | 10.1007/978-3-642-38592-6_4 | Lecture Notes in Computer Science |
Field | DocType | Volume |
Topology,Parameterized complexity,Rule-based system,Computer science,Correctness,Theoretical computer science,Wireless sensor network,Distributed computing | Conference | 7892 |
ISSN | Citations | PageRank |
0302-9743 | 0 | 0.34 |
References | Authors | |
12 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Sergio Feo-Arenis | 1 | 21 | 4.00 |
Bernd Westphal | 2 | 43 | 8.45 |