This file was created by the TYPO3 extension bib --- Timezone: CEST Creation date: 2024-04-18 Creation time: 03-41-00 --- Number of references 11 inbook 2010-simtools-sasnauskas-transport 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 2012-wripe-sasnauskas-symnet 2012 10 6 S. kleenet fileadmin/papers/2012/2012-09-wripe-sasnauskas-SymNet.pdf Print Online

Piscataway, NJ, USA

The 2nd International Workshop on Rigorous Protocol Engineering (WRiPE 2012), 30 October - 02 November 2012, Austin, TX, USA IEEE Austin, TX, USA The 2nd International Workshop on Rigorous Protocol Engineering (WRiPE 2012) October 30 - November 02 2012 en 978-1-4673-2445-8 10.1109/ICNP.2012.6459940 1 RaimondasSasnauskas PhilippKaiser Russ LucasJukić KlausWehrle inproceedings 2012-taicpart-dustmann-symbolic-time 2012 4 We propose an extension of symbolic execution of distributed systems to test software parts related to timing. Currently, the execution model is limited to symbolic input for individual nodes, not capturing the important class of timing errors resulting from varying network conditions. In this paper, we introduce symbolic system time in order to systematically find timing-related bugs in distributed systems. Instead of executing time events at a concrete time, we execute them at a set of times and analyse possible event interleavings on demand. We detail on the resulting problem space, discuss possible algorithmic optimisations, and highlight our future research directions. kleenet fileadmin/papers/2012/2012-04-taicpart-soriadustmann-symtime.pdf TAICPART'2012 en 1 OscarSoria Dustmann RaimondasSasnauskas KlausWehrle inproceedings 2011-icdcs-sasnauskas-sde 2011 6 333-342 Recent advances in symbolic execution have proposed a number of promising solutions to automatically achieve high-coverage and explore non-determinism during testing. This attractive testing technique of unmodified software assists developers with concrete inputs and deterministic schedules to analyze erroneous program paths. Being able to handle complex systems' software, these tools only consider single software instances and not their distributed execution which forms the core of distributed systems. The step to symbolic distributed execution is however steep, posing two core challenges: (1) additional state growth and (2) the state intra-dependencies resulting from communication. In this paper, we present SDE—a novel approach enabling scalable symbolic execution of distributed systems. The key contribution of our work is two-fold. First, we generalize the problem space of SDE and develop an algorithm significantly eliminating redundant states during testing. The key idea is to benefit from the nodes' local communication minimizing the number of states representing the distributed execution. Second, we demonstrate the practical applicability of SDE in testing with three sensornet scenarios running Contiki OS. kleenet fileadmin/papers/2011/2011-06-icdcs-sasnauskas-sde.pdf Druck IEEE Computer Society

Los Alamitos, CA, USA

Proceedings of the 31st IEEE International Conference on Distributed Computing Systems (ICDCS 2011), June 2011, Minneapolis, MN, USA en 978-0-7695-4364-2 1063-6927 10.1109/ICDCS.2011.28 1 RaimondasSasnauskas OscarSoria Dustmann Benjamin LucienKaminski CarstenWeise StefanKowalewski KlausWehrle inproceedings 2010-sensys-sasnauskas-coojakleenet 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 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 inproceedings 2010-ipsn-sasnauskas-kleenet 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 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 inproceedings 2008-sensys-sasnauskas-kleenet 2008 11 425--426 We present KleeNet, a Klee based bug hunting tool for sensor network applications before deployment. KleeNet automatically tests code for all possible inputs, ensures memory safety, and integrates well into TinyOS based application development life cycle, making it easy for developers to test their applications. bug finding, memory safety, tinyos, type safety kleenet fileadmin/papers/2008/2008-11-Sasnauskas-SenSys08-KleeNet.pdf Print ACM

New York, NY, USA

Proceedings of the 6th ACM conference on Embedded network sensor systems (SenSys'08), Raleigh, NC, USA en 978-1-59593-990-6 http://doi.acm.org/10.1145/1460412.1460485 1 RaimondasSasnauskas Jó AgilaBitsch Link Muhammad HamadAlizai KlausWehrle mastersthesis 2007-thesis-sasnauskas-firewall 2007 5 15 Print Universität Tübingen Lehrstuhl für Rechnernetze und Internet Diplomarbeit de 1 1 RaimondasSasnauskas techreport 2008-fgsn-sasnauskas-kleenet 2008 9 Testing sensor network applications is an essential and a difficult task. Due to their distributed and faulty nature, severe resource constraints, unobservable interactions, and limited human interaction, sensor networks, make monitoring and debugging of applications strenuous and more challenging. In this paper we present KleeNet - a Klee based platform independent bug hunting tool for sensor network applications before deployment - which can automatically test applications for all possible inputs, and hence, ensures memory safety for TinyOS based applications. Upon finding a bug, KleeNet generates a concrete test case with real input values identifying a specific error path in a program. Additionally, we show that KleeNet integrates well into TinyOS application development life cycle with minimum manual effort, making it easy for developers to test their applications. kleenet fileadmin/papers/2008/2008-09-Sasnauskas-FGSN08-BugHunting.pdf ftp://ftp.inf.fu-berlin.de/pub/reports/tr-b-08-12.pdf Print Freie Universität Berlin, Institute of Computer Science

Berlin, Germany

Proceedings of the 7th GI/ITG Fachgespraech Wireless Sensor Networks, Berlin, Germany Chair of Communication and Distributed Systems (ComSys) en 1 RaimondasSasnauskas Jó AgilaBitsch Link Muhammad HamadAlizai KlausWehrle