This file was created by the TYPO3 extension bib --- Timezone: CEST Creation date: 2024-04-20 Creation time: 14-56-03 --- Number of references 1 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