Oscar Soria Dustmann, M.Sc.

Communication and Distributed Systems
RWTH Aachen University
Ahornstr. 55, 52074 Aachen, Germany

E-Mail: oscar.soriadustmann@comsys.rwth-aachen.de
XMPP/Jabber: oscar.dustmann@jabber.rwth-aachen.de
Phone: +49 241 80-21419

PGP key
PGP-Fingerprint: 372E 1D1E EA96 FDF2 6B86 A347 E3AC 337E 274A 3C26

I speak: Deutsch, English

Office: Building E3, Room 9002


My research interests include

  • Software reliability, especially in networked systems
  • Various testing paradigms, including unmodified and modelled approaches
  • Symbolic execution in particular
  • Influence of time on systems

I'm involved in the past KleeNet project and the current SYMBIOSYS project.

Besides computer science I am actively involved in various social justice movements.


Oscar Soria Dustmann, Klaus Wehrle and Cristian Cadar
Proceedings of the 2018 Conference on Automated Software Engineering (ASE'18)
September 2018
to be published
Daniel Schemmel, Julian Büning, Oscar Soria Dustmann, Thomas Noll and Klaus Wehrle
Proceedings of the 30th International Conference on Computer Aided Verification (CAV'18)
July 2018
ISBN: 978-3-319-96142-2
Proceedings of the 4th ACM SIGSIM/PADS Conference on Principles of Advanced Discrete Simulation (SIGSIM-PADS’16), Banff, AB, Canada, page 221-232.
Publisher: ACM, New York, NY
May 2016

Keywords: Automatic Memoization; Accelerating Parameter Studies; Impure Languages

RWTH Aachen University
Dagstuhl Seminar
February 2015

Abstract: Creating new adaptive Internet technologies as envisioned by the MAKI project requires the interaction of a plethora of different modules, submodules and hardware platforms. Implementation-defined behaviour and the inherent concurrency and communication delay of these systems are the primary sources of many potential types of errors. As can already be observed in current highly distributed systems such errors tend to hide in sometimes quite obscure corner-cases. For example, a catastrophic protocol lock-up might manifest only for an unlikely, unexpected packet reordering. In addition, incompatibilities stemming from the heterogeneity of subsystems, demand further attention for testing approaches. This work aims at devising methodologies that address particularly timing and heterogeneity related issues in distributed and networked systems, with a focus on event-driven software.

4. Praxis der Informationsverarbeitung und Kommunikation (PIK Journal), 35(4):289–295
November 2012
ISSN: 0930-5157

Abstract: Zum Testen verteilter bzw. vernetzter Systeme existieren zahlreiche Werkzeuge, welche für das Rapid Prototyping und die Fehler-Rekonstruktion unerlässlich sind. Durch verschieden stark abstrahierte Modelle lassen sich auf diese Weise, bereits früh in der Entwicklung verteilter Systeme, Aussagen über Performanz, Konsistenz und Korrektheit von Netzwerkprotokollen treffen. Diese Verfahren arbeiten auf explizit für den Testvorgang entworfenen Modellimplementierungen, welche zwar teilweise Quelltext mit der Produktionssoftware gemein haben, aber viele Aspekte und potentielle Fehlerquellen einer tatsächlichen Software unberücksichtigt lassen. In diesem Artikel werden die Grundlagen von Testparadigmen beschrieben, welche die Ausführung unmodifizierter Software erlauben und dabei ermöglichen, eine hohe Zuversicht in die getesteten Systeme zu gewinnen. Der Fokus liegt dabei auf der Optimierung von Algorithmen um die redundante Ausführung des Systems zu minimieren, wodurch sich die zum Testen benötigte Zeit um Größenordnungen verringert.

April 2012

Abstract: 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.

Raimondas Sasnauskas, Oscar Soria Dustmann, Benjamin Lucien Kaminski, Carsten Weise, Stefan Kowalewski and Klaus Wehrle
Proceedings of the 31st IEEE International Conference on Distributed Computing Systems (ICDCS 2011), June 2011, Minneapolis, MN, USA, page 333-342.
Publisher: IEEE Computer Society, Los Alamitos, CA, USA
June 2011
ISBN: 978-0-7695-4364-2

Abstract: 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.

Fredrik Österlind, Raimondas Sasnauskas, Adam Dunkels, Oscar Soria Dustmann and Klaus Wehrle
Proceedings of the 8th ACM Conference on Embedded Networked Sensor Systems (SenSys 2010), Zurich, Switzerland, page 383--384.
Publisher: ACM, New York, NY, USA
November 2010
ISBN: 978-1-4503-0344-6

Abstract: 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.

Export as: