This file was created by the TYPO3 extension
bib
--- Timezone: CEST
Creation date: 2024-07-04
Creation time: 05-23-48
--- Number of references
5
inproceedings
2010-sensys-sasnauskas-coojakleenet
Demo Abstract: Integrating Symbolic Execution with Sensornet Simulation for Efficient Bug Finding
2010
11
383--384
High-coverage testing of sensornet applications is vital for pre-deployment bug cleansing, but has previously been difficult due to the limited set of available tools. We integrate the KleeNet symbolic execution engine with the COOJA network simulator to allow for straight-forward and intuitive high-coverage testing initiated from a simulation environment. A tight coupling of simulation and testing helps detect, narrow down, and fix complex interaction bugs in an early development phase. We demonstrate the seamless transition between COOJA simulation and KleeNet symbolic execution. Our framework enables future research in how high-coverage testing tools could be used in cooperation with simulation tools.
kleenet
fileadmin/papers/2010/2010-osterlind_sasnauskas-sensys-coojakleenet.pdf
Print
ACM
New York, NY, USA
Proceedings of the 8th ACM Conference on Embedded Networked Sensor Systems (SenSys 2010), Zurich, Switzerland
en
978-1-4503-0344-6
http://doi.acm.org/10.1145/1869983.1870034
1
FredrikĂ–sterlind
RaimondasSasnauskas
AdamDunkels
OscarSoria Dustmann
KlausWehrle
inproceedings
2010softcomweingaertnerprotocolanalysis
Flexible Analysis of Distributed Protocol Implementations using Virtual Time
2010
9
23
225 - 229
available in IEEE Xplore
https://www.comsys.rwth-aachen.de/fileadmin/papers/2010/2010-weingaertner-softcom-analysis.pdf
Online
FESB
Split, Croatia
Proceedings of the 18th International Conference on Software, Telecommunications and Computer Networks (SoftCOM 2010)
Hvar, Croatia
en
978-1-4244-8663-2
1
EliasWeingaertner
MarkoRitter
RaimondasSasnauskas
KlausWehrle
inbook
2010-simtools-sasnauskas-transport
Modeling Transport Layer Protocols
2010
6
389-399
Print
Klaus Wehrle, Mesut Guenes, James Gross
Springer
Germany
17
Modeling and Tools for Network Simulation
en
978-3-642-12330-6
1
RaimondasSasnauskas
EliasWeingaertner
inproceedings
2010-ipsn-sasnauskas-kleenet
KleeNet: Discovering Insidious Interaction Bugs in Wireless Sensor Networks Before Deployment
2010
4
12
186--196
Complex interactions and the distributed nature of wireless sensor networks make automated testing and debugging before deployment a necessity. A main challenge is to detect bugs that occur due to non-deterministic events, such as node reboots or packet duplicates. Often, these events have the potential to drive a sensor network and its applications into corner-case situations, exhibiting bugs that are hard to detect using existing testing and debugging techniques. In this paper, we present KleeNet, a debugging environment that effectively discovers such bugs before deployment. KleeNet executes unmodified sensor network applications on symbolic input and automatically injects non-deterministic failures. As a result, KleeNet generates distributed execution paths at high-coverage, including low-probability corner-case situations. As a case study, we integrated KleeNet into the Contiki OS and show its effectiveness by detecting four insidious bugs in the uIP TCP/IP protocol stack. One of these bugs is critical and lead to refusal of further connections.
automated protocol testing, experimentation, failure detection, wireless sensor networks
kleenet
fileadmin/papers/2010/2010-04-ipsn-sasnauskas-KleeNet.pdf
Print
ACM
New York, NY, USA
Proceedings of the 9th ACM/IEEE International Conference on Information Processing in Sensor Networks (IPSN 2010), Stockholm, Sweden
en
978-1-60558-988-6
http://doi.acm.org/10.1145/1791212.1791235
1
RaimondasSasnauskas
OlafLandsiedel
Muhammad HamadAlizai
CarstenWeise
StefanKowalewski
KlausWehrle
inproceedings
20104-IPSN-alizai-svr
Poster Abstract: Statistical Vector based Point-to-Point Routing in Wireless Networks
2010
4
12
366-367
We present Statistical Vector Routing (SVR), a protocol that efficiently deals with communication link dynamics in wireless networks. It assigns virtual coordinates to nodes based on the statistical distribution of their distance from a small set of beacons. The distance metric predicts the current location of a node in its address distribution. Our initial results from a prototype implementation over real testbeds demonstrate the feasibility of SVR.
wld
https://www.comsys.rwth-aachen.de/fileadmin/papers/2010/2010-alizai-ipsn-pad.pdf
http://portal.acm.org/citation.cfm?id=1791257
Print
ACM
New York, NY, USA
Proceedings of the 9th ACM/IEEE International Conference on Information Processing in Sensor Networks (IPSN 2010), Stockholm, Sweden
Stockholm, Sweden
9th ACM/IEEE International Conference on Information Processing in Sensor Networks (IPSN 2010)
April 12-16, 2010
en
978-1-60558-988-6
1
Muhammad HamadAlizai
TobiasVaegs
OlafLandsiedel
RaimondasSasnauskas
KlausWehrle